Theoretical and empirical results for recovery from multiple measurements

IEEE Transactions on Information Theory

Volumn 56, Issue 5, 2010, Pages 2516-2527

  Van Den Berg, Ewout ^a   Friedlander, Michael P ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Convex optimization; Joint sparsity; Multiple channels; Sparse recovery

Indexed keywords

ARBITRARY SETS; COMPRESSED SENSING; EMPIRICAL RESULTS; JOINT SPARSITY; MULTIPLE CHANNELS; MULTIPLE MEASUREMENTS; NONZERO ENTRIES; RECOVERY PROPERTIES; RECOVERY RATE; SIGNAL PROCESS; SPARSE MATRICES; SPARSE RECOVERY; SPARSE REPRESENTATION; SPARSE VECTORS;

CONVEX OPTIMIZATION; OPTIMIZATION; SIGNAL PROCESSING;

RECOVERY;

EID: 77951546345     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2043876     Document Type: Article

References (30)

1. E. J. Candès, "Compressive sampling, " presented at the Int. Congr. Mathematicians, Madrid, Spain, 2006.
2. D. L. Donoho, "Compressed sensing, " IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
3. 1 minimization, " Proc. Nat. Acad. Sci., vol. 100, no. 5, pp. 2197-2202, Mar. 2003.
4. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases, " IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3320-3325, Dec. 2003.
5. B. K. Natarajan, "Sparse approximate solutions to linear systems, " SIAMJ. Comput., vol. 24, no. 2, pp. 227-234, Apr. 1995.
6. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit, " SIAMJ. Sci. Comput., vol. 20, no. 1, pp. 33-61, 1998.
7. E. J. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, " IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.
8. D. L. Donoho, "High-dimensional centrosymmetric polytopes with neighborliness proportional to dimension, " Discrete Computat. Geom., vol. 35, no. 4, pp. 617-652, May 2006.
9. D. M. Malioutov, M. Çetin, and A. S. Willsky, "A sparse signal reconstruction perspective for source localization with sensor arrays, " IEEE Trans. Signal Process., vol. 53, no. 8, pp. 3010-3022, Aug. 2005.
10. S. F. Cotter, B. D. Rao, K. Engang, and K. Kreutz-Delgado, "Sparse solutions to linear inverse problems with multiple measurement vectors, " IEEE Trans. Signal Process., vol. 53, no. 7, pp. 2477-2488, Jul. 2005.
11. S. F. Cotter and B. D. Rao, "Sparse channel estimation via matching pursuit with application to equalization, " IEEE Trans. Commun., vol. 50, no. 3, pp. 374-377, Mar. 2002.
12. I. J. Fevrier, S. B. Gelfand, and M. P. Fitz, "Reduced complexity decision feedback equalization for multipath channels with large delay spreads, " IEEE Trans. Commun., vol. 47, no. 6, pp. 927-937, Jun. 1999.
13. J. A. Tropp, "Algorithms for simultaneous sparse approximation-Part II: Convex relaxation, " Signal Process., vol. 86, pp. 589-602, 2006.
14. J. A. Tropp, A. C. Gilbert, and M. J. Strauss, "Algorithms for simultaneous sparse approximation-Part I: Greedy pursuit, " Signal Proces., vol. 86, pp. 572-588, 2006.
15. Y. C. Eldar and M. Mishali, Robust Recovery of Signals From a Union of Subspaces, 2008, to be published.
16. J. Chen and X. Huo, "Theoretical results on sparse representations of multiple-measurement vectors, " IEEE Trans. Signal Process., vol. 54, no. 12, pp. 4634-4643, Dec. 2006.
17. M. Mishali and Y. C. Eldar, "Reduce and boost: Recovering arbitrary sets of jointly sparse vectors, " IEEE Trans. Signal Process., vol. 56, no. 10, pp. 4692-4702, Oct. 2008.
18. E. J. Candès and T. Tao, "Decoding by linear programming, " IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
19. D. L. Donoho, Neighborly Polytopes and Sparse Solution of Underdetermined Linear Equations Dept. Statistics, Stanford Univ., Stanford, CA, 2005, Tech. Rep. 2005-4.
20. D. L. Donoho and X. Huo, "Uncertainty principles and ideal atomic decomposition, " IEEE Trans. Inf. Theory, vol. 47, no. 11, pp. 2845-2862, Nov. 2001.
21. J.-J. Fuchs, "On sparse representations in arbitrary redundant bases, " IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1341-1344, Jun. 2004.
22. 1 minimization, " IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1568-1570, Apr. 2005.
23. B. Grünbaum, Convex Polytopes, ser. Graduate Texts in Mathematics, 2nd ed. New York: Springer-Verlag, 2003, vol. 221.
24. R. Gribonval and M. Nielsen, "Highly sparse representations from dictionaries are unique and independents of the sparseness measure, " Appl. Comput. Harmon. Anal., vol. 22, no. 3, pp. 335-355, May 2007.
25. M. Stojnic, F. Parvaresh, and B. Hassibi, "On the reconstruction of block-sparse signals with an optimal number of measurements, " IEEE Trans. Signal Process., vol. 57, no. 8, pp. 3075-3085, Aug. 2009.
26. Y. C. Eldar and H. Rauhut, Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation, 2009.
27. R. T. Rockafellar, Convex Analysis. Princeton, NJ: Princeton Univ. Press, 1970.
28. R. H. Tütüncü, K.-C. Toh, and M. J. Todd, "Solving semidefinite-quadratic-linear programs using SDPT3, " Math. Progr. Ser. B, vol. 95, pp. 189-217, 2003.
29. M. Grant and S. Boyd, CVX: Matlab Software for Disciplined Convex Programming (Web Page and Software), 2009 [Online]. Available: http://stanford.edu/boyd/cvx
30. M. Grant and S. Boyd, Graph Implementations for Nonsmooth Convex Programs, V. Blondel, S. Boyd, and H. Kimura, Eds. New York: Springer, 2008, Lecture Notes in Control and Information Sciences, pp. 95-110.