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

A novel algorithm for adapting dictionaries in order to achieve sparse signal representations, the K-SVD algorithm, an iterative method that alternates between sparse coding of the examples based on the current dictionary and a process of updating the dictionary atoms to better fit the data.