Robust subspace learning-based low-rank representation for manifold clustering

被引:10
作者
Tang, Kewei [1 ]
Su, Zhixun [2 ,3 ]
Jiang, Wei [1 ]
Zhang, Jie [1 ]
Sun, Xiyan [4 ]
Luo, Xiaonan [5 ]
机构
[1] Liaoning Normal Univ, Sch Math, Huanghe Rd, Dalian 116029, Peoples R China
[2] Dalian Univ Technol, Sch Math Sci, 2 Linggong Rd, Dalian 116024, Peoples R China
[3] Guilin Univ Elect Technol, 1 Jinji Rd, Guilin 541004, Peoples R China
[4] Guilin Univ Elect Technol, Guangxi Expt Ctr Informat Sci, 1 Jinji Rd, Guilin 541004, Peoples R China
[5] Guilin Univ Elect Technol, Guangxi Coll & Univ Key Lab Intelligent Proc Comp, 1 Jinji Rd, Guilin 541004, Peoples R China
基金
中国国家自然科学基金;
关键词
Subspace learning; Low-rank representation; Manifold clustering; Spectral clustering-based methods; SEGMENTATION; ALGORITHM;
D O I
10.1007/s00521-018-3617-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Spectral clustering-based subspace clustering methods have attracted broad interest in recent years. This kind of methods usually uses the self-representation in the original space to extract the affinity between the data points. However, we can usually find a subspace where the affinity of the projected data points can be extracted by self-representation more effectively. Moreover, only using the self-representation in the original space cannot handle nonlinear manifold clustering well. In this paper, we present robust subspace learning-based low-rank representation learning a subspace favoring the affinity extraction for the low-rank representation. The process of learning the subspace and yielding the representation is conducted simultaneously, and thus, they can benefit from each other. After extending the linear projection to nonlinear mapping, our method can handle manifold clustering problem which can be viewed as a general case of subspace clustering. In addition, the l2,1-norm used in our model can increase the robustness of our method. Extensive experimental results demonstrate the effectiveness of our method on manifold clustering.
引用
收藏
页码:7921 / 7933
页数:13
相关论文
共 50 条
[1]  
[Anonymous], CVPR
[2]  
[Anonymous], 2009, CVPR
[3]  
[Anonymous], 2011, ICCV
[4]   k-plane clustering [J].
Bradley, PS ;
Mangasarian, OL .
JOURNAL OF GLOBAL OPTIMIZATION, 2000, 16 (01) :23-32
[5]   A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION [J].
Cai, Jian-Feng ;
Candes, Emmanuel J. ;
Shen, Zuowei .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) :1956-1982
[6]  
Cheng B, 2011, IEEE I CONF COMP VIS, P2439, DOI 10.1109/ICCV.2011.6126528
[7]   Sparse Subspace Clustering: Algorithm, Theory, and Applications [J].
Elhamifar, Ehsan ;
Vidal, Rene .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (11) :2765-2781
[8]   Nonlinear Dimensionality Reduction for Data with Disconnected Neighborhood Graph [J].
Fan, Jicong ;
Chow, Tommy W. S. ;
Zhao, Mingbo ;
Ho, John K. L. .
NEURAL PROCESSING LETTERS, 2018, 47 (02) :697-716
[9]   Accelerated low-rank representation for subspace clustering and semi-supervised classification on large-scale data [J].
Fan, Jicong ;
Tian, Zhaoyang ;
Zhao, Mingbo ;
Chow, Tommy W. S. .
NEURAL NETWORKS, 2018, 100 :39-48
[10]   Sparse subspace clustering for data with missing entries and high-rank matrix completion [J].
Fan, Jicong ;
Chow, Tommy W. S. .
NEURAL NETWORKS, 2017, 93 :36-44