• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Landmark-based Geodesic Computation for Heuristically Driven Path Planning

Thumbnail
Date
2006
Link to item file
http://hal.archives-ouvertes.fr/hal-00365622/en/
Dewey
Probabilités et mathématiques appliquées
Sujet
Geodesic; heuristic; Fast Marching; Front propagation
DOI
http://dx.doi.org/http://doi.ieeecomputersociety.org/10.1109/CVPR.2006.163
Conference name
2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06)
Conference date
06-2006
Conference city
New York, NY
Conference country
États-Unis
Year
2006
URI
https://basepub.dauphine.fr/handle/123456789/457
Collections
  • CEREMADE : Publications
Metadata
Show full item record
Author
Peyré, Gabriel
Cohen, Laurent D.
Type
Communication / Conférence
Item number of pages
2229-2236
Abstract (EN)
This paper presents a new method to quickly extract geodesic paths on images and 3D meshes. We use a heuristic to drive the front propagation procedure of the classical Fast Marching. This results in a modification of the Fast Marching algorithm that is similar to the A$^*$ algorithm used in artificial intelligence. In order to find very quickly geodesic paths between any given couples of points, we advocate for the initial computation of distance maps to a set of landmark points and make use of these distance maps through a relevant heuristic. We show that our method brings a large speed up for large scale applications that require the extraction of geodesics on images and 3D meshes. We introduce two distortion metrics in order to find an optimal seeding of landmark points for the targeted applications. We also propose a compression scheme to reduce the memory requirement without impacting the quality of the extracted paths.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.