Heuristically Driven Front Propagation for Geodesic Paths Extraction

Gabriel Peyré (1) , Laurent D. Cohen (1)

1 CEREMADE - CEntre de REcherches en MAthématiques de la DEcision

In this paper we present a simple modification of the Fast Marching algorithm to speed up the computation using a heuristic. This modification leads to an algorithm that is similar in spirit to the A* algorithm used in artificial intelligence. Using a heuristic allows to extract geodesics from a single source to a single goal very quickly and with a low memory requirement. Any application that needs to compute a lot of geodesic paths can gain benefits from our algorithm. The computational saving is even more important for 3D medical images with tubular structures and for higher dimensional data.

Mots clés: Geodesic; heuristic; Fast Marching; Front Propagation

Domaines: Traitement du signal et de l'image [eess.SP]; Traitement du signal et de l'image [eess.SP]

Gabriel Peyré, Laurent D. Cohen. Heuristically Driven Front Propagation for Geodesic Paths Extraction. Variational, Geometric, and Level Set Methods in Computer Vision (VLSM'05), Oct 2005, Beijing, China. pp.173-185, ⟨10.1007/11567646⟩. ⟨hal-00365623⟩