K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation

M. Aharon، نويسنده , , M. Elad، نويسنده , , and A. Bruckstein، نويسنده ,

روزنامه با شماره پیاپی سال 2006

12

4311

4322

matchingpursuit , K-SVD , Training , Sparse representation , Basis pursuit , Atom decomposition , Codebook , dictionary , vector quantization. , k-means , gain-shape VQ , FOCUSS

IEEE TRANSACTIONS ON SIGNAL PROCESSING

2006

IEEE TRANSACTIONS ON SIGNAL PROCESSING

389645