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
LEADER 01000naa a22002652 4500
001 NLM174367007
003 DE-627
005 20231223135751.0
007 tu
008 231223s2007 xx ||||| 00| ||eng c
028 5 2 |a pubmed24n0581.xml 
035 |a (DE-627)NLM174367007 
035 |a (NLM)17934228 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Jagannathan, Anupama  |e verfasserin  |4 aut 
245 1 0 |a Three-dimensional surface mesh segmentation using curvedness-based region growing approach 
264 1 |c 2007 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 18.12.2007 
500 |a Date Revised 15.10.2007 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a 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 
650 4 |a Journal Article 
650 4 |a Research Support, Non-U.S. Gov't 
700 1 |a Miller, Eric L  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 29(2007), 12 vom: 14. Dez., Seite 2195-204  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:29  |g year:2007  |g number:12  |g day:14  |g month:12  |g pages:2195-204 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 29  |j 2007  |e 12  |b 14  |c 12  |h 2195-204