Skip to main content

Graph Regularized Structured Sparse Subspace Clustering

  • Conference paper
  • First Online:
Intelligence Science and Big Data Engineering. Image and Video Data Engineering (IScIDE 2015)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 9242))

  • 2481 Accesses

Abstract

High-dimensional data presents a big challenge for the clustering problem, however, the high-dimensional data often lie in low-dimensional subspaces. So, subspace clustering has been widely researched. Sparse subspace clustering (SSC) is considered as the state-of-the-art method for subspace clustering, it has received an increasing amount of interest in recent years. In this paper, we propose a novel sparse subspace clustering method named graph regularized structured sparse subspace clustering (GS3C) to jointly analyze the data under a single clustering framework and with shared underlying sparse representations. Two convex regularizations are combined and used in the model to enable sparsity as well as to facilitate multi-task learning. We also introduced the graph regularization to improve stability and consistency. The effectiveness of the proposed algorithm is demonstrated through experiments on motion segmentation and face clustering.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bellman, R.E.: Dynamic Programming. Princeton University Press, Princeton (1957)

    MATH  Google Scholar 

  2. Jolliffe, I.T.: Principal Component Analysis. Springer Series in Statistics, vol. 487. Springer, New York (1986)

    Book  MATH  Google Scholar 

  3. Lauer, F., Schnorr, C.: Spectral clustering of linear subspaces for motion segmentation. In: International Conference on Computer Vision (ICCV 2009), pp. 678–685. IEEE (2009)

    Google Scholar 

  4. Elad, M.: Sparse and Redundant Representations. Springer, New York (2010)

    Book  MATH  Google Scholar 

  5. Liu, G., Lin, Z., Yu, Y.: Robust subspace segmentation by low-rank representation. In: Proceedings of ICML (2010)

    Google Scholar 

  6. Elhamifar, E., Vidal, R.: Sparse subspace clustering. In: Computer Vision and Pattern Recognition (CVPR 2009), pp. 2790–2797. IEEE (2009)

    Google Scholar 

  7. Elhamifar, E., Vidal, R.: Sparse subspace clustering: algorithm, theory, and applications. IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI) 35(11), 2765–2781 (2013)

    Article  Google Scholar 

  8. Liu, G., Lin, Z., Yan, S., Sun, J., Yu, Y., Ma, Y.: Robust recovery of subspace structures by low-rank representation. IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI) 35(1), 171–184 (2013)

    Article  Google Scholar 

  9. Favaro, P., Vidal, R., Ravichandran, A.: A closed form solution to robust subspace estimation and clustering. In: Computer Vision and Pattern Recognition (CVPR 2011), pp. 1801–1807. IEEE (2011)

    Google Scholar 

  10. Saha, B., et al. Sparse subspace clustering via group sparse coding. In: SDM 2013: Proceedings of the Thirteenth SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics (2013)

    Google Scholar 

  11. Tron, R., Vidal, R.: A benchmark for the comparison of 3-D motion segmentation algorithms. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (2007)

    Google Scholar 

  12. Lee, K.-C., Ho, J., Kriegman, D.: Acquiring linear subspaces for face recognition under variable lighting. IEEE Trans. Pattern Anal. Mach. Intell. 27(5), 684–698 (2005)

    Article  Google Scholar 

  13. Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1–122 (2010)

    Article  MATH  Google Scholar 

Download references

Acknowledgements

This work is supported by the Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20130093110009), the National Natural Science Foundation of China (Grant No. 61373055) and the Research Project on Surveying and Mapping of Jiangsu Province (Grant No. JSCHKY201109).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiao-Jun Wu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

You, CZ., Wu, XJ. (2015). Graph Regularized Structured Sparse Subspace Clustering. In: He, X., et al. Intelligence Science and Big Data Engineering. Image and Video Data Engineering. IScIDE 2015. Lecture Notes in Computer Science(), vol 9242. Springer, Cham. https://doi.org/10.1007/978-3-319-23989-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23989-7_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23987-3

  • Online ISBN: 978-3-319-23989-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics