Published in

Institute of Electrical and Electronics Engineers, IEEE Transactions on Image Processing, 12(24), p. 4918-4933, 2015

DOI: 10.1109/tip.2015.2472277

Links

Tools

Export citation

Search in Google Scholar

Dual Graph Regularized Latent Low-Rank Representation for Subspace Clustering

Journal article published in 2015 by Ming Yin, Junbin Gao ORCID, Zhouchen Lin, Javen Shi, Qinfeng Shi, Yi Guo
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

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 low-rank representation model (DGLRR) by enforcing preservation of geometric information in both the ambient space and the feature space. The proposed method aims for simultaneously taking into account 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.