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...
Description complète
Détails bibliographiques
| Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 42(2020), 6 vom: 14. Juni, Seite 1537-1544
|
|---|
| Auteur principal: |
Yang, Jufeng
(Auteur) |
|---|
| Autres auteurs: |
Liang, Jie,
Wang, Kai,
Rosin, Paul L,
Yang, Ming-Hsuan |
|---|
| Format: | Article en ligne
|
|---|
| Langue: | English |
|---|
| Publié: |
2020
|
|---|
| Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence
|
|---|
| Sujets: | Journal Article |
|---|