Subspace Clustering via Good Neighbors
Finding the informative subspaces of high-dimensional datasets is at the core of numerous applications in computer vision, where spectral-based subspace clustering is arguably the most widely studied method due to its strong empirical performance. Such algorithms first compute an affinity matrix to...
Ausführliche Beschreibung
Bibliographische Detailangaben
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 42(2020), 6 vom: 14. Juni, Seite 1537-1544
|
|---|
| 1. Verfasser: |
Yang, Jufeng
(VerfasserIn) |
|---|
| Weitere Verfasser: |
Liang, Jie,
Wang, Kai,
Rosin, Paul L,
Yang, Ming-Hsuan |
|---|
| Format: | Online-Aufsatz
|
|---|
| Sprache: | English |
|---|
| Veröffentlicht: |
2020
|
|---|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence
|
|---|
| Schlagworte: | Journal Article |
|---|