A Modified Fast Marching Method

  • Per-Erik Danielsson
  • Qingfen Lin
Conference paper

DOI: 10.1007/3-540-45103-X_151

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2749)
Cite this paper as:
Danielsson PE., Lin Q. (2003) A Modified Fast Marching Method. In: Bigun J., Gustavsson T. (eds) Image Analysis. SCIA 2003. Lecture Notes in Computer Science, vol 2749. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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