J-linkage 算法，可以用于多体拟合的一种策略，优于Multi-ransac-This paper tackles the problem of fitting multiple instances of a model to data corrupted by noise and outliers. The proposed solution is based on random sampling and conceptual data representation. Each poin

spectral-clustering-demo 谱聚类的matlab演示程序，是学习谱聚类的好资料，经调试通过，包含n-cut和改进的n-cut-spectral-clustering-demo demo matlab spectral clustering, spectral clustering is good information to learn by debugging through, including the n-cut and improving the n-cut

Kmeans 聚类，graphcut 图像分割,最大流最小割算法-Kmeans clustering, graphcut image segmentation, the maximum flow minimum cut algorithm