Robust Subspace Clustering via Smoothed Rank Approximation

by   Zhao Kang, et al.
Southern Illinois University

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 exactly under some restricted and theoretically interesting conditions. However, for many real-world applications, nuclear norm approximation to the rank function can only produce a result far from the optimum. To seek a solution of higher accuracy than the nuclear norm, in this paper, we propose a rank approximation based on Logarithm-Determinant. We consider using this rank approximation for subspace clustering application. Our framework can model different kinds of errors and noise. Effective optimization strategy is developed with theoretical guarantee to converge to a stationary point. The proposed method gives promising results on face clustering and motion segmentation tasks compared to the state-of-the-art subspace clustering algorithms.


Robust Subspace Clustering via Tighter Rank Approximation

Matrix rank minimization problem is in general NP-hard. The nuclear norm...

Subspace clustering based on low rank representation and weighted nuclear norm minimization

Subspace clustering refers to the problem of segmenting a set of data po...

Clustering using Max-norm Constrained Optimization

We suggest using the max-norm as a convex surrogate constraint for clust...

Connections Between Nuclear Norm and Frobenius Norm Based Representations

A lot of works have shown that frobenius-norm based representation (FNR)...

Approximate Matrix Multiplication with Application to Linear Embeddings

In this paper, we study the problem of approximately computing the produ...

Robust Subspace System Identification via Weighted Nuclear Norm Optimization

Subspace identification is a classical and very well studied problem in ...

Geometry of Factored Nuclear Norm Regularization

This work investigates the geometry of a nonconvex reformulation of mini...

Please sign up or login with your details

Forgot password? Click here to reset