Fast Methods for Eikonal Equations: An Experimental Survey

Fast methods are very popular algorithms to compute time-of-arrival maps (distance maps measured in time units) solving the Eikonal equation. Since fast marching was proposed in 1995, it has been applied to many different applications, such as robotics, medical computer vision, fluid simulation, and so on. From then on, many alternatives to the original method have been proposed with two main objectives: reducing its computational time and improving its accuracy. In this paper, we collect the main single-threaded approaches, which improve the computational time of the standard fast marching method and study them within a common mathematical framework. Then, they are evaluated using isotropic environments, which are representative of their possible applications. The studied methods are the fast marching method with the binary heap, the fast marching method with Fibonacci heap, the simplified fast marching method, the untidy fast marching method, the fast iterative method, the group marching method, the fast sweeping method, the locking sweeping method, and the double dynamic queue method.

[1]  Seiichi Mita,et al.  Narrow passage path planning using fast marching method and support vector machine , 2014, 2014 IEEE Intelligent Vehicles Symposium Proceedings.

[2]  Marcela Hernández Hoyos,et al.  Coronary artery segmentation and stenosis quantification in CT images with use of a right generalized cylinder model , 2012 .

[3]  Luis Moreno,et al.  The Path to Efficiency: Fast Marching Method for Safer, More Efficient Mobile Robot Trajectories , 2013, IEEE Robotics & Automation Magazine.

[4]  Maurizio Falcone,et al.  Can Local Single-Pass Methods Solve Any Stationary Hamilton-Jacobi-Bellman Equation? , 2013, SIAM J. Sci. Comput..

[5]  Ross T. Whitaker,et al.  A Fast Iterative Method for Eikonal Equations , 2008, SIAM J. Sci. Comput..

[6]  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.

[7]  Luis Moreno,et al.  Fast Marching-based globally stable motion learning , 2015, Soft Computing.

[8]  Yi Lin,et al.  Online Safe Trajectory Generation for Quadrotors Using Fast Marching Method and Bernstein Basis Polynomial , 2018, 2018 IEEE International Conference on Robotics and Automation (ICRA).

[9]  Christian Rasch,et al.  Remarks on the O(N) Implementation of the Fast Marching Method , 2007, ArXiv.

[10]  Ronen Basri,et al.  Curve Matching Using the Fast Marching Method , 2003, EMMCVPR.

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

[12]  J. Sethian.  AN ANALYSIS OF FLAME PROPAGATION , 1982 .

[13]  James A. Sethian,et al.  3-D imaging using higher order fast marching traveltimes , 2002 .

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

[15]  A. Vladimirsky,et al.  First-break traveltime tomography with the double-square-root eikonal equation , 2013 .

[16]  Eran Treister,et al.  A fast marching algorithm for the factored eikonal equation , 2016, J. Comput. Phys..

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

[18]  Stanley Bak,et al.  Some Improvements for the Fast Sweeping Method , 2010, SIAM J. Sci. Comput..

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

[20]  Fei Wang,et al.  A new ray tracing technique for crosshole radar traveltime tomography based on multistencils fast marching method and the steepest descend method , 2014, Proceedings of the 15th International Conference on Ground Penetrating Radar.

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

[22]  Marco Pavone,et al.  Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions , 2013, ISRR.

[23]  A. Capozzoli,et al.  A comparison of Fast Marching, Fast Sweeping and Fast Iterative Methods for the solution of the eikonal equation , 2013, 2013 21st Telecommunications Forum Telfor (TELFOR).

[24]  J. Sethian,et al.  FRONTS PROPAGATING WITH CURVATURE DEPENDENT SPEED: ALGORITHMS BASED ON HAMILTON-JACOB1 FORMULATIONS , 2003 .

[25]  W. Linehan,et al.  Computer-aided renal cancer quantification and classification from contrast-enhanced CT via histograms of curvature-related features , 2009, 2009 Annual International Conference of the IEEE Engineering in Medicine and Biology Society.

[26]  Emilio Frazzoli,et al.  Planning for Optimal Feedback Control in the Volume of Free Space , 2015, ArXiv.

[27]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods , 1999 .

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

