Journal ArticleDOI
A survey on Mesh Segmentation Techniques
Reads0
Chats0
TLDR
A review of the state of the art of segmentation and partitioning techniques of boundary meshes and identifies two primarily distinct types of mesh segmentation, namely part segments and surface‐patch segmentation.Abstract:
We present a review of the state of the art of segmentation and partitioning techniques of boundary meshes. Recently, these have become a part of many mesh and object manipulation algorithms in computer graphics, geometric modelling and computer aided design. We formulate the segmentation problem as an optimization problem and identify two primarily distinct types of mesh segmentation, namely part segmentation and surface-patch segmentation. We classify previous segmentation solutions according to the different segmentation goals, the optimization criteria and features used, and the various algorithmic techniques employed. We also present some generic algorithms for the major segmentation techniques.read more
Citations
More filters
Journal ArticleDOI
A scalable active framework for region annotation in 3D shape collections
Li Yi,Vladimir G. Kim,Duygu Ceylan,I-Chao Shen,Mengyan Yan,Hao Su,Cewu Lu,Qixing Huang,Alla Sheffer,Leonidas J. Guibas +9 more
TL;DR: This work proposes a novel active learning method capable of enriching massive geometric datasets with accurate semantic region annotations, and demonstrates that incorporating verification of all produced labelings within this unified objective improves both accuracy and efficiency of the active learning procedure.
Journal ArticleDOI
A Survey on Shape Correspondence
TL;DR: This survey is motivated in part by recent developments in space–time registration, where one seeks a correspondence between non‐rigid and time‐varying surfaces, and semantic shape analysis, which underlines a recent trend to incorporate shape understanding into the analysis pipeline.
Journal ArticleDOI
A benchmark for 3D mesh segmentation
TL;DR: The results suggest that people are remarkably consistent in the way that they segment most 3D surface meshes, that no one automatic segmentation algorithm is better than the others for all types of objects, and that algorithms based on non-local shape features seem to produce segmentations that most closely resemble ones made by humans.
Journal ArticleDOI
Learning 3D mesh segmentation and labeling
TL;DR: This paper presents a data-driven approach to simultaneous segmentation and labeling of parts in 3D meshes, formulated as a Conditional Random Field model, with terms assessing the consistency of faces with labels, and terms between labels of neighboring faces.
References
More filters
Journal ArticleDOI
Normalized cuts and image segmentation
Jianbo Shi,Jitendra Malik +1 more
TL;DR: This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.
Journal ArticleDOI
Least squares quantization in PCM
TL;DR: In this article, the authors derived necessary conditions for any finite number of quanta and associated quantization intervals of an optimum finite quantization scheme to achieve minimum average quantization noise power.
Proceedings ArticleDOI
Normalized cuts and image segmentation
Jianbo Shi,Jitendra Malik +1 more
TL;DR: This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.
Journal ArticleDOI
Mean shift: a robust approach toward feature space analysis
Dorin Comaniciu,Peter Meer +1 more
TL;DR: It is proved the convergence of a recursive mean shift procedure to the nearest stationary point of the underlying density function and, thus, its utility in detecting the modes of the density.
Least Squares Quantization in PCM
TL;DR: The corresponding result for any finite number of quanta is derived; that is, necessary conditions are found that the quanta and associated quantization intervals of an optimum finite quantization scheme must satisfy.