Robust Spectral Subspace Clustering Based on Least Square Regression

摘要

In recent years, graph based subspace clustering has attracted considerable attentions in computer vision, as its capability of clustering data efficiently. However, the graph weights built by using representation coefficients are not the exact ones as the traditional definition. That is, the two steps are conducted in independent manner such that an overall optimal result cannot be guaranteed. To this end, in this paper, a novel subspace clustering via learning an adaptive graph affinity matrix is proposed, where the soft label and the representation coefficients of data are learned in an unified framework. First, the proposed method learns a robust representation for the data through least square regression, which reveals the subspace structure within data and captures various noises inside. Second, the segmentation is sought by conducting spectral clustering simultaneously. Most importantly, during the optimization process, the segmentation is utilized to iteratively enhance the block-diagonal structure of the learned representation to further assist the clustering process. Experimental results on several famous databases demonstrate that the proposed method performs better against the state-of-the-art approaches, in clustering.