[29]  Bram van Ginneken,et al.  Comparative study of retinal vessel segmentation methods on a new publicly available database , 2004, SPIE Medical Imaging.

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

[31]  E. Rouy,et al.  A viscosity solutions approach to shape-from-shading , 1992 .

[32]  Ron Kimmel,et al.  Fast Marching Methods , 2004 .

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

[34]  Marco Pavone,et al.  Fast Marching Trees: A Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions , 2013, ISRR.

[35]  W. Jeong.  UUCS-07-010 A Fast Iterative Method for a Class of Hamilton-Jacobi Equations on Parallel Systems , 2007 .

[36]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[37]  Abdulkerim Çapar,et al.  Concurrent Segmentation and Recognition with Shape-Driven Fast Marching Methods , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[38]  Hongkai Zhao,et al.  Fast sweeping method for the factored eikonal equation , 2009, J. Comput. Phys..

[39]  Juan Andrade-Cetto,et al.  Planning Reliable Paths With Pose SLAM , 2013, IEEE Transactions on Robotics.

[40]  Stanley Bak,et al.  A Third Order Accurate Fast Marching Method for the Eikonal Equation in Two Dimensions , 2011, SIAM J. Sci. Comput..

[41]  Thomas Porter,et al.  Random insertion into a priority queue structure , 1974, IEEE Transactions on Software Engineering.

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

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

[44]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[45]  Rolf Krause,et al.  A Massive Parallel Fast Marching Method , 2016 .

[46]  Yuanchang Liu,et al.  Path planning algorithm for unmanned surface vehicle formations in a practical maritime environment , 2015 .

[47]  Emilio Frazzoli,et al.  Asymptotically optimal feedback planning using a numerical Hamilton-Jacobi-Bellman solver and an adaptive mesh refinement , 2016, Int. J. Robotics Res..

[48]  Laurent D. Cohen,et al.  Image compression with anisotropic triangulations , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[49]  Jakob Andreas Bærentzen,et al.  3D distance fields: a survey of techniques and applications , 2006, IEEE Transactions on Visualization and Computer Graphics.

[50]  Karl Rohr,et al.  Globally Optimal Curvature-Regularized Fast Marching for Vessel Segmentation , 2013, MICCAI.

[51]  Xiaoning Zhang,et al.  Fast Marching Method Seismic Traveltimes with Reconfigurable Field Programmable Gate Arrays , 2011 .

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

[53]  Keenan Crane,et al.  Geodesics in heat: A new approach to computing distance based on heat flow , 2012, TOGS.

[54]  Wolfram Burgard,et al.  A Tutorial on Graph-Based SLAM , 2010, IEEE Intelligent Transportation Systems Magazine.

[55]  Ross T. Whitaker,et al.  A Fast Iterative Method for Solving the Eikonal Equation on Triangulated Surfaces , 2011, SIAM J. Sci. Comput..

[56]  Nuwan Madusanka,et al.  Comparison of active contour and fast marching methods of hippocampus segmentation , 2015, 2015 6th International Conference on Information and Communication Systems (ICICS).

[57]  Tariq Alkhalifah,et al.  A fast sweeping algorithm for accurate solution of the tilted transversely isotropic eikonal equation using factorization , 2017 .

[58]  Adam Chacon.  Eikonal Equations: New Two-Scale Algorithms And Error Analysis , 2014 .

[59]  Christian Gout,et al.  Generalized fast marching method: applications to image segmentation , 2008, Numerical Algorithms.

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

[61]  Frédéric Gibou,et al.  A parallel fast sweeping method for the Eikonal equation , 2013, J. Comput. Phys..

[62]  Daniel Racoceanu,et al.  Reconstructing neuronal morphology from microscopy stacks using fast marching , 2014, 2014 IEEE International Conference on Image Processing (ICIP).

[63]  Ken Museth,et al.  VDB: High-resolution sparse volumes with dynamic topology , 2013, TOGS.

[64]  R. Bellman.  Dynamic programming. , 1957, Science.

[65]  Yan Pailhas,et al.  Path Planning for Autonomous Underwater Vehicles , 2007, IEEE Transactions on Robotics.

[66]  Eran Treister,et al.  Full Waveform Inversion Guided by Travel Time Tomography , 2016, SIAM J. Sci. Comput..