Anisotropic Fast Marching in ITK
Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3518
New: Prefer using the following doi: https://doi.org/10.54294/zebu4m
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.