K-SVD and its non-negative variant for dictionary design

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 5914, Issue , 2005, Pages 1-13

  Aharon, Michal ^a   Elad, Michael ^a   Bruckstein, Alfred M ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR SYSTEMS; MATRIX ALGEBRA; PROBLEM SOLVING; SIGNAL PROCESSING;

DICTIONARY DESIGN; MATRIX FACTORIZATION PROBLEM; SPARSE REPRESENTATION;

OPTICAL DESIGN;

EID: 30844440076     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.613878     Document Type: Conference Paper

References (25)

1. G. Davis, S. Mallat, and M. Avellaneda. Adaptive greedy approximations. Journal of Constructive Approximation, 13:57-98, 1997.
2. S. Mallat and Z. Zhang. Matching pursuits with time-frequency dictionaries. IEEE Trans. Signal Processing., 41(12):3397-3415, 1993.
3. J.A. Tropp. Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inform. Theory, 50(10):2231-2242, October 2004.
4. S.S. Chen, D.L. Donoho, and M.A. Saunders. Atomic decomposition by basis pursuit. SIAM Review, 43(1):129-159, 2001.
5. B.D. Rao and K. Kreutz-Delgado. An affine scaling methodology for best basis selection. IEEE Transactions on signal processing, 47(1):187-200, 1999.
6. D.L. Donoho and X. Huo. Uncertainty principles and ideal atomic decomposition. IEEE Trans. On Information Theory, 47(7):2845-62, 1999.
7. 1minimization. PNAS, 100(5):2197-2202, 2003.
8. R. Gribonval and M. Nielsen. Sparse decompositions in unions of bases. IEEE Transactions on Information Theory, 49(12):3320-3325, 2003.
9. B.A. Olshausen and D.J. Field. Natural image statistics and efficient coding. Network: Computation in Neural Systems, 7(2):333-9, 1996.
10. M.S. Lewicki and T.J. Sejnowski. Learning overcomplete representations. Neural Comp., 12:337-365, 2000.
11. K. Engan, S.O. Aase, and J.H. Husøy. Multi-frame compression: Theory and design,. EURASIP Signal Processing, 80(10):2121-2140, 2000.
12. K. Kreutz-Delgado, J.F. Murray, B.D. Rao, K. Engan, T. Lee, and T.J. Sejnowski. Dictionary leaning algorithms for sparse representation. Neural Computation, 15(2):349-396, 2003.
13. M. Elad, M. Aharon, and A.M. Bruckstein. K-svd: An algorithm for designining of overcomplete dictionaries for sparse representation. submitted to IEEE on Signal Proc.
14. A. Gersho and R.M. Gray. Vector quantization and signal compression. Kluwer Academic Publishers, Dordrecht, Netherlands, 1992.
15. P. O. Hoyer. Non-negative sparse coding. Neural Networks for Signal Processing XII (Proc. IEEE Workshop on Neural Networks for Signal Processing), pages 557-565, 2002.
16. P. O. Hoyer. Non-negative matrix factorization with sparseness constraints. Journal of Machine Learning Research, pages 1457-1469, 2004.
17. J. P. Brunet, P. Tamayo, T. R. Golub, and J. P. Mesirov. Metagenes and molecular pattern discovery usingmatrix factorization. PNAS, 101(12):4164-4169, March 2004.
18. P. Smaragdis and J. C. Brown. Non-negative matrix factor deconvolution; extraction of multiple sound sources from monophonic inputs. IEEE workshop on application of signal processing to Audio and Acoustics, pages 177-180, October 2003.
19. F. Shahnaz, M. Berry, P. Pauca, and R. Plemmons. Document clustering using nonnegative matrix factorization. Submitted to the Journal on Information Processing and Management, August 2004.
20. P. Pauca, J. Piper, and R. Plemmons. Nonnegative matrix factorization for spectral data analysis. May 2005.
21. J. F. Murray and K. Kreutz-Delgado. Sparse image coding using learned overcomplete dictionaries. IEEE International Workshop on Machine Learning for Signal Processing, September 2004.
22. Sparse nonnegative solution of underdetermined linear equations by linear programming. Proc Natl Acad Sci USA., 2005.
23. D.D. Lee and H.S. Seung. Algorithms for non-negative matrix factorization. Adv. Neural Info. Proc. Syst., 13:556-562, 2001.
24. D. Lee and H. Seung. Learning the parts of objects by non-negative matrix factorization. Mature, pages 788-791, 1999.
25. C.L. Lawson and R.J. Hanson. Solving Least Squares Problems. Prentice-Hall, 1974.