Tensor LRR and sparse coding-based subspace clustering

[thumbnail of 2016-TNNLS-TLRR.pdf]
Preview
Text - Accepted Version
· Please see our End User Agreement before downloading.
| Preview

Please see our End User Agreement.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Fu, Y., Gao, J., Tien, D., Lin, Z. and Hong, X. orcid id iconORCID: https://orcid.org/0000-0002-6832-2298 (2016) Tensor LRR and sparse coding-based subspace clustering. IEEE Transactions on Neural Networks and Learning Systems, 27 (10). pp. 2120-2133. ISSN 2162-237X doi: 10.1109/TNNLS.2016.2553155

Abstract/Summary

Subspace clustering groups a set of samples from a union of several linear subspaces into clusters, so that the samples in the same cluster are drawn from the same linear subspace. In the majority of the existing work on subspace clustering, clusters are built based on feature information, while sample correlations in their original spatial structure are simply ignored. Besides, original high-dimensional feature vector contains noisy/redundant information, and the time complexity grows exponentially with the number of dimensions. To address these issues, we propose a tensor low-rank representation (TLRR) and sparse coding-based (TLRRSC) subspace clustering method by simultaneously considering feature information and spatial structures. TLRR seeks the lowest rank representation over original spatial structures along all spatial directions. Sparse coding learns a dictionary along feature spaces, so that each sample can be represented by a few atoms of the learned dictionary. The affinity matrix used for spectral clustering is built from the joint similarities in both spatial and feature spaces. TLRRSC can well capture the global structure and inherent feature information of data, and provide a robust subspace segmentation from corrupted data. Experimental results on both synthetic and real-world data sets show that TLRRSC outperforms several established state-of-the-art methods.

Altmetric Badge

Item Type Article
URI https://reading-clone.eprints-hosting.org/id/eprint/65628
Identification Number/DOI 10.1109/TNNLS.2016.2553155
Refereed Yes
Divisions Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
Publisher IEEE Computational Intelligence Society
Download/View statistics View download statistics for this item

Downloads

Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar