K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation, IEEE TSP 2006

The sparse representation problem can be viewed as a generalization of the VQ objective, in which we allow each input signal to be represented by a linear combination of codewords, which we now call dictionary elements. Therefore the coefficients vector is now allowed more than one nonzero entry, and these can have arbitrary values.