Abstract
Thinning is a frequently applied skeletonization technique: border points that satisfy certain topological and geometric constraints are deleted in iteration steps. Sequential thinning algorithms may alter just one point at a time, while parallel algorithms can delete a set of border points simultaneously. Two thinning algorithms are said to be equivalent if they can produce the same result for each input binary picture. This work shows that the existing 2D fully parallel thinning algorithm proposed by Manzanera et al. is equivalent to a topology-preserving sequential thinning algorithm with the same deletion rule.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bertrand, G., Couprie, M.: Transformations topologiques discrètes. In: Coeurjolly, D., Montanvert, A., Chassery, J. (eds.) Géométrie Discrète et Images Numériques, pp. 187–209. Hermès Science Publications (2007)
Hall, R.W.: Parallel connectivity-preserving thinning algorithms. In: Kong, T.Y., Rosenfeld, A. (eds.) Topological Algorithms for Digital Image Processing, pp. 145–179. Elsevier Science B.V. (1996)
Kardos, P., Palágyi, K.: Order-independent sequential thinning in arbitrary dimensions. In: Proc. Int. Conf. Signal and Image Processing and Applications, SIPA 2011, pp. 129–134 (2011)
Kardos, P., Palágyi, K.: On Topology Preservation in Triangular, Square, and Hexagonal Grids. In: Proc. 8th Int. Symposium on Image and Signal Processing and Analysis, ISPA 2013, pp. 782–787 (2013)
Kong, T.Y.: On topology preservation in 2–d and 3–d thinning. International Journal of Pattern Recognition and Artificial Intelligence 9, 813–844 (1995)
Kong, T.Y., Rosenfeld, A.: Digital topology: Introduction and survey. Computer Vision, Graphics, and Image Processing 48, 357–393 (1989)
Lam, L., Lee, S.-W., Suen, S.-W.: Thinning methodologies — A comprehensive survey. IEEE Trans. Pattern Analysis and Machine Intelligence 14, 869–885 (1992)
Manzanera, A., Bernard, T.M., Pretêux, F., Longuet, B.: n-dimensional skeletonization: a unified mathematical framework. Journal of Electronic Imaging 11, 25–37 (2002)
Palágyi, K.: Deletion Rules for Equivalent Sequential and Parallel Reductions. In: Ruiz-Shulcloper, J., Sanniti di Baja, G. (eds.) CIARP 2013, Part I. LNCS, vol. 8258, pp. 17–24. Springer, Heidelberg (2013)
Ranwez, V., Soille, P.: Order independent homotopic thinning for binary and grey tone anchored skeletons. Pattern Recognition Letters 23, 687–702 (2002)
Ronse, C.: Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images. Discrete Applied Mathematics 21, 67–79 (1988)
Siddiqi, K., Pizer, S. (eds.): Medial representations – Mathematics, algorithms and applications. Computational Imaging and Vision, vol. 37. Springer (2008)
Suen, C.Y., Wang, P.S.P. (eds.): Thinning methodologies for pattern recognition. Series in Machine Perception and Artificial Intelligence, vol. 8. World Scientific (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Palágyi, K. (2014). Equivalent 2D Sequential and Parallel Thinning Algorithms. In: Barneva, R.P., Brimkov, V.E., Šlapal, J. (eds) Combinatorial Image Analysis. IWCIA 2014. Lecture Notes in Computer Science, vol 8466. Springer, Cham. https://doi.org/10.1007/978-3-319-07148-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-07148-0_9
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07147-3
Online ISBN: 978-3-319-07148-0
eBook Packages: Computer ScienceComputer Science (R0)