Combining geometry and combinatorics: A unified approach to sparse signal recovery

• Main Authors: Berinde, R., Gilbert, A.C., Indyk, P., Karloff, H., Strauss, M.J.
• Format: Conference Proceeding
• Language: English
• Subjects: Approximation error; Cameras; Combinatorial mathematics; Computer networks; Geometry; Image coding; Signal processing; Signal processing algorithms; Sparse matrices; Vectors
• DOI: 10.1109/ALLERTON.2008.4797639

There are two main algorithmic approaches to sparse signal recovery: geometric and combinatorial. The geometric approach utilizes geometric properties of the measurement matrix Phi. A notable example is the Restricted Isometry Property, which states that the mapping Phi preserves the Euclidean norm of sparse signals; it is known that random dense matrices satisfy this constraint with high probability. On the other hand, the combinatorial approach utilizes sparse matrices, interpreted as adjacency matrices of sparse (possibly random) graphs, and uses combinatorial techniques to recover an approximation to the signal. In this paper we present a unification of these two approaches. To this end, we extend the notion of Restricted Isometry Property from the Euclidean lscr 2 norm to the Manhattan lscr 1 norm. Then we show that this new lscr 1 -based property is essentially equivalent to the combinatorial notion of expansion of the sparse graph underlying the measurement matrix. At the same time we show that the new property suffices to guarantee correctness of both geometric and combinatorial recovery algorithms. As a result, we obtain new measurement matrix constructions and algorithms for signal recovery which, compared to previous algorithms, are superior in either the number of measurements or computational efficiency of decoders.