Departments:
- - Applied Informatics
- - Image Processing and Computer Graphics
- - Foundations of Computer Science
- - Computer Algorithms and Artificial Intelligence
- - Software Engineering
- - Research Group on Artificial Intelligence
[University of Szeged]
Thinning algorithms based on sufficient conditions for topology preservation
 | Members: Kálmán Palágyi, Péter Kardos, Gábor Németh Funded by
Homepage |
Description
Thinning is a widely used pre–processing step in digital image processing and pattern recognition. It is an iterative layer by layer erosion until only the "skeletons" of the objects are left. Thinning algorithms are generally constructed in the following way: first the thinning strategy and the deletion rules are figured out, then the topological correctness is proved. In the case of the proposed algorithms we used the converse way: first we considered some sufficient conditions for parallel reduction operators to preserve topology, then the deletion rules were accommodated to them. In our algorithms, the correctness is predestinated, hence no complex proof–part is needed. In 2D, we applied Ronse's sufficient conditions for topology preservation (C. Ronse: Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images. Discrete Applied Mathematics 21, 67-79, 1988); our 3D thinning algorithms are based on conditions proposed by Palágyi and Kuba (K. Palágyi, A. Kuba: A parallel 3D 12-subiteration thinning algorithm. Graphical Models and Image Processing 61, 1999, 199–221).Publications
- Gábor Németh and Kálmán Palágyi. Fully Parallel Thinning Algorithms Based on Ronse's Sufficient Conditions for Topology Preservation. In Progress in Combinatorial Image Analysis, pages 183-194, 2009. Research Publishing. [PDF]
- Kálmán Palágyi and Gábor Németh. Fully Parallel 3D Thinning Algorithms Based on Sufficient Conditions for Topology Preservation. In Srecko Brlek, Christophe Reutenauer, and Xavier Provencal, editors, Proceedings of the International Conference on Discrete Geometry for Computer Imagery, volume 5810 of Lecture Notes in Computer Science, Montréal, Québec, Canada, pages 481-492, sep--oct 2009. Springer Verlag. [PDF]
- 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]
- 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]
- Gábor Németh and Kálmán Palágyi. 2D parallel thinning algorithms based on isthmus-preservation. In S. Loncaric, G. Ramponi, and D. Sersic, editors, Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA), Dubrovnik, Croatia, pages 585-590, September 2011. IEEE. [PDF]
- 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]
- Gábor Németh and Kálmán Palágyi. Topology preserving parallel thinning algorithms. International Journal of Imaging Systems and Technology, 21:37-44, 2011. [PDF]
- Gábor Németh, Péter Kardos, and Kálmán Palágyi. 2D parallel thinning and shrinking based on sufficient conditions for topology preservation. Acta Cybernetica, 20:125-144, 2011. [PDF]
- Péter Kardos and Kálmán Palágyi. On topology preservation for hexagonal parallel 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 31-42, May 2011. Springer Verlag. [PDF]