Stable recovery of sparse signals via lp-minimization

Applied and Computational Harmonic Analysis

Volumn 38, Issue 1, 2015, Pages 161-176

  Wen, Jinming ^a   Li, Dongfang ^b   Zhu, Fumin ^c,d  

^a MCGILL UNIVERSITY   (Canada)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^c SOUTHWESTERN UNIVERSITY OF FINANCE AND ECONOMICS   (China)

^d USA   (United States)

Author keywords

Compressed sensing; Lp minimization; Restricted isometry constant; Sparse signal recovery

Indexed keywords

COMPRESSED SENSING; RECOVERY;

RESTRICTED ISOMETRIES; SPARSE SIGNAL RECOVERIES; SPARSE SIGNALS;

SIGNAL RECONSTRUCTION;

EID: 84922692889     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1016/j.acha.2014.06.003     Document Type: Letter

References (19)

1. E.J. Candes, T. Tao, Decoding by linear programming, IEEE Trans. Inform. Theory 51 (12) (2005) 4203-4215.
2. D.L. Donoho, Compressed sensing, IEEE Trans. Inform. Theory 52 (4) (2006) 1289-1306.
3. A. Cohen, W. Dahmen, R. DeVore, Compressed sensing and best fc-term approximation, J. Amer. Math. Soc. 22 (2009) 211-231.
4. J.J. Fuchs, Recovery of exact sparse representations in the presence of bounded noise, IEEE Trans. Inform. Theory 51 (10) (2005) 3601-3608.
5. D.L. Donoho, M. Elad, V.N. Temlyakov, Stable recovery of sparse overcomplete representations in the presence of noise, IEEE Trans. Inform. Theory 52 (2006) 6-18.
6. E.J. Candes, The restricted isometry property and its implications for compressed sensing, C. R. Acad. Sci. Paris, Ser. I 346 (11) (2008) 589-592.
7. E.J. Candes, J. Romberg, T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Comm. Pure Appl. Math. 59 (2006) 1207-1223.
8. Q. Mo, S. Li, New bounds on the restricted isometry constant 62k, Appl. Comput. Harmon. Anal. 31 (2011) 460-468.
9. E.J. Candes, T. Tao, The Dantzig selector: Statistical estimation when P is much larger than n, Ann. Statist. 35 (2007) 2313-2351.
10. T. Cai, A. Zhang, Sharp RIP bound for sparse signal and low-rank matrix recovery, Appl. Comput. Harmon. Anal. 35 (2013) 74-93.
11. S. Foucart, M.-J. Lai, Sparsest solutions of underdetermined linear systems via LQ-minimization for 0
12. T. Cai, A. Zhang, Sparse representation of a polytope and recovery of sparse signals and low-rank matrices, IEEE Trans. Inform. Theory 60 (1) (2014) 122-132.
13. M.E. Davies, R. Gribonval, Restricted isometry constants where LP sparse recovery can fail for 0
14. M.-J. Lai, L.Y. Liu, A new estimate of restricted isometry constants for sparse solutions, http://www.math.uga.edu/~mjlai/ papers/LaiLiu11.pdf, 2011.
15. R. Wu, D.-R. Chen, The improved bounds of restricted isometry constant for recovery via LP-minimization, IEEE Trans. Inform. Theory 59 (9) (2013) 6142-6147.
16. I. Daubechies, R. DeVore, M. Fornasier, S. Gunturk, Iteratively reweighted least squares minimization for sparse recovery, Comm. Pure Appl. Math. 63 (1) (2010) 1-38.
17. R. Chartrand, Exact reconstruction of sparse signals via nonconvex minimization, IEEE Signal Process. Lett. 14 (10) (2007) 707-710.
18. S. Bahmani, B. Raj, A unifying analysis of projected gradient descent for LP-constrained least squares, Appl. Comput. Harmon. Anal. 34 (11) (2013) 366-378.
19. S. Foucart, Sparse recovery algorithms: Sufficient conditions in terms of restricted isometry constants, in: Approximation Theory XIII, San Antonio 2010, in: Springer Proceedings in Mathematics, vol. 13, 2010, pp. 65-77.