Dual graph regularized latent low-rank representation for subspace clustering

Files

RA_hdl_101022.pdf (3.85 MB)
  (Restricted Access)

Date

2015

Authors

Yin, M.
Gao, J.
Lin, Z.
Shi, Q.
Guo, Y.

Editors

Advisors

Journal Title

Journal ISSN

Volume Title

Type:

Journal article

Citation

IEEE Transactions on Image Processing, 2015; 24(12):4918-4933

Statement of Responsibility

Ming Yin, Junbin Gao, Zhouchen Lin, Qinfeng Shi, and Yi Guo

Conference Name

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 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.

School/Discipline

Dissertation Note

Provenance

Description

Access Status

Rights

© 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.

License

Call number

Persistent link to this record