Finding the minimum-cost path without cutting corners

Authors:
R. Joop Van Heekeren;Frank G. A. Faas;Lucas J. Van Vliet
Affiliations:
Quantitative Imaging Group, Delft University of Technology, The Netherlands;Quantitative Imaging Group, Delft University of Technology, The Netherlands;Quantitative Imaging Group, Delft University of Technology, The Netherlands
Venue:
SCIA'07 Proceedings of the 15th Scandinavian conference on Image analysis
Year:
2007

Citing 6
Cited 0

Shading from shape, the eikonal equation solved by grey-weighted distance transform

Pattern Recognition Letters
A fast level set method for propagating interfaces

Journal of Computational Physics
New geodesic distance transforms for gray-scale images

Pattern Recognition Letters
Fuzzy distance transform: theory, algorithms, and applications

Computer Vision and Image Understanding
A modified fast marching method

SCIA'03 Proceedings of the 13th Scandinavian conference on Image analysis
An objective comparison between gray weighted distance transforms and weighted distance transforms on curved spaces

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.00

Visualization

Abstract

Applying a minimum-cost path algorithm to find the path through the bottom of a curvilinear valley yields a biased path through the inside of a corner. DNA molecules, blood vessels, and neurite tracks are examples of string-like (network) structures, whose minimum-cost path is cutting through corners and is less flexible than the underlying centerline. Hence, the path is too short and its shape too stiff, which hampers quantitative analysis. We developed a method which solves this problem and results in a path whose distance to the true centerline is more than an order of magnitude smaller in areas of high curvature. We first compute an initial path. The principle behind our iterative algorithm is to deform the image space, using the current path in such a way that curved string-like objects are straightened before calculating a new path. A damping term in the deformation is needed to guarantee convergence of the method.