TY - GEN
T1 - Manifold Regularized Multi-view Subspace Clustering for image representation
AU - Wang, Lei
AU - Li, Danping
AU - He, Tiancheng
AU - Xue, Zhong
N1 - Funding Information:
This work was partially supported by National Natural Science Foundation of China (No. 61203137, 61401328), Natural Science Foundation of Shaanxi Province (No. 2014JQ8306, 2015JM6279), the Fundamental Research Funds for the Central Universities (No. K5051301007), and NIH 5-R03-EB018977 (ZX).
Publisher Copyright:
© 2016 IEEE.
Copyright:
Copyright 2019 Elsevier B.V., All rights reserved.
PY - 2016/1/1
Y1 - 2016/1/1
N2 - Subspace clustering refers to the task of clustering a collection of points drawn from a high-dimensional space into a union of multiple subspaces that best fits them. State-of-the-art approaches have been proposed for tackling this clustering problem by using the low-rank or sparse optimization techniques. However, most of the traditional subspace clustering methods are developed for single-view data and are not directly applicable to the multi-view scenario. In this paper, we present a Manifold Regularized Multi-view Subspace Clustering (MRMSC) method to better incorporate the correlated and complementary information from different views. MRMSC yields a unified affinity representation by joint optimization across different views. To respect the data manifold locally, the graph Laplacian is constructed to maintain the intrinsic geometrical structure of each view. In the multi-view integration, a sparsity constraint is imposed to the unified affinity representation in order to better reflect the data relationship from multiple views or features. In experiments, we compared the performance of clustering using MRMSC with the single-view and concatenate-multi-view methods on different datasets. The results showed that better clustering performance can be achieved by fusing the multiple features with a unified affinity representation by MRMSC.
AB - Subspace clustering refers to the task of clustering a collection of points drawn from a high-dimensional space into a union of multiple subspaces that best fits them. State-of-the-art approaches have been proposed for tackling this clustering problem by using the low-rank or sparse optimization techniques. However, most of the traditional subspace clustering methods are developed for single-view data and are not directly applicable to the multi-view scenario. In this paper, we present a Manifold Regularized Multi-view Subspace Clustering (MRMSC) method to better incorporate the correlated and complementary information from different views. MRMSC yields a unified affinity representation by joint optimization across different views. To respect the data manifold locally, the graph Laplacian is constructed to maintain the intrinsic geometrical structure of each view. In the multi-view integration, a sparsity constraint is imposed to the unified affinity representation in order to better reflect the data relationship from multiple views or features. In experiments, we compared the performance of clustering using MRMSC with the single-view and concatenate-multi-view methods on different datasets. The results showed that better clustering performance can be achieved by fusing the multiple features with a unified affinity representation by MRMSC.
UR - http://www.scopus.com/inward/record.url?scp=85019132005&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85019132005&partnerID=8YFLogxK
U2 - 10.1109/ICPR.2016.7899647
DO - 10.1109/ICPR.2016.7899647
M3 - Conference contribution
AN - SCOPUS:85019132005
T3 - Proceedings - International Conference on Pattern Recognition
SP - 283
EP - 288
BT - 2016 23rd International Conference on Pattern Recognition, ICPR 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 23rd International Conference on Pattern Recognition, ICPR 2016
Y2 - 4 December 2016 through 8 December 2016
ER -