Spectral Curvature Clustering (SCC)
Spectral Curvature Clustering (SCC) is a multi-way spectral clustering algorithm for solving the problem of hybrid linear modeling, that is, to model and segment data using an arrangement of affine subspaces. For the justification of the algorithm and its underlying theory, please refer to the FoCM paper below; for the practical techniques and numerical results, please see the IJCV paper below.
Publications
- Motion Segmentation for Hopkins 155 Database Via SCC [PDF], G. Chen and G. Lerman, The 4th ICCV Workshop on Dynamical Vision, September 2009, Kyoto, Japan.
- Foundations of a Multi-way Spectral Clustering Framework for Hybrid Linear Modeling [PDF], G. Chen and G. Lerman, Found. Comput. Math. (2009) 9: 517–558, DOI 10.1007/s10208-009-9043-7.
- Spectral Curvature Clustering (SCC) [PDF], G. Chen and G. Lerman, Int. J. Comput. Vis. (2009) 81:317-330, DOI 10.1007/s11263-008-0178-9.
Talks
Matlab Codes
- SCC (implemented by the authors, with some help from Stefan Atev to improve speed)
- Other algorithms compared with in the IJCV paper:
C++ implementation
- SCC (implemented by Amit Hooda; have NOT been tested by the authors)
Supplemental Data
Extensions to Multi-Manifold Data Modeling
Contact Info
Acknowledgement
- The research described here was supported by NSF grant #0612608.
Last updated on 12/12/2021. Maintained by Guangliang Chen.