• About Us
• Education
• Research
• PhD
• Acta Cybernetica
• Conferences
• Sponsors

• - Applied Informatics
• - Image Processing and Computer Graphics
• - Foundations of Computer Science
• - Computer Algorithms and Artificial Intelligence
• - Software Engineering
• - Research Group on Artificial Intelligence

3D Thinning Algorithms

Members: Kálmán Palágyi, Attila Kuba, Péter Kardos, Gábor Németh Funded by Hungarian Scientific Research Fund (OTKA) T23604 TÁMOP-4.2.2/08/1/2008-0008 program of the Hungarian National Development Agency Related Projects: Assessment of tracheal stenoses, infra-renal aortic aneurysms, and colorectal polyps Quantitative analysis of tubular tree structures 3D Thinning Algorithms Thinning algorithms based on sufficient conditions for topology preservation Lifetime: 1997 - 2009 Homepage

Description

Skeleton is a region-based shape descriptor which summarizes the general form of objects/shapes. An illustrative definition of the skeleton is given using the prairie-fire analogy: the object boundary is set on fire and the skeleton is formed by the loci where the fire fronts meet and extinguish each other.

Thinning is a frequently used method for making an approximation to the skeleton in a topology--preserving way. It is based on a digital simulation of the fire front propagation: the border points of a binary object that satisfy certain topological and geometric constraints are deleted in iteration steps. The entire process is then repeated until only the "skeleton" is left.

There are two types of 3D thinning algorithms: the curve--thinning type is used to extract medial lines or centerlines, while a surface--thinning type produces medial surfaces. We proposed various 3D thinning algorithms capable of extracting medial lines or medial surfaces as well.

Examples of different types of skeletal shape features in 3D:

Publications

1. Kálmán Palágyi. A 3-subiteration 3D thinning algorithm for extracting medial surfaces. Pattern Recognition Letters, 23:663-675, 2002. [PDF]
2. Kálmán Palágyi. A 3D parallel shrinking algorithm. Acta Cybernetica, 15:201-211, 2001. [PDF]
3. Kálmán Palágyi and Attila Kuba. A parallel 3D 12-subiteration thinning algorithm. Graphical Models and Image Processing, 61:199-221, 1999. [PDF]
4. Kálmán Palágyi and Attila Kuba. A 3D 6-subiteration thinning algorithm for extracting medial lines. Pattern Recognition Letters, 19:613-627, 1998. [PDF]
5. Kálmán Palágyi and Attila Kuba. A hybrid thinning algorithm for 3D medical images. Journal of Computing and Information Technology, 6:149-164, 1998. [PDF]
6. Kálmán Palágyi. A 3-Subiteration Surface-Thinning Algorithm. In Proceedings of International Conference on Computer Analysis of Images and Patterns, volume 4673 of Lecture Notes in Computer Science, pages 628-635, 2007. Springer Verlag. [PDF]
7. Kálmán Palágyi. A Subiteration-Based Surface-Thinning Algorithm with a Period of Three. In Proceedings of the Annual Symposium of the German Association for Pattern Recognition (DAGM), volume 4713 of Lecture Notes in Computer Science, pages 294-303, 2007. Springer Verlag. [PDF]
8. Kálmán Palágyi. A 3D 3-subiteration thinning algorithm for medial surfaces. In Proceedings of the International Conference on Discrete Geometry for Computer Imagery, volume 1953 of Lecture Notes in Computer Science, pages 406-417, 2000. Springer Verlag. [PDF]
9. Kálmán Palágyi and Attila Kuba. Directional 3D thinning using 8 subiterations. In Proceedings of the International Conference on Discrete Geometry for Computer Imagery, volume 1568 of Lecture Notes in Computer Science, pages 325-336, 1999. Springer Verlag. [PDF]
10. Kálmán Palágyi. A 3D fully parallel surface-thinning algorithm. Theoretical Computer Science, 406:119-135, 2008. [PDF]
11. Kálmán Palágyi and Gábor Németh. Fully Parallel 3D Thinning Algorithms Based on Sufficient Conditions for Topology Preservation. In Proceedings of the International Conference on Discrete Geometry for Computer Imagery, volume 5810 of Lecture Notes in Computer Science, pages 481-492, 2009. Springer Verlag. [PDF]
12. Gábor Németh, Péter Kardos, and Kálmán Palágyi. Topology Preserving 3D Thinning Algorithms Using Four and Eight Subfields. In Aurélio Campilho and Mohamed Kamel, editors, Proceedings of the International Conference on Image Analysis and Recognition, volume 6111 of Lecture Notes in Computer Science, Póvoa de Varzim, Portugal, pages 316-325, June 2010. Springer Verlag. [PDF]
13. Gábor Németh, Péter Kardos, and Kálmán Palágyi. Topology Preserving 2-Subfield 3D Thinning Algorithms. In Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications, Innsbruck, Austria, pages 310-316, February 2010. IASTED. [PDF]
14. Gábor Németh, Péter Kardos, and Kálmán Palágyi. A family of topology-preserving 3D parallel 6-subiteration thinning algorithms. In J.K. Aggarwal, R.P. Barneva, V.E. Brimkov, K.N. Koroutchev, and E.R. Korutcheva, editors, Proceedings of the International Workshop on Combinatorial Image Analysis, volume 6636 of Lecture Notes in Computer Science, Madrid, Spain, pages 17-30, May 2011. Springer Verlag. [PDF]