Sparse recovery by non-convex optimization - Instance optimality

Applied and Computational Harmonic Analysis

Volumn 29, Issue 1, 2010, Pages 30-48

  Saab, Rayan ^a   Yilmaz, Özgür ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

1 minimization; p minimization; Compressed sensing; Compressive sampling; Instance optimality; Instance optimality in probability; Sparse reconstruction

Indexed keywords

COMPRESSED SENSING; COMPRESSIVE SAMPLING; LARGE CLASS; MEASUREMENT MATRIX; NONCONVEX OPTIMIZATION; OPTIMALITY; SPARSE RECONSTRUCTION; SPARSE RECOVERY; SUFFICIENT CONDITIONS;

CONVEX OPTIMIZATION; DECODING; PROBABILITY DISTRIBUTIONS; SIGNAL RECONSTRUCTION;

OPTIMIZATION;

EID: 77955275408     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1016/j.acha.2009.08.002     Document Type: Article

References (30)

1. R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin A simple proof of the restricted isometry property for random matrices Constr. Approx. 28 3 2008 253 263
2. E.J. Cands, J. Romberg, and T. Tao Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information IEEE Trans. Inform. Theory 52 2006 489 509
3. E.J. Cands, J. Romberg, and T. Tao Stable signal recovery from incomplete and inaccurate measurements Comm. Pure Appl. Math. 59 2006 1207 1223
4. E.J. Cands, and T. Tao Decoding by linear programming IEEE Trans. Inform. Theory 51 12 2005 489 509
5. E.J. Cands, and T. Tao Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans. Inform. Theory 52 12 2006 5406 5425
6. E.J. Cands The restricted isometry property and its implications for compressed sensing C. R. Math. 346 9-10 2008 589 592
7. R. Chartrand, and V. Staneva Restricted isometry properties and nonconvex compressive sensing Inverse Problems 24 2008 035020
8. R. Chartrand Exact reconstructions of sparse signals via nonconvex minimization IEEE Signal Process. Lett. 14 10 2007 707 710
9. S. Chen, D. Donoho, and M. Saunders Atomic decomposition by basis pursuit SIAM J. Sci. Comput. 20 1 1999 33 61 http://citeseer.ist.psu.edu/chen98atomic. html (Pubitemid 128689501)
10. A. Cohen, W. Dahmen, and R. DeVore Compressed sensing and best k-term approximation J. Amer. Math. Soc. 22 1 2009 211 231
11. I. Daubechies, R. DeVore, M. Fornasier, S. Gunturk, Iteratively re-weighted least squares minimization for sparse recovery, Comm. Pure Appl. Math., in press
12. M. Davies, and R. Gribonval Restricted isometry constants where ℓ p sparse recovery can fail for 0 < p ≤ 1 IEEE Trans. Inform. Theory 55 5 2009 2203 2214
13. D. Donoho, and M. Elad Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization Proc. Natl. Acad. Sci. USA 100 5 2003 2197 2202
14. D. Donoho, and X. Huo Uncertainty principles and ideal atomic decomposition IEEE Trans. Inform. Theory 47 2001 2845 2862
15. D. Donoho Compressed sensing IEEE Trans. Inform. Theory 52 4 2006 1289 1306
16. M. Figueiredo, R. Nowak, and S. Wright Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems IEEE J. Sel. Top. Signal Process. 1 4 2007 586 597
17. S. Foucart, and M. Lai Sparsest solutions of underdetermined linear systems via ℓ q -minimization for 0 < q ≤ 1 Appl. Comput. Harmon. Anal. 26 3 2009 395 407
18. Y. Gordon, and N. Kalton Local structure theory for quasi-normed spaces Bull. Sci. Math. 118 1994 441 453
19. R. Gribonval, R.M. Figueras i Ventura, P. Vandergheynst, A simple test to check the optimality of sparse signal approximations, in: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP'05), vol. 5, 2005, pp. V/717-V/720
20. R. Gribonval, R.M. Figueras i Ventura, and P. Vandergheynst A simple test to check the optimality of sparse signal approximations Special Issue on Sparse Approximations in Signal and Image Processing EURASIP Signal Process. 86 3 2006 496 510
21. R. Gribonval, and M. Nielsen On the strong uniqueness of highly sparse expansions from redundant dictionaries International Conference on Independent Component Analysis (ICA'04) Lecture Notes in Comput. Sci. vol. 3195 2004 Springer-Verlag Granada, Spain
22. R. Gribonval, and M. Nielsen Highly sparse representations from dictionaries are unique and independent of the sparseness measure Appl. Comput. Harmon. Anal. 22 3 2007 335 355
23. O. Guedon, and A. Litvak Euclidean projections of p-convex body GAFA Lecture Notes in Math. vol. 1745 2000 95 108
24. N. Peck Banach-Mazur distances and projections on p-convex spaces Math. Z. 177 1 1981 131 142
25. R. Saab, R. Chartrand, O. Yilmaz, Stable sparse approximations via nonconvex optimization, in: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2008, pp. 3885-3888
26. J. Tropp Recovery of short, complex linear combinations via l 1 minimization IEEE Trans. Inform. Theory 51 4 2005 1568 1570
27. P. Vandergheynst, P. Frossard, Efficient image representation by anisotropic refinement in matching pursuit, in: IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), vol. 3, 2001
28. E. van den Berg, and M. Friedlander In pursuit of a root UBC Computer Science Technical Report TR-2007-16 http://www.optimization-online.org/DB-FILE/ 2007/06/1708.pdf
29. R. Ventura, P. Vandergheynst, and P. Frossard Low rate and scalable image coding with redundant representations IEEE Trans. Image Process. 15 3 2006 726 739
30. P. Wojtaszczyk, Stability and instance optimality for gaussian measurements in compressed sensing, Found. Comput. Math. (2009), doi:10.1007/s10208-009-9046-4, in press