Heuristically Driven Front Propagation for Geodesic Paths Extraction

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. 80%60%40%Heuristic=0% 90% 100%Coarse mesh

• Type: Conference
• Year: 2005
• Where: VLSM
• Authors: Gabriel Peyré, Laurent D. Cohen
• Keywords: Algorithm, A∗ Algorithm, Computer Vision, Fast Marching Algorithm, VLSM 2005