Theoretical results on sparse representations of multiple-measurement vectors

IEEE Transactions on Signal Processing

Volumn 54, Issue 12, 2006, Pages 4634-4643

  Chen, Jie ^a,b   Huo, Xiaoming ^a,b  

^a IEEE   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Basis pursuit; Multiple measurement vector (MMV); Orthogonal matching pursuit (OMP); Sparse representation

Indexed keywords

BASIS PURSUIT; MULTIPLE-MEASUREMENT VECTOR (MMV); ORTHOGONAL MATCHING PURSUIT (OMP); SPARSE REPRESENTATION;

COMPUTATIONAL METHODS; COMPUTER SIMULATION; MEASUREMENT THEORY; PROBABILISTIC LOGICS; PROBLEM SOLVING;

VECTORS;

EID: 33947142837     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2006.881263     Document Type: Article

References (41)

1. S. F. Cotter, B. D. Rao, K. Engan, 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.
2. B. Rao, K. Engan, and S. Cotter, "Diversity measure minimization based method for computing sparse solutions to linear inverse problems with multiple measurement vectors," presented at the Int. Conf. Acoustics, Speech, Signal Process. (ICASSP), Montreal, QC, Canada, May 2004.
3. I. F. Gorodnitsky, J. S. George, and B. D. Rao, "Neuromagnetic source imaging with FOCUSS: A recursive weighted minimum norm algorithm," Electroencephalogr. Clin. Neurophysiol, vol. 95, no. 4, pp. 231-251, Oct. 1995.
4. J. A. Tropp, A. C. Gilbert, and M. J. Strauss, "Simultaneous sparse approximation via Greedy pursuit," presented at the Int. Conf. Acoustics, Speech, Signal Process. (ICASSP), Philadelphia, PA, Mar. 2005.
5. _, "Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit," Signal Process. (Special Issue on Sparse Approximations in Signal and Image Processing), vol. 86, pp. 572-588, Apr. 2006.
6. J. A. Tropp, "Algorithms for simultaneous sparse approximation. Part II: Convex relaxation," Signal Process. (Special Issue on Sparse Approximations in Signal and Image Processing), vol. 86, pp. 589-602, Apr. 2006.
7. S. Mallat, A Wavelet Tour of Signal Processing. San Diego, CA: Academic, 1998.
8. D. L. Donoho and P. Stark, "Uncertainty principles and signal recovery," SIAM J. Appl. Math., vol. 49, no. 3, pp. 906-931, 1989.
9. D. L. Donoho and X. Huo, "Uncertainty principles and ideal atomic decomposition," IEEE Trans. Inf. Theory, vol. 47, pp. 2845-2862, Nov. 2001.
10. M. Elad and A. M. Bruckstein, "A generalized uncertainty principle and sparse representation in pairs of bases," IEEE Trans. Inf. Theory, vol. 48, pp. 2558-2567, 2002.
11. A. Feuer and A. Nemirovski, "On sparse representation in pairs of bases," IEEE Trans. Inf. Theory, vol. 49, pp. 1579-1581, 2003.
12. 1 minimization," Proc. Nat. Acad. Sci., vol. 100, pp. 2197-2202, 2002.
13. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inf. Theory; vol. 49, pp. 3320-3325, 2003.
14. J. J. Fuchs, "On sparse representations in arbitrary redundant bases," IEEE Trans. Inf. Theory, vol. 50, pp. 1341-1344, Jun. 2004.
15. D. L. Donoho, M. Elad, and V. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 6-18, Jan. 2006.
16. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, pp. 2231-2242, Oct. 2004.
17. _, "Just relax: Convex programming methods for identifying sparse signals," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 1030-1051, Mar. 2006.
18. J. B. Kruskal, "Three-way arrays: Rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics," Linear Algebra Its Appl., vol. 18, no. 2, pp. 95-138, 1977.
19. D. M. Malioutov, M. Cetin, 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.
20. B. D. Rao and K. Kreutz-Delgado, "An affine scaling methodology for best basis selection," IEEE Trans. Signal Process., vol. 47, no. 1, pp. 187-200, Jan. 1999.
21. K. Kreutz-Delgado and B. D. Rao, "Measures and algorithms for best basis selection," in Proc. Int. Conf. Acoustics, Speech, Signal Processing (ICASSP), Seattle, WA, May 1998, vol. 3, pp. 1881-1884.
22. S. Mallat and Z. Zhang, "Matching pursuit in a time-frequency dictionary," IEEE Trans. Signal Process., vol. 41, pp. 3397-3415, 1993.
23. G. Davis, S. Mallat, and Z. Zhang, "Adaptive time-frequency decompositions," Opt. Eng., vol. 33, pp. 2183-2191, 1994.
24. Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, A. Singh, Ed., "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Proc. 27th Asilomar Conf. Signals, Systems Computers, Los Alamitos, CA, 1993.
25. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM Rev., vol. 43, no. 1, pp. 129-159, 2001.
26. D. Leviatan and V. N. Temlyakov, "Simultaneous Approximation by Greedy Algorithms," Univ. of South Carolina at Columbia, IMI Tech. Rep. 2003:02, 2003.
27. _, ''Simultaneous Greedy Approximation in Banach Spaces," Univ. of South Carolina at Columbia, IMI Tech. Rep. 2003:26, 2003.
28. A. Lutoborski and V. N. Temlyakov, "Vector Greedy algorithms," J. Complexity, vol. 19, pp. 458-473, 2004.
29. V. N. Temlyakov, "A remark on simultaneous Greedy approximation," East J. Approx., vol. 10, 2004.
30. G. H. Golub and C. F. Van Loan, Matrix Computation. Baltimore, MD: The Johns Hopkins Univ. Press, 1996.
31. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1985.
32. C. Couvreur and Y. Bresler, "On the optimality of the backward Greedy algorithm for the subset selection problem," SIAM J. Matrix Anal. Appl., vol. 21, no. 3, pp. 797-808, 2000.
33. G. Harikumar, C. Couvreur, and Y. Bresler, "Fast optimal and suboptimal algorithms for sparse solutions to linear inverse problems," presented at the Int. Conf. Acoustics, Speech, Signal Processing (ICASSP), Seattle, WA, May 1998.
34. G. Harikumar and Y. Bresler, "A new algorithm for computing sparse solutions to linear inverse problems," in Proc. Int. Conf. Acoustics, Speech. Signal Processing (ICASSP), Atlanta, GA, May 1996, vol. 3, pp. 1331-1134.
35. 1-norm solution is also the sparsest solution," 2004 [Online]. Available: http://www-stat.stanford.edu/~donoho/ Reports/2004/1110EquivCorrected.pdf
36. 1-norm near-solution approximates the sparsest near-solution," 2004 [Online]. Available: http://www-stat.stanford.edu/- donoho/Reports/2004/1110approx.pdf
37. T. Jiang, "Maxima of entries of haar distributed matrices," Probab. Theory Related Fields, vol. 131, no. 1, pp. 121-144, 2005.
38. _,"The asymptotic distributions of the largest entries of sample correlation matrices." Ann. Appl. Probab., vol. 14, no. 2, pp. 865-880, 2004.
39. J. Chen and X. Huo, "Sparse representations for multiple measurement vectors (MMV) in an over-complete dictionary," presented at the Int. Conf. Acoustics, Speech, Signal Process. (ICASSP), Philadelphia, PA, Mar. 2005.
40. 1-norm minimization and greedy algorithms," 2004 [Online]. Available: http://www.isye.gatech.edu/~xiaoming/publication/pdfs/mmv101204.pdf
41. E. J. Candes, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 51, no. 2, pp. 489-509, Feb. 2006.