Robust Subspace Clustering via Tighter Rank Approximation
Matrix rank minimization problem is in general NP-hard. The nuclear norm is used to substitute the rank function in many recent studies. Nevertheless, the nuclear norm approximation adds all singular values together and the approximation error may depend heavily on the magnitudes of singular values. This might restrict its capability in dealing with many practical problems. In this paper, an arctangent function is used as a tighter approximation to the rank function. We use it on the challenging subspace clustering problem. For this nonconvex minimization problem, we develop an effective optimization procedure based on a type of augmented Lagrange multipliers (ALM) method. Extensive experiments on face clustering and motion segmentation show that the proposed method is effective for rank approximation.
Code (1)
Tasks
ClusteringFace ClusteringMotion SegmentationSimilar Papers 제목 키워드 기반
Subspace clustering based on low rank representation and weighted nuclear norm minimization
Subspace clustering refers to the problem of segmenting a set of data points approximately drawn from a union of multiple linear subspaces. Aiming at the subspace clustering problem, various subspace clustering algorithm…
ClusteringRobust Subspace Clustering via Smoothed Rank Approximation
Matrix rank minimizing subject to affine constraints arises in many application areas, ranging from signal processing to machine learning. Nuclear norm is a convex relaxation for this problem which can recover the rank e…
ClusteringFace ClusteringMotion SegmentationLogDet Rank Minimization with Application to Subspace Clustering
Low-rank matrix is desired in many machine learning and computer vision problems. Most of the recent studies use the nuclear norm as a convex surrogate of the rank operator. However, all singular values are simply added …
ClusteringFace ClusteringMotion SegmentationAnchor Structure Regularization Induced Multi-view Subspace Clustering via Enhanced Tensor Rank Minimization
The tensor-based multi-view subspace clustering algorithms have received widespread attention due to the powerful ability to capture high-order correlation across views. Although such algorithms have achieved remarka…
ClusteringMulti-view Subspace ClusteringDimensionality Reduction for k-Means Clustering and Low Rank Approximation
We show how to approximate a data matrix $\mathbf{A}$ with a much smaller sketch $\mathbf{\tilde A}$ that can be used to solve a general class of constrained k-rank approximation problems to within $(1+\epsilon)$ error. …
ClusteringDimensionality Reduction