abstract:In applied mathematics, K-SVD is an algorithm of deciding dictionary of sparse representation in a singular value decomposition approach. K-SVD is a generalization of the k-means clustering method, iteratively alternates between sparse coding coefficient of the example based on current dictionary and atoms in the dictionary.