The Community for Technology Leaders
2015 IEEE International Conference on Computer Vision (ICCV) (2015)
Santiago, Chile
Dec. 7, 2015 to Dec. 13, 2015
ISSN: 2380-7504
ISBN: 978-1-4673-8390-5
pp: 1582-1590
ABSTRACT
In this paper, we explore the problem of multiview subspace clustering. We introduce a low-rank tensor constraint to explore the complementary information from multiple views and, accordingly, establish a novel method called Low-rank Tensor constrained Multiview Subspace Clustering (LT-MSC). Our method regards the subspace representation matrices of different views as a tensor, which captures dexterously the high order correlations underlying multiview data. Then the tensor is equipped with a low-rank constraint, which models elegantly the cross information among different views, reduces effectually the redundancy of the learned subspace representations, and improves the accuracy of clustering as well. The inference process of the affinity matrix for clustering is formulated as a tensor nuclear norm minimization problem, constrained with an additional L2,1-norm regularizer and some linear equalities. The minimization problem is convex and thus can be solved efficiently by an Augmented Lagrangian Alternating Direction Minimization (AL-ADM) method. Extensive experimental results on four benchmark datasets show the effectiveness of our proposed LT-MSC method.
INDEX TERMS
Tensile stress, Correlation, Clustering methods, Minimization, Kernel, Optimization, Aerospace electronics
CITATION

C. Zhang, H. Fu, S. Liu, G. Liu and X. Cao, "Low-Rank Tensor Constrained Multiview Subspace Clustering," 2015 IEEE International Conference on Computer Vision (ICCV), Santiago, Chile, 2015, pp. 1582-1590.
doi:10.1109/ICCV.2015.185
193 ms
(Ver 3.3 (11022016))