Sparse approximation via iterative thresholding

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn 3, Issue , 2006, Pages

  Herrity, Kyle K ^a   Gilbert, Anna C ^a   Tropp, Joel A ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BASIS PURSUIT (BP) ALGORITHMS; LANDWEBER ITERATION; ORTHOGONAL MATCHING PURSUIT (OMP); SPARSE SIGNALS;

ALGORITHMS; ITERATIVE METHODS; PRINCIPAL COMPONENT ANALYSIS; THRESHOLD ELEMENTS;

APPROXIMATION THEORY;

EID: 33947690665     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. I. Daubechies, M. Defrise, and C. Demol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint", Comm. in Pure and Appl. Math, vol. 57, 1413-1457, 2004.
2. M. Elad, "Why simple shrinkage is still relevant for redundant representations?" Technical Report, The Technion, Jan. 2005.
3. J. L. Starck, Y. Moudden, J. Bobin, M. Elad, D. L. Donoho, "Morphological component analysis," in proceedings of SPIE Conference on Wavelets, vol. 5914, July, 2005.
4. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation." IEEE Trans. Inform. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.