Skip to content
forked from stephenbeckr/SSC

Sparse Subspace Clustering (for linear and affine spaces)

License

Notifications You must be signed in to change notification settings

jamesfolberth/SSC

 
 

Repository files navigation

Sparse Subspace Clustering (SSC) algorithms

This repository contains Matlab code to implement ADMM and proximal gradient algorithms to solve the SSC clustering problem (several variants, including variants for affine subspaces). The SSC model we work with is based on the well-known work of Elhamifar and Vidal's Sparse "Subspace Clustering: Algorithm, Theory, and Applications" (IEEE Trans. on PAMI) (and their code is at their VisionLab website as well as their JHUVisionLab Github site ).

The paper that explains this code is Efficient Solvers for Sparse Subspace Clustering (Pourkamali-Anaraki and Becker, 2018)

Why use this code?

The new ADMM code is much faster, as it scales like O(n^2) instead of O(n^3)

Scaling

The proximal gradient code doesn't have the extra rho parameter that ADMM algorithms need. The ADMM algorithms are quite sensitive to this parameter, as the following experiment shows:

Parameters

Dependencies

To run the l1 proximal gradient descent code, you need a recent copy of the TFOCS package.
One of the scripts uses CVX as well, but CVX is not needed to run any of the SSC functions, only for comparison

Authors

The authors are Stephen Becker and Farhad Pourkamali-Anaraki (University of Colorado Applied Math)

This README from April 2018. Thanks to https://stackedit.io/app for editing markup

About

Sparse Subspace Clustering (for linear and affine spaces)

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • MATLAB 71.7%
  • C++ 28.3%