Image Clustering via Sparse Representation

  • Jun Jiao
  • Xuan Mo
  • Chen Shen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5916)

Abstract

In recent years, clustering techniques have become a useful tool in exploring data structures and have been employed in a broad range of applications. In this paper we derive a novel image clustering approach based on a sparse representation model, which assumes that each instance can be reconstructed by the sparse linear combination of other instances. Our method characterizes the graph adjacency structure and graph weights by sparse linear coefficients computed by solving ℓ1-minimization. Spectral clustering algorithm using these coefficients as graph weight matrix is then used to discover the cluster structure. Experiments confirmed the effectiveness of our approach.

Keywords

Image Clustering Spectral Clustering Sparse Representation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Advances in Neural Information Processing Systems, vol. 14, pp. 849–856 (2002)Google Scholar
  2. 2.
    Cai, D., He, X., Han, J.: Document clustering using locality preserving indexing. IEEE Transactions on Knowledge and Data Engineering 17, 1624–1637 (2005)CrossRefGoogle Scholar
  3. 3.
    Amaldi, E., Kann, V.: On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems. Theoretical Computer Science 209, 237–260 (1998)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Xing, E.P., Ng, A.Y., Jordan, M.I., Russell, S.: Distance metric learning, with application to clustering with side-information. In: Proceedings of Neural Information Processing Systems, vol. 15, pp. 505–512 (2002)Google Scholar
  5. 5.
    Bach, F.R., Jordan, M.I.: Learning Spectral Clustering, With Application To Speech Separation. Journal of Machine Learning Research 7, 1963–2001 (2006)MathSciNetGoogle Scholar
  6. 6.
    Yu, H., Li, M.J., Zhang, H.J., Feng, J.F.: Color texture moments for content-based image retrieval. In: Proc. International Conference on Image Processing, vol. 3, pp. 929–932 (2002)Google Scholar
  7. 7.
    Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 888–905 (2000)CrossRefGoogle Scholar
  8. 8.
    Malik, J., Ganesh, A., Yang, A., Ma, Y.: Robust face recognition via sparse representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 31, 210–227 (2008)Google Scholar
  9. 9.
    Wagstaff, K., Cardie, C., Rogers, S., Schroedl, S.: Constrained K-means clustering with background knowledge. In: Proc. the Eighteenth International Conference on Machine Learning, pp. 577–584 (2001)Google Scholar
  10. 10.
    Kamvar, S.D., Klein, D., Manning, C.D.: Spectral learning. In: Proc. the Eighteenth International Joint Conference on Artificial Intelligence, pp. 561–566 (2003)Google Scholar
  11. 11.
    Yan, S.C., Wang, H.: Semi-supervised Learning by Sparse Representation. In: Proc. SIAM Data Mining Conference, pp. 792–801 (2009)Google Scholar
  12. 12.
    Yu, S.X., Shi, J.: Grouping with bias. In: Advances in Neural Information Processing Systems (2002)Google Scholar
  13. 13.
    Weiss, Y.: Segmentation using eigenvectors: a unifying view. In: Proc. of the Seventh International Conference on Computer Vision, vol. 2, p. 975 (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jun Jiao
    • 1
  • Xuan Mo
    • 2
  • Chen Shen
    • 3
  1. 1.Computer Science & Technology DepartmentNanjing UniversityNanjingChina
  2. 2.Department of AutomationTsinghua UniversityBeijingChina
  3. 3.School of Software and ElectronicsPeking UniversityBeijingChina

Personalised recommendations