K-SVD algorithm

Description

The K-SVD algorithm finds a dictionary for linear representation of signals. Given a set of signals, it searches for the best dictionary that can sparsely represent each signal.

Detailed discussion on the algorithm and possible applications can be found in “The K-SVD: An Algorithm for  Designing of Overcomplete Dictionaries for Sparse Representation”, written by M. Aharon, M. Elad, and A.M. Bruckstein and appeared in the IEEE Trans.  On Signal Processing, Vol. 54, no. 11, pp. 4311-4322, November 2006.

Non Negative K-SVD algorithm

https://sites.fas.harvard.edu/~cs278/papers/ksvd.pdf