Euclidean skeletons of digital image and volume data in linear time by the integer medial axis transform

A general algorithm for computing Euclidean skeletons of 2D and 3D data sets in linear time is presented. These skeletons are defined in terms of a new concept, called the integer medial axis (IMA) transform. We prove a number of fundamental properties of the IMA skeleton, and compare these with pro...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 30(2008), 12 vom: 07. Dez., Seite 2204-17
1. Verfasser: Hesselink, Wim H (VerfasserIn)
Weitere Verfasser: Roerdink, Jos B T M
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2008
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM184327938
003 DE-627
005 20231223170422.0
007 cr uuu---uuuuu
008 231223s2008 xx |||||o 00| ||eng c
024 7 |a 10.1109/TPAMI.2008.21  |2 doi 
028 5 2 |a pubmed24n0615.xml 
035 |a (DE-627)NLM184327938 
035 |a (NLM)18988952 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Hesselink, Wim H  |e verfasserin  |4 aut 
245 1 0 |a Euclidean skeletons of digital image and volume data in linear time by the integer medial axis transform 
264 1 |c 2008 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 14.01.2009 
500 |a Date Revised 07.11.2008 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a A general algorithm for computing Euclidean skeletons of 2D and 3D data sets in linear time is presented. These skeletons are defined in terms of a new concept, called the integer medial axis (IMA) transform. We prove a number of fundamental properties of the IMA skeleton, and compare these with properties of the CMD (centers of maximal disks) skeleton. Several pruning methods for IMA skeletons are introduced (constant, linear and square-root pruning) and their properties studied. The algorithm for computing the IMA skeleton is based upon the feature transform, using a modification of a linear-time algorithm for Euclidean distance transforms. The skeletonization algorithm has a time complexity which is linear in the number of input points, and can be easily parallelized. We present experimental results for several data sets, looking at skeleton quality, memory usage and computation time, both for 2D images and 3D volumes 
650 4 |a Journal Article 
700 1 |a Roerdink, Jos B T M  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 30(2008), 12 vom: 07. Dez., Seite 2204-17  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:30  |g year:2008  |g number:12  |g day:07  |g month:12  |g pages:2204-17 
856 4 0 |u http://dx.doi.org/10.1109/TPAMI.2008.21  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 30  |j 2008  |e 12  |b 07  |c 12  |h 2204-17