Abstract
Thinning is a frequently used technique capable of producing all kinds of skeleton-like shape features in a topology-preserving way. It is an iterative object reduction: some border points of binary objects that satisfy some topological and geometrical constraints are deleted, and the entire process is repeated until stability is reached. In the conventional implementation of thinning algorithms, the deletability of all border points in the actual picture is to be investigated. That is why, we introduced the concept of k-attempt thinning (\(k\ge 1\)) in our previous work (presented in the 20th International Workshop on Combinatorial Image Analysis, IWCIA 2020). In the case of a k-attempt algorithm, if a border point ‘survives’ at least k successive iterations, it is ‘immortal’ (i.e., it cannot be deleted later). In this paper, we give a computationally efficient implementation scheme for 1-attempt thinning, and a 1-attempt 2D parallel thinning algorithm is reported. The advantage of the new implementation scheme over the conventional one is also illustrated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Couprie M (2006) Note on fifteen 2D parallel thinning algorithms, Internal Report, Université de Marne-la-Vallée, IMG2006-01
Eckhardt U, Maderlechner G (1993) Invariant thinning. Int J Pattern Recognit Artif Intell 7(5):1115–1144
Hall RW (1996) Parallel connectivity-preserving thinning algorithms. In: Kong TY, Rosenfeld A (eds) Topological algorithms for digital image processing. Elsevier Science, Amsterdam, pp 145–179
Hall RW, Kong TY, Rosenfeld A (1996) Shrinking binary images. In: Kong TY, Rosenfeld A (eds) Topological algorithms for digital image processing. Elsevier Science, Amsterdam, pp 31–98
Holmgren M, Wahlin A, Dunas T, Malm J, Eklund A (2020) Assessment of cerebral blood flow pulsatility and cerebral arterial compliance with 4D flow MRI. J Magn Reson Imaging 51(5):1516–1525
Iglesias-Cofán S, Formella A (2019) Guided thinning. Pattern Recognit Lett 128:176–182
Kardos P, Palágyi K (2013) On topology preservation in triangular, square, and hexagonal grids. In: Proceedings of 8th international symposium on image and signal processing and analysis, IEEE/EURASIP, ISPA, pp 782–787
Kardos P, Palágyi K (2015) Topology preservation on the triangular grid. Ann Math Artif Intell 75:53–68
Kong TY (2017) Critical kernels, minimal nonsimple sets, and hereditarily simple sets in binary images on n-dimensional polytopal complexes. In: Saha PK, Borgefors G, Sanniti di Baja G (eds) Skeletonization: theory, methods and applications. Academic Press, London, pp 211–256
Kong TY, Rosenfeld A (1989) Digital topology: introduction and survey. Comput Vis Graph Image Process 48:357–393
Kovalevsky VA (2008) Geometry of locally finite spaces. Publishing House, Berlin
Matejek B, Wei D, Wang X, Zhao J, Palágyi K, Pfister H (2019) Synapse-aware skeleton generation for neural circuits. In: Proceedings of 22nd international conference on medical image computing and computer assisted intervention, MICCAI 2019, Lecture Notes in Computer Science 11764. Springer, pp 227–235
Németh G, Palágyi K (2011) Topology preserving parallel thinning algorithms. Int J Imaging Syst Technol 21:37–44
Palágyi K (2008) A 3D fully parallel surface-thinning algorithm. Theor Comput Sci 406:119–135
Palágyi K, Németh G (2018) Fixpoints of iterated reductions with equivalent deletion rules. In: Proceedings of 19th international workshop on combinatorial image analysis, IWCIA 2018, Lecture notes in computer science 11255, Springer, pp 17–27
Palágyi K, Németh G (2019) Endpoint-based thinning with designating safe skeletal points. In: Proceedings of 6th international symposium on computational modeling of objects presented in images: fundamentals, methods, and applications, CompIMAGE’18, Lecture notes in computer science 10986. Springer, pp 3–15
Palágyi K, Németh G (2020) k-attempt thinning. In: Proceedings of 20th international workshop on combinatorial image analysis, IWCIA 2020, Lecture notes in computer science 12148. Springer Nature, pp 258–272
Palágyi K, Németh G, Kardos P (2012) Topology preserving parallel 3D thinning algorithms. In: Brimkov VE, Barneva RP (eds) Digital geometry algorithms—theoretical foundations and applications to computational imaging. Springer, pp 165–188
Saha PK, Borgefors G, Sanniti di Baja G (2016) A survey on skeletonization algorithms and their applications. Pattern Recognit Lett 76:3–12
Acknowledgements
This research was supported by the Project “Integrated program for training new generation of scientists in the fields of computer science”, no EFOP-3.6.3-VEKOP-16-2017-00002. This research was supported by Grant TUDFO/47138-1/2019-ITM of the Ministry for Innovation and Technology, Hungary.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Palágyi, K., Németh, G. 1-Attempt parallel thinning. J Comb Optim 44, 2395–2409 (2022). https://doi.org/10.1007/s10878-021-00744-y
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-021-00744-y