New characterizations of simple points, minimal non-simple sets and P-simple points in 2D, 3D and 4D discrete spaces

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4992 LNCS, Issue , 2008, Pages 105-116

  Couprie, Michel ^a   Bertrand, Gilles ^a  

^a UNIVERSITÉ PARIS EST   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FINITE DIFFERENCE METHOD; LARGE SCALE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

DISCRETE SPACES; EFFICIENT ALGORITHMS; NON-SIMPLE SETS (MNS);

SET THEORY;

EID: 43049121712     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79126-3_11     Document Type: Conference Paper

References (28)

1. Bertrand. G.: On P-simple points. Comptes Rendus de l'Académie des Sciences, Série Math. 1(321). 1077-1084 (1995)
2. Bertrand, G.: Sufficient conditions for 3D parallel thinning algorithms. In: SPIE Vision Geometry IV, vol. 2573, pp. 52-60 (1995)
3. Bertrand, G.: On critical kernels. Technical Report IGM,2005-05 (2005), http://www.esiee.fr/~ coupriem/ck
4. Bertrand, G.: On critical kernels. Comptes Rendus de l'Académie des Sciences. Série Math. 1(345), 363-367 (2007)
5. Bertrand, G., Couprie, M.: New 2D Parallel Thinning Algorithms Based on Critical Kernels. In: Reulke,R., Eckardt, U., Flach, B., Knauer, U., Polthier,K. (eds.) IWCIA 2006. LNCS, vol. 4040. pp. 45-59. Springer. Heidelberg (2006)
6. Bertrand, G., Couprie, M.: A new 3D parallel thinning scheme based on critical kernels. In: Kuba, A., Nyúl, L.G., Palágyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 580-591. Springer, Heidelberg (2006)
7. Bertrand, G., Couprie, M.: Two-dimensional parallel thinning algorithms based on critical kernels. Technical Report IGM,2006-02 (2006), http://www.esiee.fr/~coupriem/ck
8. Bing. R.H.: Some aspects of the topology of 3-manifolds related to the Poincaré conjecture. Lectures on modern mathematics II, 93-128 (1964)
9. Burguet, J., Malgouyres, R.: Strong thinning and polyhedric approximation of the surface of a voxel object. Discrete Applied Mathematics 125, 93-114 (2003)
10. Couprie, M.: Note on fifteen 2d parallel thinning algorithms. Technical Report IGM,2006-01 (2006), http://www.esiee.fr/~coupriem/ck
11. Couprie, M., Bertrand, G.: New characterizations, in the framework of critical kernels, of 2D, 3D and 4D minimal non-simple sets and P-simple points. Technical Report IGM2007-08 (2007), www.esiee.fr/~coupriem/ck
12. Couprie, M., Bertrand, G.: New characterizations of simple points in 2D, 3D and 4D discrete spaces. Technical Report IGM2007-07 (2007), www.esiee.fr/~coupriem/ck
13. Gau, C.-J., Kong, T.Y.: Minimal non-simple sets in 4D binary images. Graphical Models 65, 112-130 (2003)
14. Giblin, P.: Graphs, surfaces and homology. Chapman and Hall, Boca Raton (1981)
15. Hall. R.W.: Tests for connectivity preservation for parallel reduction operators. Topology and its Applications 46(3), 199-217 (1992)
16. 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)
17. Kong. T.Y.: Topology-preserving deletion of 1's from 2-. 3- and 4-dimensional binary images. In: Ahronovitz, E. (ed.) DGCI 1997. LNCS, vol. 1347, pp. 3-18. Springer, Heidelberg (1997)
18. Kong, T. Y.: Minimal non-simple and minimal non-cosimple sets in binary images on cell complexes. In: Kuba, A., Nyùl, L.G., Palágyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 169-188. Springer, Heidelberg (2006)
19. Kong, T.Y., Gau, C.-J.: Minimal non-simple sets in 4-dimensional binary images with (8-80)-adjacency. In: procs. IWCIA, pp. 318-333 (2004)
20. Kong, T.Y., Rosenfeld, A.: Digital topology: introduction and survey. Computer Vision. Graphics and Image Processing 48. 357-393 (1989)
21. Kong, T. Y.: On the problem of determining whether a parallel reduction operator for n-dimensional binary images always preserves topology. In: procs. SPIE Vision Geometry II, vol. 2060. pp. 69-77 (1993)
22. Kovalevsky, V.A.: Finite topology as applied to image analysis. Computer Vision. Graphics and Image Processing 46, 141-161 (1989)
23. Lohou, C., Bertrand, G.: A 3D 12-subiteration thinning algorithm based on P-simple points. Discrete Applied Mathematics 139, 171-195 (2004)
24. Lohou, C., Bertrand, G.: A 3D 6-subiteration curve thinning algorithm based on P-simple points. Discrete Applied Mathematics 151, 198-228 (2005)
25. Ma, C.M.: On topology preservation in 3d thinning. Computer Vision, Graphics and Image Processing 59(3), 328-339 (1994)
26. Maunder, C.R.F.: Algebraic topology. Dover, london (1996)
27. Passat, N., Couprie, M., Bertrand, G.: Minimal simple pairs in the 3-d cubic grid. Technical Report IGM2007-04 (2007)
28. Ronse, C.: Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digi tal images. Discrete Applied Mathematics 21 (1), 67-79 (1988)