A Modified Fast Marching Method

  • Per-Erik Danielsson
  • Qingfen Lin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2749)


In most, if not all fast marching methods published hitherto, the input cost function and the output arrival time are sampled on exactly the same grid. But since the input data samples are differences of the output samples we found it natural to separate the input and output grid half a sampling unit in all coordinates (two or three).We also employ 8-neighborhood (26-neighborhood in the 3D-case) in the basic updating step of the algorithm. Some simple numerical experiments verify that the modified method improves the accuracy considerably. However, we also feel the modified method leads itself more naturally to image processing applications like tracking and segmentation.


  1. 1.
    D. Adalsteinsson and J. A. Sethian. A fast level set method for propagating interfaces. Journal of Computational Physics, 118:269–277, 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, 1:269–271, 1959.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Seongjai Kim. An O(N) level set method for eikonal equations. SIAM J. Sci. Comput., 22(6):2178–2193, 2001.zbMATHCrossRefGoogle Scholar
  4. 4.
    Qingfen Lin. Enhancement, extraction, and visualization of 3D volume data. PhD thesis, Linköping University, 2003.Google Scholar
  5. 5.
    Ingemar Ragnemalm. Neighborhoods for distance transformation using ordered propagation. CVGIP-Image Understanding, 56:161–166, 1992.Google Scholar
  6. 6.
    J. A. Sethian. Level Set Methods and Fast Marching Methods. Cambridge University Press, 1999.Google Scholar
  7. 7.
    John N. Tsitsiklis. Efficient algorithm for globally optimal trajectories. IEEE Transactions on Automatic Control, 40(9):1528–1538, 1995.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Per-Erik Danielsson
    • 1
  • Qingfen Lin
    • 1
  1. 1.Computer Vision Laboratory, Dept. of Electrical EngineeringLinköping UniversitySweden

Personalised recommendations