MultiStencils Fast Marching Methods: A Highly Accurate Solution to the Eikonal Equation on Cartesian Domains

A wide range of computer vision applications require an accurate solution of a particular Hamilton-Jacobi (HJ) equation known as the Eikonal equation. In this paper, we propose an improved version of the fast marching method (FMM) that is highly accurate for both 2D and 3D Cartesian domains. The new method is called multistencils fast marching (MSFM), which computes the solution at each grid point by solving the Eikonal equation along several stencils and then picks the solution that satisfies the upwind condition. The stencils are centered at each grid point and cover its entire nearest neighbors. In 2D space, two stencils cover 8-neighbors of the point, whereas in 3D space, six stencils cover its 26-neighbors. For those stencils that are not aligned with the natural coordinate system, the Eikonal equation is derived using directional derivatives and then solved using higher order finite difference schemes. The accuracy of the proposed method over the state-of-the-art FMM-based techniques has been demonstrated through comprehensive numerical experiments.

[1]  J. Vidale.  Finite‐difference calculation of traveltimes in three dimensions , 1990 .

[2]  Alfred M. Bruckstein,et al.  Shape offsets via level sets , 1993, Comput. Aided Des..

[3]  Hongkai Zhao,et al.  Fast Sweeping Methods for Eikonal Equations on Triangular Meshes , 2007, SIAM J. Numer. Anal..

[4]  Christopher M. Kuster,et al.  Computational Study of Fast Methods for the Eikonal Equation , 2005, SIAM J. Sci. Comput..

[5]  Kaleem Siddiqi,et al.  Flux driven fly throughs , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[6]  Hongkai Zhao,et al.  A Fast Sweeping Method for Static Convex Hamilton–Jacobi Equations , 2007, J. Sci. Comput..

[7]  Aly A. Farag,et al.  Accurate Tracking of Monotonically Advancing Fronts , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[8]  Aly A. Farag,et al.  Robust centerline extraction framework using level sets , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[9]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[10]  I. Bohachevsky,et al.  Finite difference method for numerical computation of discontinuous solutions of the equations of fluid dynamics , 1959 .

[11]  Alexander Vladimirsky,et al.  Ordered Upwind Methods for Static Hamilton-Jacobi Equations: Theory and Algorithms , 2003, SIAM J. Numer. Anal..

[12]  Stanley Osher,et al.  Fast Sweeping Algorithms for a Class of Hamilton-Jacobi Equations , 2003, SIAM J. Numer. Anal..

[13]  Aly A. Farag,et al.  A shape-based segmentation approach: an improved technique using level sets , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[14]  Seongjai Kim,et al.  An O(N) Level Set Method for Eikonal Equations , 2000, SIAM J. Sci. Comput..

[15]  J A Sethian,et al.  Computing geodesic paths on manifolds. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[16]  Hongkai Zhao,et al.  High Order Fast Sweeping Methods for Static Hamilton–Jacobi Equations , 2006, J. Sci. Comput..

[17]  David L. Chopp,et al.  Some Improvements of the Fast Marching Method , 2001, SIAM J. Sci. Comput..

[18]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[19]  William W. Symes,et al.  Upwind finite-difference calculation of traveltimes , 1991 .

[20]  S. Osher,et al.  Algorithms Based on Hamilton-Jacobi Formulations , 1988 .

[21]  Hongkai Zhao,et al.  A fast sweeping method for Eikonal equations , 2004, Math. Comput..

[22]  Marko Subasic,et al.  Level Set Methods and Fast Marching Methods , 2003 .

[23]  D. Lee,et al.  Skeletonization via Distance Maps and Level Sets , 1995 .

[24]  Benoit M. Dawant,et al.  Registration of medical images using an interpolated closest point transform: method and validation , 2003, SPIE Medical Imaging.

[25]  Guillermo Sapiro,et al.  O(N) implementation of the fast marching algorithm , 2006, Journal of Computational Physics.

[26]  S. Osher,et al.  Lax-Friedrichs sweeping scheme for static Hamilton-Jacobi equations , 2004 .

[27]  Stanley Osher,et al.  Fast Sweeping Methods for Static Hamilton-Jacobi Equations , 2004, SIAM J. Numer. Anal..

[28]  B. MERRIMANz,et al.  A SIMPLE LEVEL SET METHOD FOR SOLVING STEFANPROBLEMS , 1997 .

[29]  Seongjai Kim.  ENO‐DNO‐PS: A stable, second‐order accuracy eikonal solver , 1999 .

[30]  Qingfen Lin,et al.  A Modified Fast Marching Method , 2003, SCIA.

[31]  Ron Kimmel,et al.  Optimal Algorithm for Shape from Shading and Path Planning , 2001, Journal of Mathematical Imaging and Vision.

[32]  P. Podvin,et al.  Finite difference computation of traveltimes in very contrasted velocity models: a massively parallel approach and its associated tools , 1991 .

[33]  J. Sethian,et al.  Fast methods for the Eikonal and related Hamilton- Jacobi equations on unstructured meshes. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[34]  S. Osher,et al.  A Simple Level Set Method for Solving Stefan Problems , 1997, Journal of Computational Physics.

[35]  Aly A. Farag,et al.  Robust robotic path planning using level sets , 2005, IEEE International Conference on Image Processing 2005.

[36]  Alexandru Telea,et al.  An Image Inpainting Technique Based on the Fast Marching Method , 2004, J. Graphics, GPU, & Game Tools.

[37]  J. Tsitsiklis,et al.  Efficient algorithms for globally optimal trajectories , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[38]  J. Sethian,et al.  A Fast Level Set Method for Propagating Interfaces , 1995 .

[39]  Laurent D. Cohen,et al.  Fast extraction of tubular and tree 3D surfaces with front propagation methods , 2002, Object recognition supported by user interaction for service robots.