Segmentation of 3D meshes through spectral clustering
Authors:
- 8 November 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15504085,p. 298-305
Abstract
We formulate and apply spectral clustering to 3D mesh segmentation for the first time and report our preliminary findings. Given a set of mesh faces, an affinity matrix which encodes the likelihood of each pair of faces belonging to the same group is first constructed. Spectral methods then use selected eigenvectors of the affinity matrix or its closely related graph Laplacian to obtain data representations that can be more easily clustered. We develop an algorithm that favors segmentation along concave regions, which is inspired by human perception. Our algorithm is theoretically sound, efficient, simple to implement, andean achieve high-quality segmentation results on 3D meshes.Keywords
This publication has 18 references indexed in Scilit:
- Hierarchical mesh decomposition using fuzzy clustering and cutsACM Transactions on Graphics, 2003
- Normalized cuts and image segmentation2002
- Metamorphosis of Polyhedral Surfaces using DecompositionComputer Graphics Forum, 2002
- Geometric Snakes for Triangular MeshesComputer Graphics Forum, 2002
- Decomposing polygon meshes for interactive applications2001
- Spectral compression of mesh geometry2000
- Segmentation using eigenvectors: a unifying view1999
- Partitioning 3D surface meshes using watershed segmentationIEEE Transactions on Visualization and Computer Graphics, 1999
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular GraphsSIAM Journal on Scientific Computing, 1998
- Feature grouping by 'relocalisation' of eigenvectors of the proximity matrix1990