Directional 3D Thinning Using 8 Subiterations

  • Kálmán Palágyi
  • Attila Kuba
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1568)


Thinning of a binary object is an iterative layer by layer erosion to extract an approximation to its skeleton. In order to provide topology preservation, different thinning techniques have been proposed. One of them is the directional (or border sequential) approach in which each iteration step is subdivided into subiterations where only border points of certain kind are deleted in each subiteration. There are six kinds of border points in 3D images, therefore, 6-subiteration parallel thinning algorithms were generally proposed. In this paper, we present two 8-subiteration algorithms for extracting “surface skeletons” and “curve skeletons”, respectively. Both algorithms work in cubic grid for (26,6) images. Deletable points are given by templates that makes easy implementation possible.


  1. 1.
    Bertrand, G., Aktouf, Z.: A 3D thinning algorithms using subfields. In Proc. SPIE Conference on Vision Geometry III, Vol. 2356 (1994) 113–124Google Scholar
  2. 2.
    Bertrand, G.: A parallel thinning algorithm for medial surfaces. Pattern Recognition Letters16 (1995) 979–986CrossRefGoogle Scholar
  3. 3.
    Gong, W.X., Bertrand, G.: A simple parallel 3D thinning algorithm. In Proc. 10th International Conference on Pattern Recognition (1990) 188–190Google Scholar
  4. 4.
    Kong, T.Y., Rosenfeld, A.: Digital topology: Introduction and survey. Computer Vision, Graphics, and Image Processing48 (1989) 357–393CrossRefGoogle Scholar
  5. 5.
    Kong, T.Y.: On topology preservation in 2-d and 3-d thinning. International Journal of Pattern Recognition and Artifical Intelligence9 (1995) 813–844CrossRefGoogle Scholar
  6. 6.
    Lee, T., Kashyap, R.L., Chu, C.: Building skeleton models via 3-D medial surface/axis thinning algorithms. CVGIP: Graphical Models and Image Processing56 (1994) 462–478CrossRefGoogle Scholar
  7. 7.
    Ma, C.M.: On topology preservation in 3D thinning. CVGIP: Image Understanding59 (1994) 328–339CrossRefGoogle Scholar
  8. 8.
    Ma, C.M.: A 3D fully parallel thinning algorithm for generating medial faces. Pattern Recognition Letters16 (1995) 83–87CrossRefGoogle Scholar
  9. 9.
    Malandain, G., Bertrand, G.: Fast characterization of 3D simple points. Proc. 11th IEEE International Conference on Pattern Recognition (1992) 232–235Google Scholar
  10. 10.
    Morgenthaler, D.G.: Three-dimensional simple points: Serial erosion, parallel thinning and skeletonization. Technical Report TR1005, Computer Vision Laboratory, Computer Science Center, University of Maryland (1981)Google Scholar
  11. 11.
    Mukherjee, J., Das, P.P., Chatterjee, B.N.: On connectivity issues of ESPTA. Pattern Recognition Letters11 (1990) 643648Google Scholar
  12. 12.
    Palágyi K., Kuba, A.: A parallel 12-subiteration 3D thinning algorithm to extract medial lines. In Computer Analysis of Images and Patterns, Proceedings of the 7th International Conference, CAIP’97, Lecture Notes in Computer Science1296, Springer (1997) 400–407CrossRefGoogle Scholar
  13. 13.
    Palágyi K., Kuba, A.: A 3D 6-subiteration thinning algorithm for extracting medial lines. Pattern Recognition Letters19 (1998) 613–627zbMATHCrossRefGoogle Scholar
  14. 14.
    Saha, P.K., Chaudhuri, B.B.: Detection of 3-D simple points for topology preserving transformations with application to thinning. IEEE Transactions on Pattern Analysis and Machine Intelligence16 (1994) 1028–1032CrossRefGoogle Scholar
  15. 15.
    Tsao, Y.F., Fu, K.S.: A parallel thinning algorithm for 3-D pictures. Computer Graphics and Image Processing17 (1981) 315–331CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Kálmán Palágyi
    • 1
  • Attila Kuba
    • 1
  1. 1.Department of Applied InformaticsJózsef Attila UniversitySzegedHungary

Personalised recommendations