LRSR: Low-Rank-Sparse representation for subspace clustering

详细信息    查看全文

• 作者：Jun Wang^a ; ^{junwangsd@hit.edu.cn" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Daming Shi^a ; ^b ; ^{d.m.shi@hotmail.com" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Dansong Cheng^a ; ^{cdsinhit@hit.edu.cn" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Yongqiang Zhang^a ; ^{seekever@foxmail.com" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Junbin Gao^c ; ^{junbin.gao@sydney.edu.au" class="auth_mail" title="E-mail the corresponding author}Author Vitae
• 关键词：Subspace clustering ; Low rank representation ; Sparse representation ; Spectral clustering
• 刊名：Neurocomputing
• 出版年：2016
• 出版时间：19 November 2016
• 年：2016
• 卷：214
• 期：Complete
• 页码：1026-1037
• 全文大小：2723 K

文摘

High-dimensional data in the real world often resides in low-dimensional subspaces. The state-of-the-art methods for subspace segmentation include Low Rank Representation (LRR) and Sparse Representation (SR). The former seeks the global lowest rank representation but restrictively assumes the independence among subspaces, whereas the latter seeks the clustering of disjoint or overlapped subspaces through locality measure, which may cause failure in the case of large noises. To this end, a Low Rank subspace Sparse Representation framework, hereafter referred to as LRSR, is proposed in this paper to recover and segment embedding subspaces simultaneously. Three major contributions can be claimed in this paper: First, a clean dictionary is constructed by optimizing its nuclear norm, low-rank-sparse coefficient matrix obtained using linearized alternating direction method (LADM). Second, both the convergence proof and the complexity analysis are given to prove the effectiveness and efficiency of our proposed LRSR algorithm. Third, the experiments on synthetic data and two benchmark datasets further verify that the LRSR enjoys the capability of clustering disjoint subspaces as well as the robustness against large noises, thanks to its considerations of both global and local subspace information. Therefore, it has been demonstrated in this research that our proposed LRSR algorithm outperforms the state-of-the-art subspace clustering methods, verified by both theoretical analysis and the empirical studies.