Skip to main content
SpringerLink
Log in

Subspace Clustering via Integrating Sparse Representation and Adaptive Graph Learning

  • Published:
Neural Processing Letters Aims and scope Submit manuscript

Abstract

Sparse representation is a powerful tool for subspace clustering, but most existing methods for this issue ignore the local manifold information in learning procedure. To this end, in this paper we propose a novel model, dubbed Sparse Representation with Adaptive Graph (SRAG), which integrates adaptive graph learning and sparse representation into a unified framework. Specifically, the former can preserve the local manifold structure of data, while the latter is useful for digging global information. For the objective function of SRAG has multiple intractable terms, an ADMM method is developed to solve it. Numerous experimental results demonstrate that our proposed method consistently outperforms several representative clustering algorithms by significant margins.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

Notes

  1. In each iteration, we set \(\mathbf {Z} = \mathbf {Z}-diag(\mathbf {Z})\).

  2. The codes can be found in: http://www.cis.upenn.edu/jshi/software/.

  3. The codes of CAN and CLR can be found in: http://www.escience.cn/people/fpnie/index.html.

  4. The codes can be found in: http://www.vision.jhu.edu/code/.

  5. The codes can be found in http://www.cis.pku.edu.cn/faculty/vision/zlin/zlin.htm.

  6. The codes can be found in: https://www.researchgate.net/profile/Ming_Yin3.

