A modified fast marching method
2003 (English)In: Image Analysis: 13th Scandinavian Conference, SCIA 2003 Halmstad, Sweden, June 29 – July 2, 2003 Proceedings / [ed] Josef Bigun and Tomas Gustavsson, Springer Berlin/Heidelberg, 2003, Vol. 2749, 1154-1161 p.Chapter in book (Refereed)
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.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2003. Vol. 2749, 1154-1161 p.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 2749
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-48581DOI: 10.1007/3-540-45103-X_151ISBN: 3-540-40601-8ISBN: 978-3-540-45103-7ISBN: 978-3-540-40601-3OAI: oai:DiVA.org:liu-48581DiVA: diva2:269477