Abstract：Least square regression subspace clustering(LSR) is the lack of local correlation information of data, and thus dense representation is caused. Aiming at this problem, locality constraint enhanced least squares regression subspace clustering(LC_LSR) is proposed. The original algorithm of LSR is extended by adding the local correlation constraint to achieve an accurate coefficient matrix and then it is close to being block diagonal. Furthermore, a method to construct affinity matrix is proposed. The proposed algorithm can better strengthen the affinities within each cluster and weaken the ones across clusters. Experimental results show that the proposed algorithm effectively improves the accuracy of clustering and its effectiveness and feasibility are verified.
[1] ZHANG T, SZLAM A, LERMAN G. Median k-flats for Hybrid Li-near Modeling with Many Outliers // Proc of the 12th IEEE International Conference on Computer Vision. Washington, USA: IEEE, 2009: 234-241. [2] LU L, VIDAL R. Combined Central and Subspace Clustering for Computer Vision Applications // Proc of the 23rd International Conference on Machine Learning. New York, USA: ACM, 2006: 593-600. [3] VIDAL R, MA Y, SASTRY S. Generalized Principal Component Analysis(GPCA). IEEE Transactions on Pattern Analysis and Machine Intelligence, 2005, 27(12): 1945-1959. [4] TIPPING M E, BISHOP C M. Mixtures of Probabilistic Principal Component Analyzers. Neural Computation, 1999, 11(2): 443-482. [5] YAN J Y, POLLEFEYS M. A General Framework for Motion Segmentation: Independent, Articulated, Rigid, Non-rigid, Degenerate and Non-degenerate // Proc of the 9th European Conference on Compu-ter Vision. Berlin, Germany: Springer, 2006, IV: 94-106. [6] CHEN G L, LERMAN G. Spectral Curvature Clustering(SCC). International Journal of Computer Vision, 2009, 81(3): 317-330. [7] ELHAMIFAR E, VIDAL R. Sparse Subspace Clustering: Algorithm, Theory, and Applications. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013, 35(11): 2765-2781. [8] LIU G C, LIN Z C, YAN S C, et al. Robust Recovery of Subspace Structures by Low-Rank Representation. IEEE Transactions on Pa-ttern Analysis and Machine Intelligence, 2013, 35(1): 171-184. [9] LU C Y, MIN H, ZHAO Z Q, et al. Robust and Efficient Subspace Segmentation via Least Squares Regression // Proc of the 12th European Conference on Computer Vision. Berlin, Germany: Springer, 2012, VII: 347-360. [10] SHI J B, MALIK J. Normalized Cuts and Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000, 22(8): 888-905. [11] ROWEIS S T, SAUL L K. Nonlinear Dimensionality Reduction by Locally Linear Embedding. Science, 2000, 290(5500): 2323-2326. [12] TENENBAUM J B, DE SILVA V, LANGFORD J C. A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science, 2000, 290(5500): 2319-2323. [13] HE X F, YAN S C, HU Y X, et al. Face Recognition Using Laplacianfaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2005, 27(3): 328-340. [14] HE X F, CAI D, YAN S C, et al. Neighborhood Preserving Embedding // Proc of the 10th IEEE International Conference on Computer Vision. Washington, USA: IEEE, 2005, II: 1208-1213. [15] BELKIN M, NIYOGI P. Laplacian Eigenmaps for Dimensionality Reduction and Data Representation. Neural Computation, 2003, 15(6): 1373-1396. [16] ZHENG M, BU J J, CHEN C, et al. Graph Regularized Sparse Coding for Image Representation. IEEE Transactions on Image Processing, 2011, 20(5): 1327-1336. [17] LONG M S, DING G G, WANG J M, et al. Transfer Sparse Co-ding for Robust Image Representation // Proc of the IEEE Confe-rence on Computer Vision and Pattern Recognition. Washington, USA: IEEE, 2013: 407-414. [18] 李 波,卢春园,冷成财,等.基于局部图拉普拉斯约束的鲁棒低秩表示聚类方法.自动化学报, 2015, 41(11): 1971-1980. (LI B, LU C Y, LENG C C, et al. Robust Low Rank Subspace Clustering Based on Local Graph Laplace Constraint. Acta Automatica Sinica, 2015, 41(11): 1971-1980.) [19] 简彩仁,陈晓云.基于投影最小二乘回归子空间分割的基因表达数据聚类.模式识别与人工智能, 2015, 28(8): 728-734. (JIAN C R, CHEN X Y. Gene Expression Data Clustering Based on Projection Least Square Regression Subspace Segmentation. Pa-ttern Recognition and Artificial Intelligence, 2015, 28(8): 728-734.) [20] 傅文进,吴小俊.基于l2 范数的加权低秩子空间聚类.软件学报, 2017. http://www.jos.org.cn/1000-9825/5235.htm. (FU W J, WU X J. Weighted Low Rank Subspace Clustering Based on l2 Norm. Journal of Software, 2017.http://www.jos. org.cn/1000-9825/5235.htm.) [21] LANCASTER P. Explicit Solutions of Linear Matrix Equations. SIAM Review, 1970, 12(4): 544-566. [22] HU H, LIN Z C, FENG J J, et al. Smooth Representation Clus- tering // Proc of the IEEE Conference on Computer Vision and Pa-ttern Recognition. Washington, USA: IEEE, 2014: 3834-3841. [23] CHEN J, ZHANG H X, MAO H, et al. Symmetric Low-Rank Representation for Subspace Clustering. Neurocomputing, 2016, 173: 1192-1202. [24] TRON R, VIDAL R. A Benchmark for the Comparison of 3-d Motion Segmentation Algorithms // Proc of the IEEE Conference on Computer Vision and Pattern Recognition. Washington, USA: IEEE, 2007. DOI: 10.1109/CVPR.2007.382974. [25] KUHN H W. The Hungarian Method for the Assignment Problem // J NGER M, LIEBLING T M, NADDEF D, et al., eds. 50 Years of Integer Programming 1958-2008. Berlin, Germany: Springer, 2010: 29-47. [26] BOYD S, PARIKH N, CHU E, et al. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers. Foundations and Trends in Machine Learning, 2011, 3(1): 1-122. [27] LIN Z C, CHEN M M, MA Y Q. The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices[J/OL]. [2016-12-25]. http://yima.csl.illinois.edu/psfile/Lin09-MP.pdf.
2017, Vol. 30 
