Compressed sensing with corrupted Fourier measurements

This paper studies a data recovery problem in compressed sensing (CS), given a measurement vector b with corruptions: b=Ax0+f0, can we recover x0 and f0 via the reweighted l1 minimization: minimize |x| + lambda*|f| subject to Ax+f=b? Here the m by n measurement matrix A is a partial Fourier matrix, x0 denotes the n dimensional ground true signal vector, f0 denotes the m-dimensional corrupted noise vector, it is assumed that a positive fraction of entries in the measurement vector b are corrupted by the non-zero entries of f0. This problem had been studied in literatures [1-3], unfortunately, certain random assumptions (which are often hard to meet in practice) are required for the signal x0 in these papers. In this paper, we show that x0 and f0 can be recovered exactly by the solution of the above reweighted l1 minimization with high probability provided that m>O(card(x0)log(n)log(n)) and n is prime, here card(x0) denotes the cardinality (number of non-zero entries) of x0. Except the sparsity, no extra assumption is needed for x0.

[1]  Rina Foygel,et al.  Corrupted Sensing: Novel Guarantees for Separating Structured Signals , 2013, IEEE Transactions on Information Theory.

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

[3]  J CandesEmmanuel,et al.  A Probabilistic and RIPless Theory of Compressed Sensing , 2011 .

[4]  Allen Y. Yang,et al.  Robust Face Recognition via Sparse Representation , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Emmanuel J. Candès,et al.  Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions , 2004, Found. Comput. Math..

[6]  Xiaodong Li,et al.  Compressed Sensing and Matrix Completion with Constant Proportion of Corruptions , 2011, Constructive Approximation.

[7]  M. Rudelson,et al.  On sparse reconstruction from Fourier and Gaussian measurements , 2008 .

[8]  MaYi,et al.  Dense error correction via l1-minimization , 2010 .

[9]  Trac D. Tran,et al.  Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization , 2011, IEEE Transactions on Information Theory.

[10]  T. Tao.  An uncertainty principle for cyclic groups of prime order , 2003, math/0308286.

[11]  Jean-Jacques Fuchs,et al.  On sparse representations in arbitrary redundant bases , 2004, IEEE Transactions on Information Theory.

[12]  Dongcai Su,et al.  Compressed sensing with corrupted observations , 2016, ArXiv.

[13]  Holger Rauhut,et al.  A Mathematical Introduction to Compressive Sensing , 2013, Applied and Numerical Harmonic Analysis.

[14]  Emmanuel J. Candès,et al.  A Probabilistic and RIPless Theory of Compressed Sensing , 2010, IEEE Transactions on Information Theory.

[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]  Yi Ma,et al.  Robust principal component analysis? , 2009, JACM.

[17]  Richard G. Baraniuk,et al.  Democracy in Action: Quantization, Saturation, and Compressive Sensing , 2011 .