Dictionary training for sparse representation as generalization of K-means clustering

IEEE Signal Processing Letters

Volumn 20, Issue 6, 2013, Pages 587-590

  Sahoo, Sujit Kumar ^a   Makur, Anamitra ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Dictionary training; K means; K SVD; MOD

Indexed keywords

COMPLEXITY ANALYSIS; DICTIONARY TRAININGS; K-MEANS; K-MEANS CLUSTERING; K-SVD; MEMORY USAGE; MOD; SPARSE REPRESENTATION;

ELECTRICAL ENGINEERING; SIGNAL PROCESSING;

ALGORITHMS;

EID: 84877756294     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/LSP.2013.2258912     Document Type: Article

References (6)

1. M. Aharon, M. Elad, and A. Bruckstein, "-SVD: An algorithm for designing overcomplete dictionaries for sparse representation," IEEE Trans. Signal Process., vol. 54, no. 11, pp. 4311-4322, Nov. 2006. (Pubitemid 44637761)
2. K. Engan, S. O. Aase, and J. H. Husøy, "Multi-frame compression: theory and design," Signal Process., vol. 80, no. 10, pp. 2121-2140, 2000.
3. A. Gersho and R.M. Gray, Vector Quantization and Signal Compression. Norwell, MA, USA: Kluwer, 1991.
4. B. N. Datta, Numerical Linear Algebra and Applications, 2nd ed. Philadelphia, PA, USA: SIAM, 2010.
5. R. Rubinstein, M. Zibulevsky, and M. Elad, "Efficient Implementation of the-SVD Algorithm using Batch Orthogonal Matching Pursuit," Tech. Rep. 2008.
6. J. Tropp and A. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," Inf. Theory, IEEE Trans., vol. 53, no. 12, pp. 4655-4666, Dec. 2007.