Strong thresholds for ℓ2/ℓ1-optimization in block-sparse compressed sensing

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn , Issue , 2009, Pages 3025-3028

  Stojnic, Mihailo ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Block sparse; Compressed sensing; L1 optimization

Indexed keywords

BLOCK-SPARSE; COMPRESSED SENSING; L1-OPTIMIZATION; LOWER BOUNDS; SYSTEM OF LINEAR EQUATIONS; UNDER-DETERMINED;

ACOUSTICS; CONTROL THEORY; OPTIMIZATION; SIGNAL PROCESSING; SIGNAL RECONSTRUCTION; TERMINOLOGY;

VECTORS;

EID: 70349205453     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2009.4960261     Document Type: Conference Paper

References (30)

1. M. Akcakaya and V. Tarokh. Performance bounds on sparse representations using redundant frames. 2007. available online at arXiv:cs/0703045.
2. R. Baraniuk, V. Cevher, M. Duarte, and C. Hegde. Model-based compressive sensing. available online at http://www.dsp.ece.rice.edu/cs/.
3. D. Baron, M. Wakin, M. Duarte, S. Sarvotham, and Richard Baraniuk. Distributed compressed sensing. Allerton, 2005.
4. R. Berinde, A. C. Gilbert, P. Indyk, H. Karloff, and M. J. Strauss. Combining geometry and combinatorics: A unified approach to sparse signal recovery. 2008. available online at http://www.dsp.ece.rice.edu/cs/.
5. E. Candes and T. Tao. Decoding by linear programming. IEEE Trans. on Information Theory, 51:4203-4215, Dec. 2005.
6. J. Chen and X. Huo. Theoretical results on sparse representations of multiplemeasurement vectors. IEEE Trans. on Signal Processing, Dec 2006.
7. B. S. Cirelson, I. A. Ibragimov, and V. N. Sudakov. Norms of gaussian sample functions. Lect. Notes Math., 50, 1976.
8. A. Cohen, W. Dahmen, and R. DeVore. Compressed sensing and best k-term approximation. 2006. available online at http://www.dsp.ece.rice.edu/cs/.
9. S. Cotter, B. Rao, K. Engan, and K. Kreutz-Delgado. Sparse solutions to linear inverse problems with multiple measurement vectors. IEEE Trans. on Signal Porcessing, July 2005.
10. D. Donoho. High-dimensional centrally symmetric polytopes with neighborlines proportional to dimension. Disc. Comput. Geometry, 35:617-652, 2006.
11. D. Donoho and J. Tanner. Sparse nonnegative solutions of underdetermined linear equations by linear programming. Proc. National Academy of Sciences, 102(27):9446-9451, 2005.
12. D. L. Donoho and X. Huo. Uncertainty principles and ideal atomic decompositions. IEEE Trans. Inform. Theory, 47(7):2845-2862, November 2001.
13. M. Duarte, M. Davenport, D. Takhar, J. Laska, T. Sun, K. Kelly, and R. Baraniuk. Single-pixel imaging via compressive sampling. IEEE Signal Processing Magazine, 25(2):83-91, 2008.
14. Y. C. Eldar and M. Mishali. Robust recovery of signals from a union of subspaces. 2008. available online at http://www.dsp.ece.rice.edu/cs/.
15. A. Feuer and A. Nemirovski. On sparse representation in pairs of bases. IEEE Trans. on Information Theory, 49:1579-1581, June 2003.
16. Y. Gordon. On Milman's inequality and random subspaces which escape through a mesh in Rn. Geometric Aspect of of functional analysis, Isr. Semin. 1986-87, Lect. Notes Math, 1317, 1988.
17. R. Gribonval and M. Nielsen. Sparse representations in unions of bases. IEEE Trans. Inform. Theory, 49(12):3320-3325, December 2003.
18. S. Jafarpour, W. Xu, B. Hassibi, and R. Calderbank. Efficient compressed sensing using high-quality expander graphs. available online at http://www.dsp.ece.rice.edu/cs/.
19. D. Needell and J. A. Tropp. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. 2008. available online at http://www.dsp.ece.rice.edu/cs/.
20. F. Parvaresh and B. Hassibi. Explicit measurements with almost optimal thresholds for compressed sensing. IEEE ICASSP, Mar-Apr 2008.
21. G. Pisier. Probabilistic methods in the geometry of banach spaces. Springer Lecture Notes, 1206, 1986.
22. B. Recht, W. Xu, and B. Hassibi. Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization. 2008. avialable at arxiv.
23. J. Romberg. Imaging via compressive sampling. IEEE Signal Processing Magazine, 25(2):14-20, 2008.
24. M. Rudelson and R. Vershynin. On sparse reconstruction from Fourier and Gaussian measurements. Comm. on Pure and Applied Math., 61(8), 2007.
25. M. Stojnic, F. Parvaresh, and B. Hassibi. On the reconstruction of block-sparse signals with an optimal number of measurements. submitted to IEEE Trans. on Signal Processing, 2008. avaiable on arxiv.
26. M. Stojnic, W. Xu, and B. Hassibi. Compressed sensing of approximately sparse signals. ISIT, International symposium on information theory, July 2008.
27. V.N. Temlyakov. A remark on simultaneous greedy approximation. East J. Approx., 100, 2004.
28. J. Tropp, A. C. Gilbert, and M. Strauss. Algorithms for simultaneous sparse approximation. part i: Greedy pursuit. Signal Processing, Aug 2005.
29. H. Vikalo, F. Parvaresh, and B. Hassibi. On sparse recovery of compressed DNA microarrays. Asilomor conference, November 2007.
30. Y. Zhang. When is missing data recoverable. available online at http://www.dsp.ece.rice.edu/cs/.