Constrained K-means Clustering with Background Knowledge
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Laplacian Eigenmaps for dimensionality reduction and data representation
Neural Computation
Segmentation Given Partial Grouping Constraints
IEEE Transactions on Pattern Analysis and Machine Intelligence
Semi-Supervised Learning on Riemannian Manifolds
Machine Learning
Integrating constraints and metric learning in semi-supervised clustering
ICML '04 Proceedings of the twenty-first international conference on Machine learning
IEEE Transactions on Knowledge and Data Engineering
A tutorial on spectral clustering
Statistics and Computing
Clustering and Embedding Using Commute Times
IEEE Transactions on Pattern Analysis and Machine Intelligence
Semi-supervised graph clustering: a kernel approach
Machine Learning
A benchmark for 3D mesh segmentation
ACM SIGGRAPH 2009 papers
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Global intrinsic symmetries of shapes
SGP '08 Proceedings of the Symposium on Geometry Processing
International Journal of Computer Vision
International Journal of Computer Vision
Rigid and Articulated Point Registration with Expectation Conditional Maximization
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pose-consistent 3D shape segmentation based on a quantum mechanical feature descriptor
DAGM'11 Proceedings of the 33rd international conference on Pattern recognition
MeshGit: diffing and merging meshes for polygonal modeling
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Thinking of images as what they are: compound matrix regression for image classification
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We propose a spectral learning approach to shape segmentation. The method is composed of a constrained spectral clustering algorithm that is used to supervise the segmentation of a shape from a training data set, followed by a probabilistic label transfer algorithm that is used to match two shapes and to transfer cluster labels from a training-shape to a test-shape. The novelty resides both in the use of the Laplacian embedding to propagate must-link and cannotlink constraints, and in the segmentation algorithm which is based on a learn, align, transfer, and classify paradigm. We compare the results obtained with our method with other constrained spectral clustering methods and we assess its performance based on ground-truth data.