Dictionary training for sparse representation as generalization of K-means clustering
Recent dictionary training algorithms for sparse representation like K-SVD, MOD, and their variation are reminiscent of K-means clustering, and this letter investigates such algorithms from that viewpoint. It shows: though K-SVD is sequential like K-means, it fails to simplify to K-means by destroyi...
Saved in:
Main Authors: | Sahoo, Sujit Kumar, Makur, Anamitra |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/96655 http://hdl.handle.net/10220/9970 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Sparse Sequential Generalization of K-means for dictionary training on noisy signals
by: Sahoo, Sujit Kumar, et al.
Published: (2017) -
Enhancing image denoising by controlling noise incursion in learned dictionaries
by: Anamitra Makur (EEE), et al.
Published: (2015) -
Signal recovery from random measurements via extended orthogonal matching pursuit
by: Sahoo, Sujit Kumar, et al.
Published: (2015) -
Greedy Pursuits Assisted Basis Pursuit for reconstruction of joint-sparse signals
by: Narayanan, Sathiya, et al.
Published: (2017) -
Image restoration using sparse dictionary
by: Dai, Shi
Published: (2018)