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

Abstract

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 multi-stencils 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, 2 stencils cover the 8-neighbors of the point, while in 3D space, 6 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.

Automated Cross-Sectional Measurement Method of Intracranial Dural Venous Sinuses

“…[20][21][22] The method was used to calculate the shortest distance from a list of points to all other voxels in the image by solving the Eikonal equation. This method gave more accurate distances by using second-order derivatives and crossneighbors.…”

Shape conforming volumetric interpolation with interior distances

“…Also, the inner distance can be defined by using other ways, for example, in terms of Eikonal equation [9] and heat flow [10]. In general, as noted in [7], the interior distance can be expressed in a continuous setting, however in practical applications usually approximations are used.…”

“…The choice of this method over other existing in current state of the art (see section 2.2) is that it is easiest in terms of implementation and as e cient as some others (e.g. [9]). …”

Segmentation of the Mandibular Canal in Cone-Beam CT Data

“…Almost all recent mandibular canal segmentation papers use Dijkstra's algorithm [98], or Fast Marching [100] to improve the location of the nerve. This are distance algorithms which are useful to calculate the shortest path between two points.…”