On the perturbation of measurement matrix in non-convex compressed sensing

We study lp(0<p<1) minimization under both additive and multiplicative noise. Theorems are presented for completely perturbed lp(0<p<1) minimization. Theorems reveal that under suitable conditions the stability of lp minimization with certain values of 0<p<10<p<1 is limited by the noise level in the observation. The restricted isometry property condition and the worst case reconstruction error bound are given in terms of restricted isometry constant and relative perturbations. Simulation results are presented and compared to state-of-the-art methods.

[1]  Lawrence Carin,et al.  Bayesian Compressive Sensing , 2008, IEEE Transactions on Signal Processing.

[2]  Laurent Jacques,et al.  A short note on compressed sensing with partially known signal support , 2009, Signal Process..

[3]  Deanna Needell,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.

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

[5]  Mário A. T. Figueiredo,et al.  Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems , 2007, IEEE Journal of Selected Topics in Signal Processing.

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

[7]  Bhaskar D. Rao,et al.  An affine scaling methodology for best basis selection , 1999, IEEE Trans. Signal Process..

[8]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[9]  E. Candès.  The restricted isometry property and its implications for compressed sensing , 2008 .

[10]  Thomas Strohmer,et al.  High-Resolution Radar via Compressed Sensing , 2008, IEEE Transactions on Signal Processing.

[11]  Jie Ding,et al.  Performance analysis of Orthogonal Matching Pursuit under general perturbations , 2012, 2012 International Conference on Computing, Networking and Communications (ICNC).

[12]  Thomas Arildsen,et al.  Model-Based Calibration of Filter Imperfections in the Random Demodulator for Compressive Sensing , 2013, ArXiv.

[13]  Aggelos K. Katsaggelos,et al.  Non-convex priors in Bayesian compressed sensing , 2009, 2009 17th European Signal Processing Conference.

[14]  Taner Ince,et al.  Nonconvex compressed sensing with partially known signal support , 2013, Signal Process..

[15]  Aggelos K. Katsaggelos,et al.  Bayesian Compressive Sensing Using Laplace Priors , 2010, IEEE Transactions on Image Processing.

[16]  Stephen P. Boyd,et al.  An Interior-Point Method for Large-Scale $\ell_1$-Regularized Least Squares , 2007, IEEE Journal of Selected Topics in Signal Processing.

[17]  Wotao Yin,et al.  Iteratively reweighted algorithms for compressive sensing , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[18]  Deanna Needell,et al.  Mixed operators in compressed sensing , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).

[19]  Thomas Strohmer,et al.  General Deviants: An Analysis of Perturbations in Compressed Sensing , 2009, IEEE Journal of Selected Topics in Signal Processing.

[20]  Yonina C. Eldar,et al.  From Theory to Practice: Sub-Nyquist Sampling of Sparse Wideband Analog Signals , 2009, IEEE Journal of Selected Topics in Signal Processing.

[21]  A. Robert Calderbank,et al.  Sensitivity to Basis Mismatch in Compressed Sensing , 2010, IEEE Transactions on Signal Processing.

[22]  Rayan Saab,et al.  Sparse Recovery by Non-convex Optimization -- Instance Optimality , 2008, ArXiv.

[23]  Thomas Arildsen,et al.  Sensitivity of the random demodulation framework to filter tolerances , 2011, 2011 19th European Signal Processing Conference.

[24]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.