Anisotropic Fast Marching in ITK
logo

Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3518
The Fast Marching algorithm is an efficient numerical method for computing the distance and shortest path between points of a domain. For that purpose, it solves a front propagation problem, which can be of interest in itself. The method has numerous applications, ranging from motion planning to image segmentation. The unit of length, for computing the path length, may vary on the domain.
Motivated by applications, we generalize the algorithm to the case where the unit of length also depends on the path direction. Segmentation methods can take advantage of this flexibility to achieve greater sensitivity and specificity, for a comparable computation time.
Code
There is no code review at this time.

Reviews
There is no review at this time. Be the first to review this publication!

Quick Comments


Resources
backyellow
Download All
Download Paper , View Paper
Download Source code

Statistics more
backyellow
Global rating: starstarstarstarstar
Review rating: starstarstarstarstar [review]
Code rating:
Paper Quality: plus minus

Information more
backyellow
Categories: Distance maps, Level sets
Keywords: Fast Marching, Anisotropic
Toolkits: ITK, CMake
Export citation:

Share
backyellow
Share

Linked Publications more
backyellow
Anisotropic Diffusion in ITK Anisotropic Diffusion in ITK
by Mirebeau J., Fehrenbach J., Risser L., Tobji S.
A MultipleImageIterator for iterating over multiple images simultaneously A MultipleImageIterator for iterating over multiple images simultaneously
by Schaerer J.

View license
Loading license...

Send a message to the author
main_flat
Powered by Midas