MATLAB implementations of Subspace Clustering Algorithms.

Subkit currently implements the following algorithms:

• Sparse Subspace Clustering
• Low-Rank Subspace Clustering
• Robust and Effcient Subspace Segmentation via Least Squares Regression
• Correlation Adaptive Subspace Segmentation by Trace Lasso

Spatial Penalised Variants:

• [Spatial Subspace Clustering] 5
• Ordered Subspace Clustering
• Low Rank Sequential Subspace Clustering

Multi-task and Collaborative Variants:

• Multi-task Low-rank Affinity Pursuit for Image Segmenation

Cite "Segmentation of Subspaces in Sequential Data" by Stephen Tierney, Yi Guo and Junbin Gao

Please lso provide a direct link to this webpage somewhere in your paper (https://github.com/sjtrny/SubKit)

@article{tierney2015segmentation,
title={Segmentation of Subspaces in Sequential Data},
author={Tierney, Stephen and Guo, Yi and Gao, Junbin},
journal={arXiv preprint arXiv:1504.04090},
year={2015}
}

The research project is supported by the Australian Research Council (ARC) through the grant DP130100364.

• NCut