Exact euclidean medial axis in higher resolution

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

Volumn 4245 LNCS, Issue , 2006, Pages 605-616

  Saúde, André Vital ^a,b   Couprie, Michel ^b   Lotufo, Roberto ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; IMAGE RECONSTRUCTION;

EXACT EUCLIDEAN MEDIAL AXIS; HOMOTOPIC SKELETONS; SHAPE ANALYSIS;

COMPUTATIONAL GEOMETRY;

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

References (22)

1. Blum, H.: An associative machine for dealing with the visual field and some of its biological implications. Biological prototypes and synthetic systems 1 (1961) 244-260
2. Davies, E., Plummer, A.: Thinning algorithms: a critique and a new methodology. Pattern Recognition 14 (1981) 53-63
3. Talbot, H., Vincent, L.: Euclidean skeletons and conditional bisectors. In: Procs. VCIP'92, SPIE. Volume 1818. (1992) 862-876
4. Couprie, M., Coeurjolly, D., Zrour, R.: Discrete bisector function and euclidean skeleton in 2d and 3d. Image and Vision Computing (2006) accepted.
5. Bertrand, G.: Skeletons in derived grids. In: procs. Int. Conf. Patt. Recogn. (1984) 326-329
6. Kovalevsky, V.: Finite topology as applied to image analysis. Computer Vision, Graphics and Image Processing 48 (1989) 141-161
7. Khalimsky, E., Kopperman, R., Meyer, P.: Computer graphics and connected topologies on finite ordered sets. Topology and its Applications 38 (1990) 1-17
8. Kong, T.Y., Kopperman, R., Meyer, P.: A topological approach to digital topology. American Mathematical Monthly 38 (1991) 901-917
9. Bertrand, G.: New notions for discrete topology. In: procs. DGCI, LNCS, Springer Verlag. Volume 1568. (1999) 216-226
10. Bertrand, G., Couprie, M.: New 3d parallel thinning algorithms based on critical kernels. In Kuba, A., Palágyi, K., Nyúl, L., eds.: DGCI. LNCS, Springer (2006)
11. Danielsson, P.: Euclidean distance mapping. Computer Graphics and Image Processing 14 (1980) 227-248
12. Meyer, F.: Cytologie quantitative et morphologie mathématique. PhD thesis, École des Mines de Paris, France (1979)
13. Saito, T., Toriwaki, J.: New algorithms for euclidean distance transformation of an n-dimensional digitized picture with applications. Pattern Recognition 27 (1994) 1551-1565
14. Hirata, T.: A unified linear-time algorithm for computing distance maps. Information Processing Letters 58(3) (1996) 129-133
15. Meijster, A., Roerdink, J., Hesselink, W.: A general algorithm for computing distance transforms in linear time, In J. Goutsias, L.V., Bloomberg, D., eds.: Mathematical morphology and its applications to image and signal processing 5th. Volume 18 of Computational Imaging and Vision., Kluwer Academic Publishers (2000) 331-340
16. Rémy, E., Thiel, E.: Look-up tables for medial axis on squared Euclidean distance transform. In: procs. DGCI, LNCS, Springer Verlag. Volume 2886. (2003) 224-235
17. Cœurjolly, D.: d-dimensional reverse Euclidean distance transformation and Euclidean medial axis extraction in optimal time. In: procs. DGCI, LNCS, Springer Verlag. Volume 2886. (2003) 327-337
18. Rémy, E., Thiel, E.: Exact medial axis with euclidean distance. Image and Vision Computing 23(2) (2005) 167-175
19. Saúde, A.V., Couprie, M., Lotufo, R.: Exact Euclidean medial axis in higher resolution. Technical Report IGM2006-5, IGM, Université de Marne-la-vallée (2006)
20. Borgefors, G., Ragnemalm, I., di Baja, G.S.: The Euclidean Distance Transform: finding the local maxima and reconstructing the shape. In: Seventh Scandinavian Conference on Image Analysis. Volume 2., Aalborg, Denmark (1991) 974-981
21. Hardy, G., Wright, E.: An Introduction to the Theory of Numbers. 5th edn. Oxford University Press (1978)
22. Couprie, M., Saúde, A.V., Bertrand, G.: Euclidean homotopic skeleton based on critical kernels. In: Procs. SIBGRAPI. (2006) to appear.