Three-dimensional surface mesh segmentation using curvedness-based region growing approach

A new parameter-free graph morphology based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint sub- eshes that correspond to the physical parts of the underlying object. Curvedness, which is a rotation and translation invariant shape descript...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 29(2007), 12 vom: 14. Dez., Seite 2195-204
1. Verfasser: Jagannathan, Anupama (VerfasserIn)
Weitere Verfasser: Miller, Eric L
Format: Aufsatz
Sprache:English
Veröffentlicht: 2007
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article Research Support, Non-U.S. Gov't
Beschreibung
Zusammenfassung:A new parameter-free graph morphology based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint sub- eshes that correspond to the physical parts of the underlying object. Curvedness, which is a rotation and translation invariant shape descriptor, is computed at every vertex in the input triangulation. Iterative graph dilation and morphological filtering of the outlier curvedness values result in multiple, disjoint, maximally connected sub-meshes such that each sub-mesh contains a set of vertices with similar curvedness values, and vertices in disjoint sub-meshes have significantly different curvedness values. Experimental evaluations using the triangulations of a number of complex objects demonstrate the robustness and the efficiency of the proposed algorithm and the results prove that it compares well with a number of state-of-the-art mesh segmentation algorithms
Beschreibung:Date Completed 18.12.2007
Date Revised 15.10.2007
published: Print
Citation Status MEDLINE
ISSN:1939-3539