Signal recovery from random measurements via orthogonal matching pursuit

IEEE Transactions on Information Theory

Volumn 53, Issue 12, 2007, Pages 4655-4666

  Tropp, Joel A ^a,b   Gilbert, Anna C ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithms; Approximation; Basis pursuit; Compressed sensing; Group testing; Orthogonal matching pursuit; Signal recovery; Sparse approximation

Indexed keywords

APPROXIMATION; BASIS PURSUIT; COMPRESSED SENSING; GROUP TESTING; ORTHOGONAL MATCHING PURSUIT; SIGNAL RECOVERY; SPARSE APPROXIMATION;

BACKPROPAGATION ALGORITHMS; SIGNAL RECONSTRUCTION;

APPROXIMATION ALGORITHMS;

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

References (35)

1. S. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
2. 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.
3. 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.
4. A. J. Miller, Subset Selection in Regression, 2nd ed. London, U.K.: Chapman and Hall, 2002.
5. V. Temlyakov, "Nonlinear methods of approximation," Foundations of Comput. Math., vol. 3, no. 1, pp. 33-107, Aug. 2002.
6. D.-Z. Du and F. K. Hwang, Combinatorial Group Testing and its Applications. Singapore: World Scientific, 1993.
7. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
8. M. Rudelson and R. Veshynin, "Geometric approach to error correcting codes and reconstruction of signals," Int. Math. Res. Not., vol. 64, pp. 4019-4041, 2005.
9. E. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete Fourier information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.
10. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
11. E. J. Candès and T. Tao, "Near-optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006.
12. B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, "Least angle regression," Ann. Statist., vol. 32, no. 2, pp. 407-499, 2004.
13. I. Daubechies, M. Defrise, and C. D. Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint," Commun. Pure Appl. Math., vol. 57, pp. 1413-1457, 2004.
14. D. Malioutov, M. Çetin, and A. Willsky, "Homotopy continuation for sparse signal representation," in Proc. IEEE Intl. Conf. Acoustics, Speech, and Signal Processing, Philadelphia, PA, 2005, vol. 5, pp. 733-736.
15. 1-regularized least-squares problems with applications in signal processing and statistics," 2007, submitted for publication.
16. M. A. T. Figueiredo, R. D. Nowak, and S. J. Wright, "Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems," 2007, submitted for publication.
17. Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Proc. 27th Annu. Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, Nov. 1993, vol. 1, pp. 40-44.
18. G. Davis, S. Mallat, and M. Avellaneda, "Greedy adaptive approximation," Constr. Approx., vol. 13, pp. 57-98, 1997.
19. R. DeVore and V. N. Temlyakov, "Some remarks on greedy algorithms," Adv. Comput. Math., vol. 5, pp. 173-187, 1996.
20. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
21. 1-norm solution is also the sparsest solution," Commun. Pure Appl. Math., vol. 59, no. 6, pp. 797-829, 2006.
22. Å. Björck, Numerical Methods for Least Squares Problems. Philadelphia, PA: SIAM, 1996.
23. S. Kunis and H. Rauhut, "Random sampling of sparse trigonometric polynomials II: Orthogonal matching pursuit versus basis pursuit," Found. Comp. Math., to be published.
24. Y. E. Nesterov and A. S. Nemirovski, Interior Point Polynomial Algorithms in Convex Programming. Philadelphia, PA: SIAM, 1994.
25. R. A. DeVore, "Nonlinear approximation," Acta Numer., vol. 7, pp. 51-150, 1998.
26. J. A. Tropp and A. C. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit: The Gaussian case," Caltech, Pasadena, CA, 2007, ACM Tech. Rep. 2007-01 [Online]. Available: http://www.acm.caltech.edu/~jtropp/reports/TG07-Signal-Recovery-TR.pdf
27. K. Ball, "Convex geometry and functional analysis," in Handbook of Banach Space Geometry, W. B. Johnson and J. Lindenstrauss, Eds. Amsterdam, The Netherlands: Elsevier, 2002, pp. 1611-93.
28. G. Lugosi, Concentration of Measure Inequalities, 2005, Lecture Notes [Online]. Available: http://www.econ.upf.es/~lugosi/surveys.html
29. R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin, "A simple proof of the restricted isometry property for random matrices," Cnstr. Approx., 2007, to be published.
30. X. Fernique, "Regularité des trajectoires des fonctions aléatoires gausiennes," in Ecole D'Eté de Probabilités de Saint-Flour IV. Berlin, Germany: Springer, 1974, vol. 480, Lecture Notes in Mathematics, pp. 1-96.
31. J. Kahn, J. Komlós, and E. Szemerédi, "On the probability that a random ±1-matrix is singular," J. Amer. Math. Soc., vol. 86, no. 1, pp. 223-240, Jan. 1995.
32. J. A. Tropp, A. C. Gilbert, and M. J. Strauss, "Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit," J. Signal Process., vol. 86, pp. 572-588, Apr. 2006.
33. D. Needell and R. Vershynin, "Uniform uncertainty principle and signal recovery via Regularized Orthogonal Matching Pursuit," Jul. 2007, submitted for publication.
34. D. L. Donoho, Y. Tsaig, I. Drori, and J.-L. Starck, "Sparse solution of underdetermined linear equations by stagewise Orthogonal Matching Pursuit (StOMP)," 2007, submitted for publication.
35. P. E. Gill, W. Murray, and M. A. Saunders, "SNOPT: An SQP algorithm for large-scale constrained optimization," SIAM Rev., vol. 47, no. 1, pp. 99-132, Mar. 2005.