A new 3D parallel thinning scheme based on critical kernels

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

Volumn 4245 LNCS, Issue , 2006, Pages 580-591

  Bertrand, Gilles ^a   Couprie, Michel ^a  

^a Université de Marne la Vallée   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; PARALLEL ALGORITHMS;

ABSTRACT COMPLEXES; CRITICAL KERNELS; PARALLEL THINNING;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 33845201799     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11907350_49     Document Type: Conference Paper

References (24)

1. Rutovitz, D.: Pattern recognition. Journal of the Royal Statistical Society 129 (1966) 504-530
2. Tsao, Y., Fu, K.: A parallel thinning algorithm for 3d pictures. CGIP 17(4) (1981) 315-331
3. Saha, P., Chaudhuri, B., Dutta, D., Majumder, D.: A new shape-preserving parallel thinning algorithm for 3d digital images. PR 30(12) (1997) 1939-1955
4. Bertrand, G.: A parallel thinning algorithm for medial surfaces. PRL 16 (1995) 979-986
5. Gong, W., Bertrand, G.: A simple parallel 3d thinning algorithm. In: ICPR90. (1990) 188-190
6. Ma, C.M.: A 3d fully parallel thinning algorithm for generating medial faces. Pattern Recogn. Lett. 16(1) (1995) 83-87 FILE=ma1995.pdf.
7. Manzanera, A., Bernard, T., Prêteux, F., Longuet, B.: N-dimensional skeletonization: a unified mathematical framework. Journal of Electronic Imaging 11(1) (2002) 25-37
8. Ma, C.M., Sonka, M.: A 3d fully parallel thinning algorithm and its applications. Computer Vision and Image Understanding 64(3) (1996) 420-433
9. Palágyi, K., Kuba, A.: A 3d 6-subiteration thinning algorithm for extracting medial lines. Pattern Recognition Letters (19) (1998) 613-627
10. Palágyi, K., Kuba, A.: A parallel 3d 12-subiteration thinning algorithm. Graphical Models and Image Processing (61) (1999) 199-221
11. Lohou, C., Bertrand, G.: A 3d 12-subiteration thinning algorithm based on p-simple points. Discrete Applied Mathematics 139 (2004) 171-195
12. Lohou, C., Bertrand, G.: A 3d 6-subiteration curve thinning algorithm based on p-simple points. Discrete Applied Mathematics 151 (2005) 198-228
13. Kong, T.Y.: On topology preservation in 2-d and 3-d thinning. International Journal on Pattern Recognition and Artificial Intelligence 9 (1995) 813-844
14. Bertrand, G.: On P-simple points. Comptes Rendus de l'Académie des Sciences, Série Math. 1(321) (1995) 1077-1084
15. Bertrand, G.: On critical kernels. Internal Report, Université de Marne-la-Vallée IGM2005-05 (2005) Also submitted for publication.
16. Bertrand, G., Couprie, M.: Two-dimensional parallel thinning algorithms based on critical kernels. Internal Report, Université de Marne-la-Vallée IGM2006-02 (2006) Also submitted for publication.
17. Kong, T.Y., Rosenfeld, A.: Digital topology, introduction and survey. Comp. Vision, Graphics and Image Proc. 48 (1989) 357-393
18. Kovalevsky, V.: Finite topology as applied to image analysis. Computer Vision, Graphics and Image Processing 46 (1989) 141-161
19. Giblin, P.: Graphs, surfaces and homology. Chapman and Hall (1981)
20. Kong, T.Y.: Topology-preserving deletion of 1's from 2-, 3- and 4-dimensional binary images. In: Lecture Notes in Computer Science. Volume 1347. (1997) 3-18
21. Bertrand, G.: Simple points, topological numbers and geodesic neighborhoods in cubic grids. Pattern Recognition Letters 15 (1994) 1003-1011
22. Bertrand, G., Malandain, G.: A new characterization of threedimensional simple points. Pattern Recognition Letters 15(2) (1994) 169-175
23. Saha, P., Chaudhuri, B., Chanda, B., Dutta Majumder, D.: Topology preservation in 3d digital space. PR 27 (1994) 295-300
24. Rosenfeld, A., Pfaltz, J.: Sequential operations in digital picture processing. Journal of the Association for Computer Machinery 13 (1966) 471-494