Recovery of Signals with Low Density

Sparse signals (i.e., vectors with a small number of non-zero entries) build the foundation of most kernel (or nullspace) results, uncertainty relations, and recovery guarantees in the sparse signal processing and compressive sensing literature. In this paper, we introduce a novel signal-density measure that extends the common notion of sparsity to non-sparse signals whose entries' magnitudes decay rapidly. By taking into account such magnitude information, we derive a more general and less restrictive kernel result and uncertainty relation. Furthermore, we demonstrate the effectiveness of the proposed signal-density measure by showing that orthogonal matching pursuit (OMP) provably recovers low-density signals with up to 2$\times$ more non-zero coefficients compared to that guaranteed by standard results for sparse signals.

[1]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[2]  D. Donoho,et al.  Uncertainty principles and signal recovery , 1989 .

[3]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[4]  Michael Elad,et al.  A generalized uncertainty principle and sparse representation in pairs of bases , 2002, IEEE Trans. Inf. Theory.

[5]  Rémi Gribonval,et al.  Sparse representations in unions of bases , 2003, IEEE Trans. Inf. Theory.

[6]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.

[7]  Michael Elad.  Sparse Representations Are Most Likely to Be the Sparsest Possible , 2006, EURASIP J. Adv. Signal Process..

[8]  Michael Elad,et al.  Stable recovery of sparse overcomplete representations in the presence of noise , 2006, IEEE Transactions on Information Theory.

[9]  Joel A. Tropp,et al.  Just relax: convex programming methods for identifying sparse signals in noise , 2006, IEEE Transactions on Information Theory.

[10]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[11]  Michael B. Wakin,et al.  An Introduction To Compressive Sampling [A sensing/sampling paradigm that goes against the common knowledge in data acquisition] , 2008 .

[12]  Michael Elad,et al.  From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images , 2009, SIAM Rev..

[13]  Michael B. Wakin,et al.  Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property , 2009, IEEE Transactions on Information Theory.

[14]  Michael Elad,et al.  Sparse and Redundant Representations - From Theory to Applications in Signal and Image Processing , 2010 .

[15]  Stephen J. Wright,et al.  Computational Methods for Sparse Solution of Linear Inverse Problems , 2010, Proceedings of the IEEE.

[16]  Yonina C. Eldar,et al.  Block-Sparse Signals: Uncertainty Relations and Efficient Recovery , 2009, IEEE Transactions on Signal Processing.

[17]  Yonina C. Eldar,et al.  Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise , 2009, IEEE Transactions on Signal Processing.

[18]  Gongguo Tang,et al.  Performance Analysis of Sparse Recovery Based on Constrained Minimal Singular Values , 2010, IEEE Transactions on Signal Processing.

[19]  Helmut Bölcskei,et al.  Recovery of Sparsely Corrupted Signals , 2011, IEEE Transactions on Information Theory.

[20]  Helmut Bölcskei,et al.  Uncertainty Relations and Sparse Signal Recovery for Pairs of General Signal Sets , 2011, IEEE Transactions on Information Theory.

[21]  Jack Xin,et al.  A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications , 2013, SIAM J. Imaging Sci..

[22]  Ernie Esser,et al.  NON-NEGATIVE LEAST SQUARES PROBLEMS WITH APPLICATIONS , 2013 .

[23]  Jan-Olov Strömberg,et al.  On the Theorem of Uniform Recovery of Random Sampling Matrices , 2012, IEEE Transactions on Information Theory.

[24]  Charles Soussen,et al.  Relaxed Recovery Conditions for OMP/OLS by Exploiting Both Coherence and Decay , 2014, IEEE Transactions on Information Theory.