References

  1. Asuncion A, Newman D (2007) Uci machine learning repository https://archive-beta.ics.uci.edu/ml/datasets

  2. Candès EJ, Li X, Ma Y, Wright J (2009) Robust principal component analysis? CoRR, arXiv:0912.3599

  3. Cheng B, Liu G, Wang J, Yan S (2011) Multi-task low-rank affinity pursuit for image segmentation. In: International conference on computer vision, pp 2439–2446

  4. Jo C, Paulo O, Takeo K (1998) A multibody factorization method for independently moving objects. Int J Comput Vis 29(3):159–179

    Article  Google Scholar 

  5. Dong W, Wu X (2018) Robust affine subspace clustering via smoothed \(\ell _0\)-norm. Neural Processing Letters, pp 1–13

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

    Article  Google Scholar 

  7. Fischler Martin A, Bolles Robert C (1981) Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun ACM 24(6):726–740

    MathSciNet  Google Scholar 

  8. Goh A, Vidal R (2007) Segmenting motions of different types by unsupervised manifold clustering. In: IEEE conference on computer vision and pattern recognition, pp 1–6

  9. Ho J, Yang MH, Lim J, Lee KC (2003) Clustering appearances of objects under varying illumination conditions. In: 2003 IEEE computer society conference on computer vision and pattern recognition, 2003. Proceedings, vol 1, pp I-11–I-18

  10. Hu W-B, Wu X-J (2020) Multi-geometric sparse subspace clustering. Neural Process Lett 52(1):849–867

    Article  Google Scholar 

  11. Ji P, Salzmann M, Li H (2014) Efficient dense subspace clustering. In: Applications of computer vision, pp 461–468

  12. Ji P, Salzmann M, Li H (2016) Shape interaction matrix revisited and robustified: efficient subspace clustering with corrupted and incomplete data. In: IEEE international conference on computer vision, pp 4687–4695

  13. Kanatani K (2001) Motion segmentation by subspace separation and model selection. In: Eighth IEEE international conference on computer vision, 2001. ICCV 2001. Proceedings, vol 2, pp 586–591

  14. Kumar S, Dai Y, Li H (2017) Spatio-temporal union of subspaces for multi-body non-rigid structure-from-motion. Pattern Recogn 71:428–443

  15. Guangcan L, Zhouchen L, Shuicheng Y, Sun J, Yong Y, Yi M (2013) Robust recovery of subspace structures by low-rank representation. IEEE Trans Pattern Anal Mach Intell 35(1):171–184

    Article  Google Scholar 

  16. Liu G, Lin Z, Yu Y (2010) Robust subspace segmentation by low-rank representation. In: International conference on machine learning, pp 663–670

  17. Guangcan L, Shuicheng Y (2011) Latent low-rank representation for subspace segmentation and feature extraction. In: IEEE international conference on computer vision, ICCV 2011, pp 1615–1622

  18. Junmin L, Yijun C, Jiang-She Z, Zongben X (2014) Enhancing low-rank subspace clustering by manifold regularization. IEEE Trans Image Process 23(9):4022–4030

    Article  MathSciNet  Google Scholar 

  19. Lu CY, Min H, Zhao ZQ, Zhu L, De Huang S, Yan S (2012) Robust and efficient subspace segmentation via least squares regression. In: European conference on computer vision, pp 347–360

  20. Nene SA, Nayar SK, Murase H, et al. (1996) Columbia object image library (coil-100)

  21. Nie F, Huang H (2016) Subspace clustering via new low-rank model with discrete group structure constraint. In: Proceedings of the international joint conference on artificial intelligence, pp 1874–1880

  22. Nie F, Wang X, Huang H (2014) Clustering and projected clustering with adaptive neighbors. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 977–986

  23. Peng X, Zhang L, Yi Z (2013) Scalable sparse subspace clustering. In: IEEE conference on computer vision and pattern recognition, pp 430–437

  24. Jianbo S, Jitendra M (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888–905

    Article  Google Scholar 

  25. Tipping ME, Bishop CM (1999) Mixtures of probabilistic principal component analyzers. Neural Comput 11(2):443–482

    Article  Google Scholar 

  26. Tseng P (2000) Nearest q-flat to m points. J Optim Theory Appl 105(1):249–252

    Article  MathSciNet  Google Scholar 

  27. Wang P, Han B, Li J, Gao X (2018) Structural reweight sparse subspace clustering. Neural processing letters, pp 1–13

  28. Wechsler H, Phillips JP, Bruce V, Soulie FF, Huang TS (2012) Face recognition: from theory to applications, vol 163. Springer, Berlin

    Google Scholar 

  29. Lai W, Xiaofeng W, Jun Y, Aihua W (2016) Spectral clustering steered low-rank representation for subspace segmentation. J Vis Commun Image Represent 38:386–395

    Article  Google Scholar 

  30. Jie W, Fang Xiaozhao X, Yong TC, Lunke F (2018) Low-rank representation with adaptive graph regularization. Neural Netw 108:83–96

    Article  Google Scholar 

  31. Wu Z, Yin M, Zhou Y, Fang X, Xie S (2017) Robust spectral subspace clustering based on least square regression. In: Neural processing letters, pp 1–14

  32. Yan J, Pollefeys M (2006) A general framework for motion segmentation: independent, articulated, rigid, non-rigid, degenerate and non-degenerate. In: European conference on computer vision, ECCV, pp 94–106

  33. Ming Y, Junbin G, Zhouchen L (2016) Laplacian regularized low-rank representation and its applications. IEEE Trans Pattern Anal Mach Intell 38(3):504–517

    Article  Google Scholar 

  34. Ming Y, Junbin G, Zhouchen L, Qinfeng S, Yi G (2015) Dual graph regularized latent low-rank representation for subspace clustering. IEEE Trans Image Process 24(12):4918–4933

    Article  MathSciNet  Google Scholar 

  35. Teng Z, Arthur S, Yi W, Gilad L (2010) Hybrid linear modeling via local best-fit flats. Int J Comput Vis 100(3):217–240

    MathSciNet  MATH  Google Scholar 

  36. Zhuang L, Gao H, Lin Z, Ma Y, Zhang X, Yu N (2012) Non-negative low rank and sparse graph for semi-supervised learning. In: 2012 IEEE conference on computer vision and pattern recognition, Providence, RI, USA, June 16–21, 2012, pp 2328–2335

Download references

Acknowledgements

This research was supported by Zhejiang Provincial Natural Science Foundation of China under Grant No. LY19F030006 and Wenzhou science and Technology Bureau of China (Wenzhou major scientific and technological innovation project under Grant No. zy2019019).

Author information

Authors and Affiliations

  1. School of Automation, Northwestern Polytechnical University, Xi’an, 710072, China

    Zhiyang Gu, Zhenghong Deng, Yijie Huang & Zhan Zhang

  2. Wenzhou Polytechnic, Wenzhou, 325035, China

    Zhiyang Gu

  3. Mechanical and Electronical, Northwestern Polytechnical University, Xi’an, 710072, China

    De Liu

Authors
  1. Zhiyang Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhenghong Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yijie Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. De Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Zhan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Zhiyang Gu or Zhenghong Deng.

Ethics declarations

Conflict of interest

There is no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gu, Z., Deng, Z., Huang, Y. et al. Subspace Clustering via Integrating Sparse Representation and Adaptive Graph Learning. Neural Process Lett 53, 4377–4388 (2021). https://doi.org/10.1007/s11063-021-10603-w

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11063-021-10603-w

Keywords

Search

Navigation