Scalable Sparse Subspace Clustering by Orthogonal Matching Pursuit

07/05/2015
by   Chong You, et al.
0

Subspace clustering methods based on ℓ_1, ℓ_2 or nuclear norm regularization have become very popular due to their simplicity, theoretical guarantees and empirical success. However, the choice of the regularizer can greatly impact both theory and practice. For instance, ℓ_1 regularization is guaranteed to give a subspace-preserving affinity (i.e., there are no connections between points from different subspaces) under broad conditions (e.g., arbitrary subspaces and corrupted data). However, it requires solving a large scale convex optimization problem. On the other hand, ℓ_2 and nuclear norm regularization provide efficient closed form solutions, but require very strong assumptions to guarantee a subspace-preserving affinity, e.g., independent subspaces and uncorrupted data. In this paper we study a subspace clustering method based on orthogonal matching pursuit. We show that the method is both computationally efficient and guaranteed to give a subspace-preserving affinity under broad conditions. Experiments on synthetic data verify our theoretical analysis, and applications in handwritten digit and face clustering show that our approach achieves the best trade off between accuracy and efficiency.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/09/2016

Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering

State-of-the-art subspace clustering methods are based on expressing eac...
research
08/05/2016

Sparse Subspace Clustering via Diffusion Process

Subspace clustering refers to the problem of clustering high-dimensional...
research
03/05/2019

A Novel Efficient Approach with Data-Adaptive Capability for OMP-based Sparse Subspace Clustering

Orthogonal Matching Pursuit (OMP) plays an important role in data scienc...
research
08/17/2018

On Geometric Analysis of Affine Sparse Subspace Clustering

Sparse subspace clustering (SSC) is a state-of-the-art method for segmen...
research
11/02/2018

Scalable Deep k-Subspace Clustering

Subspace clustering algorithms are notorious for their scalability issue...
research
02/26/2015

Connections Between Nuclear Norm and Frobenius Norm Based Representations

A lot of works have shown that frobenius-norm based representation (FNR)...
research
06/28/2015

On the Approximation Theory of Linear Variational Subspace Design

Solving large-scale optimization on-the-fly is often a difficult task fo...

Please sign up or login with your details

Forgot password? Click here to reset