Subspace Clustering via Optimal Direction Search
This letter presents a new spectral-clustering-based approach to the subspace clustering problem. Underpinning the proposed method is a convex program for optimal direction search, which for each data point d finds an optimal direction in the span of the data that has minimum projection on the other data points and non-vanishing projection on d. The obtained directions are subsequently leveraged to identify a neighborhood set for each data point. An alternating direction method of multipliers framework is provided to efficiently solve for the optimal directions. The proposed method is shown to notably outperform the existing subspace clustering methods, particularly for unwieldy scenarios involving high levels of noise and close subspaces, and yields the state-of-the-art results for the problem of face clustering using subspace segmentation.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringFace ClusteringSimilar Papers 제목 키워드 기반
Provable Data Clustering via Innovation Search
This paper studies the subspace clustering problem in which data points collected from high-dimensional ambient space lie in a union of linear subspaces. Subspace clustering becomes challenging when the dimension of inte…
ClusteringOutlier Detection and Data Clustering via Innovation Search
The idea of Innovation Search was proposed as a data clustering method in which the directions of innovation were utilized to compute the adjacency matrix and it was shown that Innovation Pursuit can notably outperform t…
ClusteringOutlier DetectionInnovation Pursuit: A New Approach to the Subspace Clustering Problem
This paper presents a new scalable approach, termed Innovation Pursuit (iPursuit), to the problem of subspace clustering. iPursuit rests on a new geometrical idea whereby each subspace is identified based on its nov…
ClusteringInnovation Pursuit: A New Approach to Subspace Clustering
In subspace clustering, a group of data points belonging to a union of subspaces are assigned membership to their respective subspaces. This paper presents a new approach dubbed Innovation Pursuit (iPursuit) to the probl…
ClusteringFace ClusteringBeyond Linear Subspace Clustering: A Comparative Study of Nonlinear Manifold Clustering Algorithms
Subspace clustering is an important unsupervised clustering approach. It is based on the assumption that the high-dimensional data points are approximately distributed around several low-dimensional linear subspaces. The…
Clustering