On the deletability of points in 3D thinning

  • R. Watzel
  • K. Braun
  • A. Hess
  • H. Scheich
  • W. Zuschratter
Session IA1b — Feature Matching & Detection
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1024)


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.


Black Point Active Contour Model Digital Picture White Point Topology Preservation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AdB85]
    C. Arcelli and G. Sanniti di Baja. A width independent fast thinning algorithm. IEEE Trans: PAMI, 7(4):463–474, 1985.Google Scholar
  2. [Cro78]
    F.C. Croom. Basic Concepts of Topology. Springer, 1978.Google Scholar
  3. [CWS87]
    R.T. Chin, H.K. Wan and D.L. Stover. A one-pass thinning algorithm and its parallel implementation. Computer Vision, Grphics and Image Processing, 40:30–40, 1987.Google Scholar
  4. [JC92]
    Ben K. Jang and Roland T. Chin. One-Pass Parallel Thinning: Analysis, Properties, and Quantitative Evaluation. IEEE Trans: PAMI, 11:1129–1140, 1992.Google Scholar
  5. [JP92]
    Liang Ji and Jim Piper. Fast Homotopy-Preserving Skeletons Using Mathematical Morphology. IEEE: PAMI, 14(6):653–664, 1992.Google Scholar
  6. [KR89]
    T.Y. Kong and A. Rosenfeld. Digital Topology: Introduction and Survey. Computer Vision, Graphics and Image Processing, 48:357–393, 1989.Google Scholar
  7. [KRR92]
    T.Y. Kong, W. Roscoe and A. Rosenfeld. Concepts of digital topology. Topology and its Applications, 46:219–262, 1992.Google Scholar
  8. [LL92]
    Frederic Leymarie and Martin D. Levine. Simulating the Grassfire Transform Using an Active Contour Model. IEEE Trans: PAMI, 14(1):56–75, 1992.Google Scholar
  9. [LLS92]
    Louisa Lam, Seong-Whan Lee and Ching Y. Suen. Thinning Methodologies — A Comprehensive Survey. IEEE Trans: PAMI, 9:869–885, 1992.Google Scholar
  10. [LP91]
    Chung-Nim Lee and Timothy Poston. Winding and euler numbers for 2d and 3d digital images. CVGIP: Graphical Models and Image Processing, 53(6):522–537, November 1991.Google Scholar
  11. [LPR93]
    Chung-Nim Lee, Timothy Poston and Azriel Rosenfeld. Holes and genus of 2d and 3d digital images. CVGIP: Graphical Models and Image Processing, 55(1):20–47, 1993.Google Scholar
  12. [LS91]
    Louisa Lam and Ching Y. Suen. A Dynamic Shape Preserving Thinning Algorithm. Signal Processing, 22:199–208, 1991.Google Scholar
  13. [SC94]
    P. K. Saha and B. B. Chaudhuri. Detection of 3-D Simple Points for Topology Preserving Transformations with Application to Thinning. IEEE Trans: PAMI, 16(10):1028–1031, 1994.Google Scholar
  14. [TF81]
    Y.F. Tsao and K.S. Fu. A Parallel Thinning Algorithm for 3D Pictures. Computer Graphics and Image Processing, 17:315–331, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 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