Robust recovery of subspace structures by low-rank representation

In this paper, we address the subspace clustering problem. Given a set of data samples (vectors) approximately drawn from a union of multiple subspaces, our goal is to cluster the samples into their respective subspaces and remove possible outliers as well. To this end, we propose a novel objective...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 35(2013), 1 vom: 15. Jan., Seite 171-84
1. Verfasser: Liu, Guangcan (VerfasserIn)
Weitere Verfasser: Lin, Zhouchen, Yan, Shuicheng, Sun, Ju, Yu, Yong, Ma, Yi
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2013
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article Research Support, Non-U.S. Gov't