Greedy Approach for Subspace Clustering from Corrupted and Incomplete Data - implementation -

Greedy Approach for Subspace Clustering from Corrupted and Incomplete Data by Alexander Petukhov, Inna Kozlov. The abstract reads:

We describe the Greedy Sparse Subspace Clustering (GSSC) algorithm providing an efficient method for clustering data belonging to a few low-dimensional linear or affine subspaces from incomplete corrupted and noisy data. We provide numerical evidences that, even in the simplest implementation, the greedy approach increases the subspace clustering capability of the existing state-of-the art SSC algorithm significantly.

The attendant code implementation is here. Thanks Alex

Join the CompressiveSensing subreddit or the Google+ Community and post there !
Liked this entry ? subscribe to Nuit Blanche's feed, there's more where that came from. You can also subscribe to Nuit Blanche by Email, explore the Big Picture in Compressive Sensing or the Matrix Factorization Jungle and join the conversations on compressive sensing, advanced matrix factorization and calibration issues on Linkedin.