Dictionary learning and sparse coding for unsupervised clustering

Pablo Sprechmann, Guillermo Sapiro

Abstract

A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, as in k-means type of approaches that model the data as distributions around discrete points, we optimize for a set of dictionaries, one for each cluster, for which the signals are best reconstructed in a sparse coding manner. Thereby, we are modeling the data as the of union of learned low dimensional subspaces, and data points associated to subspaces spanned by just a few atoms of the same learned dictionary are clustered together. Using learned dictionaries makes this method robust and well suited to handle large datasets. The proposed clustering algorithm uses a novel measurement for the quality of the sparse representation, inspired by the robustness of the ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> regularization term in sparse coding. We first illustrate this measurement with examples on standard image and speech datasets in the supervised classification setting, showing with a simple approach its discriminative power and obtaining results comparable to the state-of-the-art. We then conclude with experiments for fully unsupervised clustering on extended standard datasets and texture images, obtaining excellent performance.
BibTeX
@inproceedings{sprechmann2010dictionary,
  author = {Pablo Sprechmann and Guillermo Sapiro},
  title = {{Dictionary learning and sparse coding for unsupervised clustering}},
  booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
  year = {2010},
  url = {https://openreview.net/forum?id=J2RykJajJo3},
}

Loading related content...

Figure