On the deletability of points in 3D thinning

  • R. Watzel
  • K. Braun
  • A. Hess
  • H. Scheich
  • W. Zuschratter
Session IA1b — Feature Matching & Detection

DOI: 10.1007/3-540-60697-1_91

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1024)
Cite this paper as:
Watzel R., Braun K., Hess A., Scheich H., Zuschratter W. (1995) On the deletability of points in 3D thinning. In: Chin R.T., Ip H.H.S., Naiman A.C., Pong TC. (eds) Image Analysis Applications and Computer Graphics. ICSC 1995. Lecture Notes in Computer Science, vol 1024. Springer, Berlin, Heidelberg

Abstract

An appropriate description of the shape of objects is essential for image analysis and understanding. A well known approach to this is the concept of skeleton. This paper considers a parallel thinning algorithm to compute the skeleton in 3D and proposes a new deletability criterion which retains points whose deletion depends on the deletion of their neighbors. The criterion is incorporated by filling components in a 3×3×3 window.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • R. Watzel
    • 1
  • K. Braun
    • 2
  • A. Hess
    • 2
  • H. Scheich
    • 2
  • W. Zuschratter
    • 2
  1. 1.Department of Digital TechnologyTechnical University of DarmstadtGermany
  2. 2.Federal Intitute for NeurobiologyMagdeburgGermany

Personalised recommendations