Comparison of orthogonal matching pursuit implementations

European Signal Processing Conference

Volumn , Issue , 2012, Pages 220-224

  Sturm, Bob L ^a   Christensen, Mads Graesbøll ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

algorithms; Orthogonal matching pursuit

Indexed keywords

CHOLESKY; COMPUTATIONAL PERFORMANCE; COMPUTATIONAL TIME; INNER PRODUCT; MATRIX DECOMPOSITION; MATRIX INVERSIONS; NUMERICAL ERRORS; ORTHOGONAL MATCHING PURSUIT; PHASE PLANE;

SIGNAL PROCESSING;

ALGORITHMS;

EID: 84869778651     PISSN: 22195491     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. S. Mallat, A Wavelet Tour of Signal Processing: The Sparse Way, Academic Press, Elsevier, Amsterdam, 3rd edition, 2009.
2. M. Elad, Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing, Springer, New York, NY, USA, 2010.
3. J. A. Tropp and S. J. Wright, "Computational methods for sparse solution of linear inverse problems," Proc. IEEE, vol. 98, no. 6, pp. 948-958, June 2010.
4. Y. Pati, R. Rezaiifar, and P. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Proc. Asilomar Conf. Signals, Syst., Comput., Pacific Grove, CA, Nov. 1993, pp. 40-44.
5. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 33-61, Aug. 1998.
6. E. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Info. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.
7. M. Gharavi-Alkhansari and T. Huang, "A fast orthogonal matching pursuit algorithm," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., 1998.
8. S. F. Cotter, J. Adler, B. D. Rao, and K. Kreutz-Delgado, "Forward sequential algorithms for best basis selection," IEEE Proc. Vision, Image, Signal Process., vol. 146, no. 5, pp. 235-244, 1999.
9. T. Blumensath and M. E. Davies, "Gradient pursuits," IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2370-2382, June 2008.
10. B. L. Sturm, M. G. Christensen, and R. Gribonval, "Cyclic pure greedy algorithms for recovering compressively sampled sparse signals," in Proc. Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, Nov. 2011.
11. S. Krstulovic and R. Gribonval, "MPTK: Matching pursuit made tractable," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., Toulouse, France, Apr. 2006, vol. 3, pp. 496-499.
12. R. R. Howell, "On asymptotic notation with multiple variables," Tech. Rep., Kansas State University, Manhattan, KS, USA, Jan 2008.
13. D. Donoho, V. Stodden, and Y. Tsaig, "Sparselab," http://sparselab.stanford.edu/, 2007.
14. I. Damnjanovic, M. E. P. Davies, and M. D. Plumbley, "Smallbox-An evaluation framework for sparse representations and dictionary learning algorithms," in Proc. Latent Variable Analysis/ Independent Component Analysis, St. Malo, France, Sep. 2010, pp. 418-425.