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.
Chapter PDF
References
Adalsteinsson, D., Sethian, J.A.: A fast level set method for propagating interfaces. Journal of Computational Physics 118(2), 269–277 (1995)
Born, M., Wolf, E.: Principles of Optics, 6th edn. Pergamon Press, Oxford (1980)
Danielsson, P.-E., Lin, Q.: A modified fast marching method. In: Bigun, J., Gustavsson, T. (eds.) SCIA 2003. LNCS, vol. 2749, pp. 1154–1161. Springer, Heidelberg (2003)
Fouard, C., Gedda, M.: An Objective Comparison Between Gray Weighted Distance Transforms and Weighted Distance Transforms on Curved Spaces. In: Kuba, A., Nyúl, L.G., Palágyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 259–270. Springer, Heidelberg (2006)
Meijering, E., Jacob, M., Sarria, J.-C.F., Steiner, P., Hirling, H., Unser, M.: Design and validation of a tool for neurite tracing and analysis in fluorescence microscopy images. Cytometry 58A(2), 167–176 (2004)
Saha, P.K., Wehrli, F.W., Gomberg, B.R.: Fuzzy distance transform: Theory, algorithms, and applications. Computer Vision and Image Understanding 86(3), 171–190 (2002)
Toivanen, P.J.: New geodesic distance transforms for gray-scale images. Pattern Recognition Letters 17(5), 437–450 (1996)
Tsitsiklis, J.N.: Efficient algorithms for globally optimal trajectories. IEEE Transactions on Automatic Control 40(9), 1528–1538 (1995)
Verbeek, P.W., Verwer, B.J.H.: Shading from shape, the eikonal equation solved by grey-weighted distance transform. Pattern Recognition Letters 11, 681–690 (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
van Heekeren, R.J., Faas, F.G.A., van Vliet, L.J. (2007). Finding the Minimum-Cost Path Without Cutting Corners. In: Ersbøll, B.K., Pedersen, K.S. (eds) Image Analysis. SCIA 2007. Lecture Notes in Computer Science, vol 4522. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73040-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-73040-8_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73039-2
Online ISBN: 978-3-540-73040-8
eBook Packages: Computer ScienceComputer Science (R0)