On the Gap Between Restricted Isometry Properties and Sparse Recovery Conditions

被引:35
作者
Dirksen, Sjoerd [1 ]
Lecue, Guillaume [2 ,3 ]
Rauhut, Holger [1 ]
机构
[1] Rhein Westfal TH Aachen, Lehrstuhl Math Anal C, D-52062 Aachen, Germany
[2] Ecole Polytech, CNRS, F-91120 Palaiseau, France
[3] Ecole Polytech, Ctr Math Appl Equipes Rech, F-91120 Palaiseau, France
基金
欧洲研究理事会;
关键词
Restricted isometry property; compressive sensing; l(p)-constrained basis pursuit; Gaussian random matrix; quantized compressive sensing; SIGNAL RECOVERY; RANDOM MATRICES; CONVEX-BODIES; RECONSTRUCTION; GEOMETRY;
D O I
10.1109/TIT.2016.2570244
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider the problem of recovering sparse vectors from underdetermined linear measurements via l(p)-constrained basis pursuit. Previous analyses of this problem based on generalized restricted isometry properties have suggested that two phenomena occur if p not equal 2. First, one may need substantially more than s log(en / s) measurements (optimal for p = 2) for uniform recovery of all s-sparse vectors. Second, the matrix that achieves recovery with the optimal number of measurements may not be Gaussian (as for p = 2). We present a new, direct analysis, which shows that in fact neither of these phenomena occur. Via a suitable version of the null space property, we show that a standard Gaussian matrix provides l(q)/l(1)-recovery guarantees for l(p)-constrained basis pursuit in the optimal measurement regime. Our result extends to several heavier-tailed measurement matrices. As an application, we show that one can obtain a consistent reconstruction from uniform scalar quantized measurements in the optimal measurement regime.
引用
收藏
页码:5478 / 5487
页数:10
相关论文
共 35 条
[1]   Restricted Isometry Property of Matrices with Independent Columns and Neighborly Polytopes by Random Sampling [J].
Adamczak, R. ;
Litvak, A. E. ;
Pajor, A. ;
Tomczak-Jaegermann, N. .
CONSTRUCTIVE APPROXIMATION, 2011, 34 (01) :61-88
[2]  
Adamczak R., 2014, CIRCULAR LAW RANDOM
[3]   Geometry of log-concave ensembles of random matrices and approximate reconstruction [J].
Adamczak, Radoslaw ;
Latala, Rafal ;
Litvak, Alexander E. ;
Pajor, Alain ;
Tomczak-Jaegermann, Nicole .
COMPTES RENDUS MATHEMATIQUE, 2011, 349 (13-14) :783-786
[4]  
Allen-Zhu Z., 2014, RESTRICTED ISOMETRY
[5]  
[Anonymous], BOUNDING SMALLEST SI
[6]  
[Anonymous], LEARNING CONCENTRATI
[7]   Combining geometry and combinatorics: a unified approach to sparse signal recovery [J].
Berinde, R. ;
Gilbert, A. C. ;
Indyk, P. ;
Karloff, H. ;
Strauss, M. J. .
2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, :798-+
[8]  
Bobkov SG, 2003, LECT NOTES MATH, V1807, P53
[9]  
Boufounos P.T., 2014, QUANTIZATION COMPRES
[10]  
Boyd Stephen., 2004, Convex Optimization, P89, DOI 10.1017/CBO9780511804441