Fully isotropic fast marching methods on Cartesian grids
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part I
Fully isotropic fast marching methods on cartesian grids
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part VI
MICCAI'10 Proceedings of the 2010 international conference on Prostate cancer imaging: computer-aided diagnosis, prognosis, and intervention
An application of circumscribed circle filter in the Multi-Stencils Fast Marching method
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Gradient competition anisotropy for centerline extraction and segmentation of spinal cords
IPMI'13 Proceedings of the 23rd international conference on Information Processing in Medical Imaging
| Hi-index | 0.14 |
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.