Abstract
Critical kernels constitute a general framework settled in the context of abstract complexes for the study of parallel thinning in any dimension. We take advantage of the properties of this framework, to propose a generic thinning scheme for obtaining “thin” skeletons from objects made of voxels. From this scheme, we derive algorithms that produce curvilinear or surface skeletons, based on the notion of 1D or 2D isthmus.
This work has been partially supported by the “ANR-2010-BLAN-0205 KIDICO” project.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Kong, T.Y., Rosenfeld, A.: Digital topology: introduction and survey. Comp. Vision, Graphics and Image Proc. 48, 357–393 (1989)
Couprie, M., Bertrand, G.: New characterizations of simple points in 2D, 3D and 4D discrete spaces. IEEE Transactions on Pattern Analysis and Machine Intelligence 31(4), 637–648 (2009)
Bertrand, G.: On critical kernels. Comptes Rendus de l’Académie des Sciences, Série Math. I(345), 363–367 (2007)
Bertrand, G., Couprie, M.: Two-dimensional thinning algorithms based on critical kernels. Journal of Mathematical Imaging and Vision 31(1), 35–56 (2008)
Bertrand, G., Couprie, M.: Powerful Parallel and Symmetric 3D Thinning Schemes Based on Critical Kernels. Journal of Mathematical Imaging and Vision 48(1), 134–148 (2014)
Manzanera, A., Bernard, T., Prêteux, F., Longuet, B.: n-dimensional skeletonization: a unified mathematical framework. Journal of Electronic Imaging 11(1), 25–37 (2002)
Lohou, C., Bertrand, G.: Two symmetrical thinning algorithms for 3D binary images. Pattern Recognition 40, 2301–2314 (2007)
Palágyi, K.: A 3D fully parallel surface-thinning algorithm. Theoretical Computer Science 406(1-2), 119–135 (2008)
Tsao, Y., Fu, K.: A parallel thinning algorithm for 3D pictures. CGIP 17(4), 315–331 (1981)
Palágyi, K., Kuba, A.: A parallel 3D 12-subiteration thinning algorithm. Graphical Models and Image Processing 61(4), 199–221 (1999)
Lohou, C., Bertrand, G.: A 3D 6-subiteration curve thinning algorithm based on p-simple points. Discrete Applied Mathematics 151, 198–228 (2005)
Bertrand, G., Aktouf, Z.: A three-dimensional thinning algorithm using subfields. In: Vision Geometry III, vol. 2356, pp. 113–124. SPIE (1996)
Németh, G., Kardos, P., Palágyi, K.: Topology preserving 3D thinning algorithms using four and eight subfields. In: Campilho, A., Kamel, M. (eds.) ICIAR 2010. LNCS, vol. 6111, pp. 316–325. Springer, Heidelberg (2010)
Kovalevsky, V.: Finite topology as applied to image analysis. Computer Vision, Graphics and Image Processing 46, 141–161 (1989)
Kong, T.Y.: Topology-preserving deletion of 1’s from 2-, 3- and 4-dimensional binary images. In: Ahronovitz, E., Fiorio, C. (eds.) DGCI 1997. LNCS, vol. 1347, pp. 3–18. Springer, Heidelberg (1997)
Bertrand, G.: New notions for discrete topology. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol. 1568, pp. 218–228. Springer, Heidelberg (1999)
Bertrand, G., Malandain, G.: A new characterization of three-dimensional simple points. Pattern Recognition Letters 15(2), 169–175 (1994)
Bertrand, G.: Simple points, topological numbers and geodesic neighborhoods in cubic grids. Pattern Recognition Letters 15, 1003–1011 (1994)
Saha, P., Chaudhuri, B., Chanda, B., Dutta Majumder, D.: Topology preservation in 3D digital space. Pattern Recognition 27, 295–300 (1994)
Kong, T.Y.: On topology preservation in 2-D and 3-D thinning. International Journal on Pattern Recognition and Artificial Intelligence 9, 813–844 (1995)
Whitehead, J.: Simplicial spaces, nuclei and m-groups. Proceedings of the London Mathematical Society 45(2), 243–327 (1939)
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
Couprie, M., Bertrand, G. (2014). Isthmus-Based Parallel and Asymmetric 3D Thinning Algorithms. In: Barcucci, E., Frosini, A., Rinaldi, S. (eds) Discrete Geometry for Computer Imagery. DGCI 2014. Lecture Notes in Computer Science, vol 8668. Springer, Cham. https://doi.org/10.1007/978-3-319-09955-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-09955-2_5
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09954-5
Online ISBN: 978-3-319-09955-2
eBook Packages: Computer ScienceComputer Science (R0)