The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
Osher, S., & Sethian, J. A. (1988) · Journal of Computational Physics · doi:10.1016/0021-9991(88)90002-2 · Cited by 14,062
Godunov, S. K., & Bohachevsky, I. O. (1959) · HAL · Cited by 1,829
An Image Inpainting Technique Based on the Fast Marching Method
Telea, A. (2004) · Journal of Graphics Tools · doi:10.1080/10867651.2004.10487596 · Cited by 1,421
A Fast Level Set Method for Propagating Interfaces
Adalsteinsson, D., & Sethian, J. A. (1995) · Journal of Computational Physics · doi:10.1006/jcph.1995.1098 · Cited by 1,326
Computing geodesic paths on manifolds
Kimmel, R., & Sethian, J. A. (1998) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.95.15.8431 · Cited by 1,049
Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
Sethian, J. A., & Vladimirsky, A. (2003) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142901392742 · Cited by 366
Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes
Sethian, J. A., & Vladimirsky, A. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.090060097 · Cited by 307
O(N) implementation of the fast marching algorithm
Yatziv, L., Bartesaghi, A., & Sapiro, G. (2006) · Journal of Computational Physics · doi:10.1016/j.jcp.2005.08.005 · Cited by 227
Optimal Algorithm for Shape from Shading and Path Planning
Kimmel, R., & Sethian, J. A. (2001) · Journal of Mathematical Imaging and Vision · doi:10.1023/a:1011234012449 · Cited by 207
Cited by
Blood vessel segmentation algorithms — Review of methods, datasets and evaluation metrics
Moccia, S., De Momi, E., El Hadji, S., & Mattos, L. S. (2018) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2018.02.001 · Cited by 567
Tortuosity of porous media: Image analysis and physical simulation
Fu, J., Thomas, H. R., & Li, C. (2021) · Earth-Science Reviews · doi:10.1016/j.earscirev.2020.103439 · Cited by 292
Metadata
- Authors
- Hassouna, M. S., & Farag, A. A.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2007-09
- Volume
- 29
- Issue
- 9
- Pages
- 1563-1574
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2129438083
- Cited by
- 323
- References
- 12
- FWCI
- 5.67
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: MultiStencils Fast Marching Methods: A Highly Accurate Solution to the Eikonal Equation on Cartesian Domains. https://app.cochat.ai/papers/10.1109/tpami.2007.1154
- The paper
- Hassouna, M. S., & Farag, A. A. (2007). MultiStencils Fast Marching Methods: A Highly Accurate Solution to the Eikonal Equation on Cartesian Domains. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2007.1154
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.