Euclidean skeletons of 3D data sets in linear time by the integer medial axis transform

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

249 Downloads (Pure)

Abstract

A general algorithm for computing Euclidean skeletons of 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. The algorithm is based upon the computation of 3D feature transforms, using a modification of an algorithm for Euclidean distance transforms. The skeletonization algorithm has a time complexity which is linear in the amount of voxels, and can be easily parallelized. The relation of the IMA skeleton to the usual definition in terms of centers of maximal disks is discussed.

Original languageEnglish
Title of host publicationMATHEMATICAL MORPHOLOGY: 40 YEARS ON
EditorsC Ronse, L Najman, E Decenciere
Place of PublicationDORDRECHT
PublisherSpringer
Pages259-268
Number of pages10
ISBN (Print)1-4020-3442-3
Publication statusPublished - 2005
Event7th International Symposium on Mathematical Morphology - , France
Duration: 18-Apr-200520-Apr-2005

Publication series

NameComputational Imaging and Vision
PublisherSPRINGER
Volume30

Other

Other7th International Symposium on Mathematical Morphology
CountryFrance
Period18/04/200520/04/2005

Keywords

  • feature transform
  • integer medial axis
  • 3-D Euclidean skeletonization
  • DISTANCE TRANSFORM
  • BINARY IMAGES
  • ALGORITHM
  • DIMENSIONS
  • MAPS

Cite this