Dual Graph Regularized Latent Low-Rank Representation for Subspace Clustering

Low-rank representation (LRR) has received considerable attention in subspace segmentation due to its effectiveness in exploring low-dimensional subspace structures embedded in data. To preserve the intrinsic geometrical structure of data, a graph regularizer has been introduced into LRR framework for learning the locality and similarity information within data. However, it is often the case that not only the high-dimensional data reside on a non-linear low-dimensional manifold in the ambient space, but also their features lie on a manifold in feature space. In this paper, we propose a dual graph regularized LRR model (DGLRR) by enforcing preservation of geometric information in both the ambient space and the feature space. The proposed method aims for simultaneously considering the geometric structures of the data manifold and the feature manifold. Furthermore, we extend the DGLRR model to include non-negative constraint, leading to a parts-based representation of data. Experiments are conducted on several image data sets to demonstrate that the proposed method outperforms the state-of-the-art approaches in image clustering.Australian Research Council [DP140102270, DE120101161]; National Science Foundation of China [61322306]; Guangdong Province Higher Vocational Colleges and Schools Pearl River Scholar Funded Scheme for Scientific Funds; Guangdong Natural Science Foundation [2014A030313511]; Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry, China; National Basic Research Program of China (973 Program) [2015CB352502]; National Natural Science Foundation of China [61272341, 61231002]; Microsoft Research Asia Collaborative Research ProgramSCI(E)EIARTICLEyiming@gdut.edu.cn; jbgao@csu.edu.au; zlin@pku.edu.cn; javen.shi@adelaide.edu.au; yi.guo@csiro.au124918-49332