Component‐based nearest neighbour subspace clustering

Abstract In this paper, the problem of clustering data points that lie near or on a union of independent low‐dimensional subspaces is addressed. To this end, the popular spectral clustering‐based algorithms usually follow a two‐stage strategy that initially builds an affinity matrix and then applies...

Full description

Bibliographic Details
Main Authors: Katsuya Hotta, Haoran Xie, Chao Zhang
Format: Article
Language:English
Published: Wiley 2022-08-01
Series:IET Image Processing
Online Access:https://doi.org/10.1049/ipr2.12518