Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. The Lyapunov function used in the early analysis by Tsitsiklis is shown to be the Hi...
Rodolphe Sepulchre, Alain Sarlette, Pierre Rouchon
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...
The accurate estimation of motion in image sequences is
of central importance to numerous computer vision applications.
Most competitive algorithms compute flow fields
by minimi...
Andreas Wedel, Daniel Cremers, Thomas Pock, Horst ...
In this paper, we study the security of an image scrambling algorithm based on Space-Filling Curves (SFC). A random SFC is a pixel permutation that changes the scanning order with...
Abstract. Modularity, the recently defined quality measure for clusterings, has attained instant popularity in the fields of social and natural sciences. We revisit the rationale b...