2017
DOI: 10.22266/ijies2017.1031.16
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Hierarchical 3D Mesh Segmentation Using Negative Curvature and Dihedral Angle

Abstract: Decomposing a 3D mesh into significant regions is considered as a fundamental process in computer graphics, since several algorithms use the segmentation results as an initial step, such as, skeleton extraction, shape retrieval, shape correspondence, and compression. In this work, we present a new segmentation algorithm using spectral clustering where the affinity matrix is constructed by combining the minimal curvature and dihedral angles to detect both concave and convex properties of each edge. Experimental… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 28 publications
0
6
0
Order By: Relevance
“…1 shows the obtained results. As can be seen from the obtained results, the curve obtained using learning-based approach (LB) [30] gives once again a very good classification performance by being classified at the top of the automatic segmentation algorithms, followed by the Randomized Cut algorithm (RC) [31] which slightly superforms the approach based on spectral clustering (SC) [34]. In addition, the learning-based ap-proach(LB) [30] offers a gain in operating time compared to the Randomized Cuts algorithm (RC) [31], which is costly in terms of response time of the different random segmentations it based.…”
Section: Our Proposed Approachmentioning
confidence: 92%
“…1 shows the obtained results. As can be seen from the obtained results, the curve obtained using learning-based approach (LB) [30] gives once again a very good classification performance by being classified at the top of the automatic segmentation algorithms, followed by the Randomized Cut algorithm (RC) [31] which slightly superforms the approach based on spectral clustering (SC) [34]. In addition, the learning-based ap-proach(LB) [30] offers a gain in operating time compared to the Randomized Cuts algorithm (RC) [31], which is costly in terms of response time of the different random segmentations it based.…”
Section: Our Proposed Approachmentioning
confidence: 92%
“…Then a heterogeneous graph is created by merging the weighted graph based on adjacency of patches of an initial oversegmentation and the weighted dual mesh graph. Recently in [5], our research team propose a new approach for 3D mesh segmentation that takes into account the concave and convex regions, based on the dihedral angles and negative curvatures for generating the adjacency matrix and the spectral clustering as a criterion of partitioning.…”
Section: Related Workmentioning
confidence: 99%
“…In the last decades, several techniques of 3D segmentation have been developed [3]. Among different 3D segmentation approaches, spectral clustering methods [4,5] and learning approaches [6] are the most relevant and have several beneficial features in practical applications. They make the formulation of the problem more flexible and the computation more efficient.…”
Section: Introductionmentioning
confidence: 99%
“…Existing approaches for wireframe extraction from polygonal mesh rely on local shape properties, such as surface curvatures [14] and angles between faces/vertices [1]. These shape properties are too local to capture the global structure of 3D meshes, yielding unsatised feature extraction results.…”
Section: Introductionmentioning
confidence: 99%