Journal
GRAPHICAL MODELS
Volume 76, Issue -, Pages 440-456Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.gmod.2014.04.009
Keywords
Single segmentation field; Spectral analysis; Sub-eigenvector; Isoline
Categories
Funding
- Natural Science Foundation of China [61272218, 61321491]
- 973 Program of China [2010CB327903]
- Hong Kong Research Grant Council [GRF619611, GRF619012]
- Program for New Century Excellent Talents [NCET-11-0232]
Ask authors/readers for more resources
We present an automatic mesh segmentation framework that achieves 3D segmentation in two stages, hierarchical spectral analysis and isoline-based boundary detection. During the hierarchical spectral analysis stage, a novel segmentation field is defined to capture a concavity-aware decomposition of eigenvectors from a concavity-aware Laplacian. Specifically, a sufficient number of eigenvectors is first adaptively selected and simultaneously partitioned into sub-eigenvectors through spectral clustering. Next, on the sub-eigenvectors level, we evaluate the confidence of identifying a spectral-sensitive mesh boundary for each sub-eigenvector by two joint measures, namely, inner variations and part oscillations. The selection and combination of sub-eigenvectors are thereby formulated as an optimization problem to generate a single segmentation field. In the isoline-based boundary detection stage, the segmentation boundaries are recognized by a divide-merge algorithm and a cut score, which respectively filters and measures desirable isolines from the concise single segmentation field. Experimental results on the Princeton Segmentation Benchmark and a number of other complex meshes demonstrate the effectiveness of the proposed method, which is comparable to recent state-of-the-art algorithms. (C) 2014 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available