Heuristically Driven Front Propagation for Geodesic Paths Extraction - Archive ouverte HAL Access content directly
Conference Papers Year : 2005

Heuristically Driven Front Propagation for Geodesic Paths Extraction

Abstract

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.
Fichier principal
Vignette du fichier
05-VLSM-PeyreCohen-HeuristicFM.pdf (4.18 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00365623 , version 1 (03-03-2009)

Identifiers

Cite

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⟩
159 View
181 Download

Altmetric

Share

Gmail Facebook X LinkedIn More