Performance study of various sparse representation methods using redundant frames

Forty-first Annual Conference on Information Sciences and Systems, CISS 2007 - Proceedings

Volumn , Issue , 2007, Pages 726-729

  Akçakaya, Mehmet ^a   Tarokh, Vahid ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ORTHOGONAL MATCHING PURSUIT (OMP) ALGORITHM; REDUNDANT FRAMES; SPARSE REPRESENTATION;

ALGORITHMS; ASYMPTOTIC ANALYSIS; NUMERICAL METHODS; RANDOM PROCESSES; SIGNAL DISTORTION;

SIGNAL ANALYSIS;

EID: 44049107274     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2007.4298400     Document Type: Conference Paper

References (6)

1. M. Akçakaya and V. Tarokh, "Performance Bounds on Sparse Representations Using Redundant Frames", submitted to IEEE Trans. on Signal Processing. Available at http://www.people.fas.harvard.edu/~akcakaya/ Frames.Perf.pdf.
2. E. J. Candes and P. A. Randall, "Highly Robust Error Correction by Convex Programming", preprint.
3. E. J. Candes and T. Tao, "Decoding by Linear Programming", IEEE Trans. on Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
4. D. L. Donoho, M. Elad, and V. N. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise", IEEE Trans. on Inf. Theory, vol. 52, no. 1, pp. 6-18, Jan. 2006.
5. R. J. Muirhead, Aspects of Multivariate Statistical Theory, John Wiley & Sons, 1982.
6. J. A. Tropp, "Greed is Good: Algorithmic Results for Sparse Approximation", IEEE Trans. on Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.