LatLRR : Robust latent low rank representation for subspace clustering - implementation -

another instance of subspace clustering (this time helped by robust PCA) and soon to be listed on the Advanced Matrix Factorization page.

 
Robust latent low rank representation for subspace clustering by Hongyang Zhanga, Zhouchen Lina, Chao Zhanga, Junbin Gaob,

Subspace clustering has found wide applications in machine learning, data mining, and computer vision. Latent Low Rank Representation (LatLRR) is one of the state-of-the-art methods for subspace clustering. However, its effectiveness is undermined by a recent discovery that the solution to the noiseless LatLRR model is non-unique. To remedy this issue, we propose choosing the sparest solution in the solution set. When there is noise, we further propose preprocessing the data with robust PCA. Experiments on both synthetic and real data demonstrate the advantage of our robust LatLRR over state-of-the-art methods.

An implementation of LatLRR is on Zouchin publication list (item 46).

  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.