A Probabilistic and RIPless Theory of Compressed Sensing

被引:371
作者
Candes, Emmanuel J. [1 ,2 ]
Plan, Yaniv [3 ]
机构
[1] Stanford Univ, Dept Math, Stanford, CA 94305 USA
[2] Stanford Univ, Dept Stat, Stanford, CA 94305 USA
[3] CALTECH, Dept Appl & Computat Math, Pasadena, CA 91125 USA
基金
美国国家科学基金会;
关键词
Compressed sensing; Dantzig selector; l(1) minimization; Gross' golfing scheme; LASSO; operator Bernstein inequalities; random matrices; sparse regression; (weak) restricted isometries; ROBUST UNCERTAINTY PRINCIPLES; RESTRICTED ISOMETRY PROPERTY; MAJORIZING MEASURES; SIGNAL RECOVERY; SPARSE; RECONSTRUCTION; MATRICES;
D O I
10.1109/TIT.2011.2161794
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a probability distribution F; it includes all standard models-e. g., Gaussian, frequency measurements-discussed in the literature, but also provides a framework for new measurement strategies as well. We prove that if the probability distribution F obeys a simple incoherence property and an isotropy property, one can faithfully recover approximately sparse signals from a minimal number of noisy measurements. The novelty is that our recovery results do not require the restricted isometry property (RIP) to hold near the sparsity level in question, nor a random model for the signal. As an example, the paper shows that a signal with s nonzero entries can be faithfully recovered from about s log n Fourier coefficients that are contaminated with noise.
引用
收藏
页码:7235 / 7254
页数:20
相关论文
共 51 条
[1]   Strong converse for identification via quantum channels [J].
Ahlswede, R ;
Winter, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (03) :569-579
[2]  
[Anonymous], 2009, P SPARS 09 SIGN PROC
[3]  
[Anonymous], 2010, Theoretical foundations and numerical methods for sparse recovery, DOI DOI 10.1515/9783110226157.1
[4]  
Bah B., 2010, IMPROVED BOUNDS REST
[5]   A Simple Proof of the Restricted Isometry Property for Random Matrices [J].
Baraniuk, Richard ;
Davenport, Mark ;
DeVore, Ronald ;
Wakin, Michael .
CONSTRUCTIVE APPROXIMATION, 2008, 28 (03) :253-263
[6]  
Bayati M., 2010, LASSO RISK GAUSSIAN
[7]   SIMULTANEOUS ANALYSIS OF LASSO AND DANTZIG SELECTOR [J].
Bickel, Peter J. ;
Ritov, Ya'acov ;
Tsybakov, Alexandre B. .
ANNALS OF STATISTICS, 2009, 37 (04) :1705-1732
[8]   APPROXIMATION OF ZONOIDS BY ZONOTOPES [J].
BOURGAIN, J ;
LINDENSTRAUSS, J ;
MILMAN, V .
ACTA MATHEMATICA, 1989, 162 (1-2) :73-141
[9]   New Bounds for Restricted Isometry Constants [J].
Cai, T. Tony ;
Wang, Lie ;
Xu, Guangwu .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (09) :4388-4394
[10]   Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information [J].
Candès, EJ ;
Romberg, J ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) :489-509