On parallel thinning algorithms: Minimal non-simple sets, P-simple points and critical kernels

Journal of Mathematical Imaging and Vision

Volumn 35, Issue 1, 2009, Pages 23-35

  Bertrand, Gilles ^a   Couprie, Michel ^a  

^a UNIVERSITÉ PARIS EST   (France)

Author keywords

4D space; Collapse; Critical kernel; Cubical complex; Minimal non simple set; P simple point; Parallel thinning; Simple point; Topology preservation

Indexed keywords

4D SPACE; COLLAPSE; CRITICAL KERNEL; CUBICAL COMPLEX; MINIMAL NON-SIMPLE SET; P-SIMPLE POINT; PARALLEL THINNING; SIMPLE POINT; TOPOLOGY PRESERVATION;

PARALLEL ALGORITHMS;

EID: 67651046230     PISSN: 09249907     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10851-009-0152-3     Document Type: Article

References (34)

1. P.S. Alexandroff 1937 Diskrete Räume Math. Sb. 2 3 501 518
2. G. Bertrand 1995 On P-simple points C. R. Acad. Sci., Sér. Math. I 321 1077 1084
3. Bertrand, G.: Sufficient conditions for 3D parallel thinning algorithms. In: SPIE Vision Geometry IV, vol. 2573, pp. 52-60 (1995)
4. G. Bertrand 2007 On critical kernels C. R. Acad. Sci., Sér. Math. I 345 363 367
5. Bertrand, G., Couprie, M.: A new 3D parallel thinning scheme based on critical kernels. In: Discrete Geometry for Computer Imagery. Lecture Notes in Computer Science, vol. 4245, pp. 580-591. Springer, Berlin (2006) (Pubitemid 44850534)
6. G. Bertrand M. Couprie 2008 Two-dimensional parallel thinning algorithms based on critical kernels J. Math. Imaging Vis. 31 1 35 56
7. R.H. Bing 1964 Some aspects of the topology of 3-manifolds related to the Poincaré conjecture Lect. Mod. Math. II 93 128
8. J. Burguet R. Malgouyres 2003 Strong thinning and polyhedric approximation of the surface of a voxel object Discrete Appl. Math. 125 93 114
9. Cohen, M.M.: A Course in Simple Homotopy Theory. Springer, Berlin (1973)
10. Couprie, M.: Note on fifteen 2d parallel thinning algorithms. Internal Report, Université de Marne-la-Vallée, IGM2006-01 (2006)
11. M. Couprie G. Bertrand 2009 New characterizations of simple points in 2D, 3D and 4D discrete spaces IEEE Trans. Pattern Anal. Mach. Intell. 31 4 637 648
12. C.-J. Gau T.Y. Kong 2003 Minimal non-simple sets in 4D binary images Graph. Models 65 112 130 (Pubitemid 36863823)
13. Giblin, P.: Graphs, Surfaces and Homology. Chapman and Hall, London (1981)
14. R.W. Hall 1992 Tests for connectivity preservation for parallel reduction operators Topol. Appl. 46 3 199 217
15. Kaczynski, T., Mischaikow, K., Mrozek, M.: Computational Homology. Springer, Berlin (2004)
16. E. Khalimsky R. Kopperman P.R. Meyer 1990 Computer graphics and connected topologies on finite ordered sets Topol. Appl. 36 1 17
17. T.Y. Kong 1995 On topology preservation in 2-D and 3-D thinning Int. J. Pattern Recognit. Artif. Intell. 9 813 844
18. Kong, T.Y.: Topology-preserving deletion of 1's from 2-, 3- and 4-dimensional binary images. In: Discrete Geometry for Computer Imagery. Lecture Notes in Computer Science, vol. 1347, pp. 3-18. Springer, Berlin (1997)
19. Kong, T.Y.: Minimal non-simple and minimal non-cosimple sets in binary images on cell complexes. In: Discrete Geometry for Computer Imagery. Lecture Notes in Computer Science, vol. 4245, pp. 169-188. Springer, Berlin (2006) (Pubitemid 44850500)
20. T.Y. Kong 2008 Minimal non-deletable and minimal non-codeletable sets in binary images Theor. Comput. Sci. 406 1-2 97 118
21. Kong, T.Y., Gau, C.-J.: Minimal non-simple sets in 4-dimensional binary images with (8-80)-adjacency. In: International Workshop on Combinatorial Image Analysis, pp. 318-333 (2004) (Pubitemid 39741827)
22. T.Y. Kong A. Rosenfeld 1989 Digital topology: introduction and survey Comput. Vis. Graph. Image Process. 48 357 393 (Pubitemid 20645890)
23. Kong, T.Y.: On the problem of determining whether a parallel reduction operator for N-dimensional binary images always preserves topology. In: Proc. SPIE Vision Geometry II, vol. 2060, pp. 69-77 (1993)
24. Kong, T.Y., Litherland, R., Rosenfeld, A.: Problems in the topology of binary digital images. In: Open Problems in Topology, pp. 376-385. Elsevier, Amsterdam (1990)
25. V.A. Kovalevsky 1989 Finite topology as applied to image analysis Comput. Vis. Graph. Image Process. 46 141 161
26. C. Lohou G. Bertrand 2004 A 3D 12-subiteration thinning algorithm based on P-simple points Discrete Appl. Math. 139 171 195
27. C. Lohou G. Bertrand 2005 A 3D 6-subiteration curve thinning algorithm based on P-simple points Discrete Appl. Math. 151 198 228 (Pubitemid 41334766)
28. C.M. Ma 1994 On topology preservation in 3d thinning Comput. Vis. Graph. Image Process. 59 3 328 339
29. A. Manzanera T.M. Bernard F. Prêteux B. Longuet 2002 N-dimensional skeletonization: a unified mathematical framework J. Electron. Imaging 11 1 25 37 (Pubitemid 34278370)
30. Maunder, C.R.F.: Algebraic Topology. Dover, New York (1996)
31. C. Ronse 1988 Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images Discrete Appl. Math. 21 1 67 79
32. A. Rosenfeld 1975 A characterization of parallel thinning algorithms Inf. Control 29 286 291
33. J.H.C. Whitehead 1939 Simplicial spaces, nuclei and m-groups Proc. Lond. Math. Soc. 45 2 243 327
34. E.C. Zeeman 1964 On the dunce hat Topology 2 341 358