Computable performance guarantees for compressed sensing matrices

The null space condition for ℓ1 minimization in compressed sensing is a necessary and sufficient condition on the sensing matrices under which a sparse signal can be uniquely recovered from the observation data via ℓ1 minimization. However, verifying the null space condition is known to be computationally challenging. Most of the existing methods can provide only upper and lower bounds on the proportion parameter that characterizes the null space condition. In this paper, we propose new polynomial-time algorithms to establish upper bounds of the proportion parameter. We leverage on these techniques to find upper bounds and further develop a new procedure—tree search algorithm—that is able to precisely and quickly verify the null space condition. Numerical experiments show that the execution speed and accuracy of the results obtained from our methods far exceed those of the previous methods which rely on linear programming (LP) relaxation and semidefinite programming (SDP).

[1]  Enrique Mallada,et al.  Compressive sensing over graphs , 2010, 2011 Proceedings IEEE INFOCOM.

[2]  Weiyu Xu,et al.  Precise Stability Phase Transitions for $\ell_1$ Minimization: A Unified Geometric Framework , 2011, IEEE Transactions on Information Theory.

[3]  Robert D. Nowak,et al.  Network delay tomography , 2003, IEEE Trans. Signal Process..

[4]  Robert D. Nowak,et al.  Network tomography for internal delay estimation , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[5]  David L. Donoho,et al.  Neighborly Polytopes And Sparse Solution Of Underdetermined Linear Equations , 2005 .

[6]  Arkadi Nemirovski,et al.  On verifiable sufficient conditions for sparse signal recovery via ℓ1 minimization , 2008, Math. Program..

[7]  David L. Donoho,et al.  Precise Undersampling Theorems , 2010, Proceedings of the IEEE.

[8]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[9]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[10]  Weiyu Xu,et al.  New algorithms for verifying the null space conditions in compressed sensing , 2013, 2013 Asilomar Conference on Signals, Systems and Computers.

[11]  Gary L. Miller,et al.  Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , 1996, STOC 1996.

[12]  Mohammad Hamed Firooz,et al.  Network Tomography via Compressed Sensing , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[13]  Yoram Bresler,et al.  Computing performance guarantees for compressed sensing , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[14]  Robert Nowak,et al.  Network Tomography: Recent Developments , 2004 .

[15]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[16]  Gongguo Tang,et al.  Verifiable and computable ℓ∞ performance evaluation of ℓ1 sparse signal recovery , 2011, 2011 45th Annual Conference on Information Sciences and Systems.

[17]  Marc E. Pfetsch,et al.  The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing , 2012, IEEE Transactions on Information Theory.

[18]  Alexandre d'Aspremont,et al.  Testing the nullspace property using semidefinite programming , 2008, Math. Program..

[19]  Gilles Brassard,et al.  Fundamentals of Algorithmics , 1995 .

[20]  David Bruce Wilson,et al.  Generating random spanning trees more quickly than the cover time , 1996, STOC '96.

[21]  R. DeVore,et al.  Compressed sensing and best k-term approximation , 2008 .

[22]  T. Blumensath,et al.  Theory and Applications , 2011 .

[23]  Y. Vardi,et al.  Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data , 1996 .