Geodesic Methods for Shape and Surface Processing
Peyré, Gabriel; Cohen, Laurent D. (2009), Geodesic Methods for Shape and Surface Processing, in Tavares, João Manuel R.S.; Jorge, R.M. Natal, Advances in Computational Vision and Medical Image Processing: Methods and Applications, Computational Methods in Applied Sciences, p. 29-56. 10.1007/978-1-4020-9086-8_2
External document linkhttps://hal.archives-ouvertes.fr/hal-00365899
Book titleAdvances in Computational Vision and Medical Image Processing: Methods and Applications
Book authorTavares, João Manuel R.S.; Jorge, R.M. Natal
MetadataShow full item record
Abstract (EN)This paper reviews both the theory and practice of the numerical computation of geodesic distances on Riemannian manifolds. The notion of Riemannian manifold allows to define a local metric (a symmetric positive tensor field) that encodes the information about the problem one wishes to solve. This takes into account a local isotropic cost (whether some point should be avoided or not) and a local anisotropy (which direction should be preferred). Using this local tensor field, the geodesic distance is used to solve many problems of practical interest such as segmentation using geodesic balls and Voronoi regions, sampling points at regular geodesic distance or meshing a domain with geodesic Delaunay triangles. The shortest path for this Riemannian distance, the so-called geodesics, are also important because they follow salient curvilinear structures in the domain. We show several applications of the numerical computation of geodesic distances and shortest paths to problems in surface and shape processing, in particular segmentation, sampling, meshing and comparison of shapes.
Subjects / KeywordsFast Marching; surface; medical image processing; Geodesics; remeshing; snakes; active contours; segmentation
Showing items related by title and author.
Ion, Adrian; Peyré, Gabriel; Haxhimusa, Yll; Peltier, Samuel; Kropatsch, Walter G.; Cohen, Laurent D. (2007) Communication / Conférence