Skip to main content
Top
Published in: Neural Processing Letters 6/2021

23-07-2021

Subspace Clustering with Block Diagonal Sparse Representation

Authors: Xian Fang, Ruixun Zhang, Zhengxin Li, Xiuli Shao

Published in: Neural Processing Letters | Issue 6/2021

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Structured representation is of remarkable significance in subspace clustering. However, most of the existing subspace clustering algorithms resort to single-structured representation, which may fail to fully capture the essential characteristics of data. To address this issue, a novel multi-structured representation subspace clustering algorithm called block diagonal sparse representation (BDSR) is proposed in this paper. It takes both sparse and block diagonal structured representations into account to obtain the desired affinity matrix. The unified framework is established by integrating the block diagonal prior into the original sparse subspace clustering framework and the resulting optimization problem is iteratively solved by the inexact augmented Lagrange multipliers (IALM). Extensive experiments on both synthetic and real-world datasets well demonstrate the effectiveness and efficiency of the proposed algorithm against the state-of-the-art algorithms.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Appendix
Available only for authorised users
Literature
1.
go back to reference Lance P, Ehtesham H, Huan L (2004) Subspace clustering for high dimensional data: a review. ACM SIGKDD Explor Newslett 6(1):90–105CrossRef Lance P, Ehtesham H, Huan L (2004) Subspace clustering for high dimensional data: a review. ACM SIGKDD Explor Newslett 6(1):90–105CrossRef
2.
go back to reference Zhenyue Z, Keke Z (2012) Low-rank matrix approximation with manifold regularization. IEEE Trans Patt Anal Mach Intell 35(7):1717–1729 Zhenyue Z, Keke Z (2012) Low-rank matrix approximation with manifold regularization. IEEE Trans Patt Anal Mach Intell 35(7):1717–1729
3.
go back to reference Liansheng Z, Haoyuan G, Zhouchen L, Yi M, Xin Z, Nenghai Y (2012) Non-negative low rank and sparse graph for semi-supervised learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition (CVPR), pp 2328–2335 Liansheng Z, Haoyuan G, Zhouchen L, Yi M, Xin Z, Nenghai Y (2012) Non-negative low rank and sparse graph for semi-supervised learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition (CVPR), pp 2328–2335
4.
go back to reference Mahdi A, Patel Vishal M (2018) Multimodal sparse and low-rank subspace clustering. Inform Fusion 39:168–177CrossRef Mahdi A, Patel Vishal M (2018) Multimodal sparse and low-rank subspace clustering. Inform Fusion 39:168–177CrossRef
5.
go back to reference Wencheng Z, Jiwen L, Jie Z (2019) Structured general and specific multi-view subspace clustering. Patt Recogn 93:392–403CrossRef Wencheng Z, Jiwen L, Jie Z (2019) Structured general and specific multi-view subspace clustering. Patt Recogn 93:392–403CrossRef
6.
go back to reference John W, Yang Allen Y, Arvind G, Shankar SS, Yi M (2008) Robust face recognition via sparse representation. IEEE Trans Patt Anal Mach Intell 31(2):210–227 John W, Yang Allen Y, Arvind G, Shankar SS, Yi M (2008) Robust face recognition via sparse representation. IEEE Trans Patt Anal Mach Intell 31(2):210–227
7.
go back to reference Chunjie Z, Jing L, Qi T, Changsheng X, Hanqing L, Songde M (2011) Image classification by non-negative sparse coding, low-rank and sparse decomposition. In: Proceedings of the IEEE conference on computer vision and pattern recognition (CVPR), pp 1673–1680 Chunjie Z, Jing L, Qi T, Changsheng X, Hanqing L, Songde M (2011) Image classification by non-negative sparse coding, low-rank and sparse decomposition. In: Proceedings of the IEEE conference on computer vision and pattern recognition (CVPR), pp 1673–1680
8.
go back to reference Ori B, Michael E (2008) Compression of facial images using the K-SVD algorithm. J Vis Commun Image Represent 19(4):270–282 Ori B, Michael E (2008) Compression of facial images using the K-SVD algorithm. J Vis Commun Image Represent 19(4):270–282
9.
go back to reference Przemysław S, Śmieja M, Krzysztof M (2015) Subspaces clustering approach to lossy image compression. In: International conference on computer information systems and industrial management applications (CISIM), pp 571–579 Przemysław S, Śmieja M, Krzysztof M (2015) Subspaces clustering approach to lossy image compression. In: International conference on computer information systems and industrial management applications (CISIM), pp 571–579
10.
go back to reference Derin BS, Martin L, Rafael M, Katsaggelos Aggelos K (2012) Sparse Bayesian methods for low-rank matrix estimation. IEEE Trans Sig Process 60(8):3964–3977MathSciNetCrossRef Derin BS, Martin L, Rafael M, Katsaggelos Aggelos K (2012) Sparse Bayesian methods for low-rank matrix estimation. IEEE Trans Sig Process 60(8):3964–3977MathSciNetCrossRef
11.
go back to reference Jing Z, Yue S, Peiguang J, Jing L, Yuting S (2019) A structure-transfer-driven temporal subspace clustering for video summarization. Multimedia Tools Appl 78(17):24123–24145CrossRef Jing Z, Yue S, Peiguang J, Jing L, Yuting S (2019) A structure-transfer-driven temporal subspace clustering for video summarization. Multimedia Tools Appl 78(17):24123–24145CrossRef
12.
13.
go back to reference Elhamifar E, René V (2009) Sparse subspace clustering. In: Proceedings of the IEEE conference on computer vision and pattern recognition (CVPR), pp 2790–2797 Elhamifar E, René V (2009) Sparse subspace clustering. In: Proceedings of the IEEE conference on computer vision and pattern recognition (CVPR), pp 2790–2797
14.
go back to reference Elhamifar E, Vidal R (2013) Sparse subspace clustering: algorithm, theory, and applications. IEEE Trans Patt Anal Mach Intell 35(11):2765–2781CrossRef Elhamifar E, Vidal R (2013) Sparse subspace clustering: algorithm, theory, and applications. IEEE Trans Patt Anal Mach Intell 35(11):2765–2781CrossRef
15.
go back to reference Liu G, Zhouchen L, Yong Y (2010) Robust subspace segmentation by low-rank representation. In: Proceedings of the international conference on machine learning (ICML), pp 663–670 Liu G, Zhouchen L, Yong Y (2010) Robust subspace segmentation by low-rank representation. In: Proceedings of the international conference on machine learning (ICML), pp 663–670
16.
go back to reference Guangcan L, Zhouchen L, Shuicheng Yan J, Sun Yong Yu, Yi M (2013) Robust recovery of subspace structures by low-rank representation. IEEE Trans Patt Anal Mach Intell 35(1):171–184CrossRef Guangcan L, Zhouchen L, Shuicheng Yan J, Sun Yong Yu, Yi M (2013) Robust recovery of subspace structures by low-rank representation. IEEE Trans Patt Anal Mach Intell 35(1):171–184CrossRef
17.
go back to reference Canyi L, Jiashi F, Zhouchen L, Mei T, Shuicheng Y (2019) Subspace clustering by block diagonal representation. IEEE Trans Patt Anal Mach Intell 41(2):487–501CrossRef Canyi L, Jiashi F, Zhouchen L, Mei T, Shuicheng Y (2019) Subspace clustering by block diagonal representation. IEEE Trans Patt Anal Mach Intell 41(2):487–501CrossRef
18.
go back to reference Patel Vishal M, René V (2014) Kernel sparse subspace clustering. In: Proceedings of the IEEE international conference on image processing (ICIP), pp 2849–2853, Patel Vishal M, René V (2014) Kernel sparse subspace clustering. In: Proceedings of the IEEE international conference on image processing (ICIP), pp 2849–2853,
19.
go back to reference Jun Yu, Yong R, Dacheng T (2014) Click prediction for web image reranking using multimodal sparse coding. IEEE Trans Image Process 23(5):2019–2032MathSciNetCrossRef Jun Yu, Yong R, Dacheng T (2014) Click prediction for web image reranking using multimodal sparse coding. IEEE Trans Image Process 23(5):2019–2032MathSciNetCrossRef
20.
go back to reference Jun Yu, Dacheng T, Meng W, Yong R (2014) Learning to rank using user clicks and visual features for image retrieval. IEEE Trans Cybern 45(4):767–779 Jun Yu, Dacheng T, Meng W, Yong R (2014) Learning to rank using user clicks and visual features for image retrieval. IEEE Trans Cybern 45(4):767–779
21.
go back to reference Wanjun C, Erhu Z, Zhuomin Z (2016) A Laplacian structured representation model in subspace clustering for enhanced motion segmentation. Neurocomputing 208:174–182CrossRef Wanjun C, Erhu Z, Zhuomin Z (2016) A Laplacian structured representation model in subspace clustering for enhanced motion segmentation. Neurocomputing 208:174–182CrossRef
22.
go back to reference Jun W, Daming S, Dansong C, Yongqiang Z, Junbin G (2016) LRSR: low-rank-sparse representation for subspace clustering. Neurocomputing 214:1026–1037CrossRef Jun W, Daming S, Dansong C, Yongqiang Z, Junbin G (2016) LRSR: low-rank-sparse representation for subspace clustering. Neurocomputing 214:1026–1037CrossRef
23.
go back to reference He W, Chen Jim X, Weihua Z (2017) Low-rank representation with graph regularization for subspace clustering. Soft Comput 21(6):1569–1581CrossRef He W, Chen Jim X, Weihua Z (2017) Low-rank representation with graph regularization for subspace clustering. Soft Comput 21(6):1569–1581CrossRef
24.
go back to reference Guang LC, Chong Y, René V (2017) Structured sparse subspace clustering: a joint affinity learning and subspace clustering framework. IEEE Trans Image Process 26(6):2988–3001MathSciNetCrossRef Guang LC, Chong Y, René V (2017) Structured sparse subspace clustering: a joint affinity learning and subspace clustering framework. IEEE Trans Image Process 26(6):2988–3001MathSciNetCrossRef
25.
go back to reference Shiqiang D, Yide M, Yurun M (2017) Graph regularized compact low rank representation for subspace clustering. Knowled Based Syst 118:56–69CrossRef Shiqiang D, Yide M, Yurun M (2017) Graph regularized compact low rank representation for subspace clustering. Knowled Based Syst 118:56–69CrossRef
26.
go back to reference Lai W, Xiaofeng W, Aihua W, Rigui Z, Changming Z (2018) Robust subspace segmentation by self-representation constrained low-rank representation. Neural Process Lett 48(3):1671–1691CrossRef Lai W, Xiaofeng W, Aihua W, Rigui Z, Changming Z (2018) Robust subspace segmentation by self-representation constrained low-rank representation. Neural Process Lett 48(3):1671–1691CrossRef
27.
go back to reference Yanxi C, Gen L, Yuantao G (2018) Active orthogonal matching pursuit for sparse subspace clustering. IEEE Sig Process Lett 25(2):164–168CrossRef Yanxi C, Gen L, Yuantao G (2018) Active orthogonal matching pursuit for sparse subspace clustering. IEEE Sig Process Lett 25(2):164–168CrossRef
28.
go back to reference Chaoqun H, Jun Yu, Jian Z, Xiongnan J, Kyong-Ho L (2018) Multimodal face-pose estimation with multitask manifold deep learning. IEEE Trans Indus Inform 15(7):3952–3961 Chaoqun H, Jun Yu, Jian Z, Xiongnan J, Kyong-Ho L (2018) Multimodal face-pose estimation with multitask manifold deep learning. IEEE Trans Indus Inform 15(7):3952–3961
29.
go back to reference Jun Yu, Min T, Hongyuan Z, Dacheng T, Yong R (2019) Hierarchical deep click feature prediction for fine-grained image recognition. IEEE Trans Patt Anal Mach Intell Jun Yu, Min T, Hongyuan Z, Dacheng T, Yong R (2019) Hierarchical deep click feature prediction for fine-grained image recognition. IEEE Trans Patt Anal Mach Intell
30.
go back to reference Liu G, Shuicheng Y (2011) Latent low-rank representation for subspace segmentation and feature extraction. In: Proceedings of the IEEE international conference on computer vision (ICCV), pp 1615–1622 Liu G, Shuicheng Y (2011) Latent low-rank representation for subspace segmentation and feature extraction. In: Proceedings of the IEEE international conference on computer vision (ICCV), pp 1615–1622
31.
go back to reference Canyi L, Hai M, Zhongqiu Z, Lin Z, Deshuang H, Shuicheng Y (2012) Robust and efficient subspace segmentation via least squares regression. In: Proceedings of the European conference on computer vision (ECCV), pp 347–360 Canyi L, Hai M, Zhongqiu Z, Lin Z, Deshuang H, Shuicheng Y (2012) Robust and efficient subspace segmentation via least squares regression. In: Proceedings of the European conference on computer vision (ECCV), pp 347–360
32.
go back to reference Patel Vishal M, Nguyen Hien V, René V (2013) Latent space sparse subspace clustering. In: Proceedings of the IEEE international conference on computer vision (ICCV), pp 225–232 Patel Vishal M, Nguyen Hien V, René V (2013) Latent space sparse subspace clustering. In: Proceedings of the IEEE international conference on computer vision (ICCV), pp 225–232
33.
go back to reference Jie C, Hua M, Yongsheng S, Zhang Y (2017) Subspace clustering using a symmetric low-rank representation. Knowled Based Syst 127:46–57CrossRef Jie C, Hua M, Yongsheng S, Zhang Y (2017) Subspace clustering using a symmetric low-rank representation. Knowled Based Syst 127:46–57CrossRef
34.
go back to reference Huazhu C, Weiwei W, Xiangchu F, Ruiqiang H (2018) Discriminative and coherent subspace clustering. Neurocomputing 284:177–186CrossRef Huazhu C, Weiwei W, Xiangchu F, Ruiqiang H (2018) Discriminative and coherent subspace clustering. Neurocomputing 284:177–186CrossRef
35.
go back to reference Xian F, Zhixin T, Feiyang S, Jialiang Y (2019) Robust subspace clustering via symmetry constrained latent low rank representation with converted nuclear norm. Neurocomputing 340:211–221CrossRef Xian F, Zhixin T, Feiyang S, Jialiang Y (2019) Robust subspace clustering via symmetry constrained latent low rank representation with converted nuclear norm. Neurocomputing 340:211–221CrossRef
36.
go back to reference Lu C, Jiashi F, Zhouchen L, Shuicheng Y (2013) Correlation adaptive subspace segmentation by trace lasso. In: Proceedings of the IEEE international conference on computer vision (ICCV), pp 1345–1352 Lu C, Jiashi F, Zhouchen L, Shuicheng Y (2013) Correlation adaptive subspace segmentation by trace lasso. In: Proceedings of the IEEE international conference on computer vision (ICCV), pp 1345–1352
37.
go back to reference Wang YX, Xu H, Leng C (2013) Provable subspace clustering: when LRR meets SSC. In: Proceedings of the conference on neural information processing systems (NeurIPS), pp 64–72 Wang YX, Xu H, Leng C (2013) Provable subspace clustering: when LRR meets SSC. In: Proceedings of the conference on neural information processing systems (NeurIPS), pp 64–72
38.
go back to reference Xingyu X, Xianglin G, Guangcan L, Jun W (2017) Implicit block diagonal low-rank representation. IEEE Trans Image Process 27(1):477–489MathSciNetMATH Xingyu X, Xianglin G, Guangcan L, Jun W (2017) Implicit block diagonal low-rank representation. IEEE Trans Image Process 27(1):477–489MathSciNetMATH
39.
go back to reference Zhouchen L, Minming C, Yi M (2009) The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. Technical Report UILU-ENG-09-2215 Zhouchen L, Minming C, Yi M (2009) The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. Technical Report UILU-ENG-09-2215
40.
go back to reference Zhi H, Lin L, Suhong Z, Yi S (2016) Learning group-based sparse and low-rank representation for hyperspectral image classification. Patt Recogn 60:1041–1056CrossRef Zhi H, Lin L, Suhong Z, Yi S (2016) Learning group-based sparse and low-rank representation for hyperspectral image classification. Patt Recogn 60:1041–1056CrossRef
41.
go back to reference Jianbo S, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Patt Anal Mach Intell 22(8):888–905CrossRef Jianbo S, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Patt Anal Mach Intell 22(8):888–905CrossRef
42.
go back to reference Feng J, Zhouchen L, Huan X, Shuicheng Y (2014) Robust subspace segmentation with block-diagonal prior. In: Proceedings of the IEEE conference on computer vision and pattern recognition (CVPR), pp 3818–3825 Feng J, Zhouchen L, Huan X, Shuicheng Y (2014) Robust subspace segmentation with block-diagonal prior. In: Proceedings of the IEEE conference on computer vision and pattern recognition (CVPR), pp 3818–3825
43.
go back to reference Nene Samer A, Nayar Shree K, Hiroshi M (1996) Columbia object image library (COIL-20). Technical Report CUCS-005-96 Nene Samer A, Nayar Shree K, Hiroshi M (1996) Columbia object image library (COIL-20). Technical Report CUCS-005-96
44.
go back to reference Georghiades Athinodoros S, Belhumeur Peter N, Kriegman David J (2001) From few to many: illumination cone models for face recognition under variable lighting and pose. IEEE Trans Patt Anal Mach Intell 23(6):643–660CrossRef Georghiades Athinodoros S, Belhumeur Peter N, Kriegman David J (2001) From few to many: illumination cone models for face recognition under variable lighting and pose. IEEE Trans Patt Anal Mach Intell 23(6):643–660CrossRef
45.
go back to reference Chih LK, Jeffrey H, Kriegman David J (2005) Acquiring linear subspaces for face recognition under variable lighting. IEEE Trans Patt Anal Mach Intell 27(5):684–698CrossRef Chih LK, Jeffrey H, Kriegman David J (2005) Acquiring linear subspaces for face recognition under variable lighting. IEEE Trans Patt Anal Mach Intell 27(5):684–698CrossRef
46.
go back to reference van der Maaten L, Geoffrey H (2008) Visualizing data using t-SNE. J Mach Learn Res 9:2579–2605 van der Maaten L, Geoffrey H (2008) Visualizing data using t-SNE. J Mach Learn Res 9:2579–2605
47.
go back to reference Tron R, René V (2007) A benchmark for the comparison of 3-D motion segmentation algorithms. In: Proceedings of the IEEE conference on computer vision and pattern recognition (CVPR), pp 1–8 Tron R, René V (2007) A benchmark for the comparison of 3-D motion segmentation algorithms. In: Proceedings of the IEEE conference on computer vision and pattern recognition (CVPR), pp 1–8
48.
go back to reference Karl P (1901) On lines and planes of closest fit to systems of points in space. Philos Mag 2(11):559–572CrossRef Karl P (1901) On lines and planes of closest fit to systems of points in space. Philos Mag 2(11):559–572CrossRef
49.
go back to reference Harold H (1933) Analysis of a complex of statistical variables into principal components. J Educ Psychol 24(6):417–441CrossRef Harold H (1933) Analysis of a complex of statistical variables into principal components. J Educ Psychol 24(6):417–441CrossRef
Metadata
Title
Subspace Clustering with Block Diagonal Sparse Representation
Authors
Xian Fang
Ruixun Zhang
Zhengxin Li
Xiuli Shao
Publication date
23-07-2021
Publisher
Springer US
Published in
Neural Processing Letters / Issue 6/2021
Print ISSN: 1370-4621
Electronic ISSN: 1573-773X
DOI
https://doi.org/10.1007/s11063-021-10597-5

Other articles of this Issue 6/2021

Neural Processing Letters 6/2021 Go to the issue