Abstract
This paper describes methods for vessel segmentation based on optimal paths. First, we recall a suitable algebraic framework for the optimal path problem on graphs through Path Algebra. We detail several popular models used for vessel segmentation and point out their limitations. Secondly, we present an extension of paths algebra which allows to solve constrained dynamic path problems. As examples, we detail an optimal path model with curvature constraints and one with dynamic time dependent costs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gondran, M., Minoux, M.: Graphs dioids and semirings, new models and algorithms. Operations Research Computer Science Interfaces Series. Springer, Heidelberg (2008)
Meyer, F.: Grey-weighted, ultrametric and lexicographical distances. In: Computational Imaging and Vision, Mathematical Morphology: 40 Years On. Proceedings of the 7th International Symposium on Mathematical Morphology, vol. 30, pp. 289–298 (2005)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)
Lesage, D., Angelini, E.D., Funka-Lea, G., Bloch, I.: A review of 3D vessel lumen segmentation techniques: Models, features and extraction schemes. Medical Image Analysis 13, 819–845 (2009)
Krause, M., Alles, R.M., Burgeth, B., Weickert, J.: Retinal vessel detection via second derivative of local radon transform. Technical Report No. 212, Department of Mathematics, Saarland University, Saarbrucken, Germany (2008)
Florent, R.: Image processing method and system, and medical examination apparatus for extracting a path following a threadlike structure in an image. European Patent (1999)
Deschamps, T., Cohen, L.D.: Fast extraction of tubular and tree 3d surfaces with front propagation methods. In: International Conference on Pattern Recognition, pp. 731–734 (2002)
Cowlagi, R.V., Tsiotras, P.: Shortest distance problems in graphs using history-dependent transition costs with application to kinodynamic path planning. In: Proceedings of the 2009 Conference on American Control Conference (2009)
Windheuser, T., Schoenemann, T., Cremers, D.: Beyond connecting the dots: A polynomial-time algorithm for segmentation and boundary estimation with imprecise user input. In: IEEE International Conference on Computer Vision, ICCV (2009)
Schoenemann, T., Cremers, D.: Globally optimal image segmentation with an elastic shape prior. In: IEEE International Conference on Computer Vision, ICCV (2007)
Lerallut, R., Boehm, M., Decencière, E., Meyer, F.: Image processing using morphological amoebas. In: Proceedings of the 5th International Symposium on Mathematical Morphology. Kluwers Academic Publishers, Dordrecht (2005)
Falcao, A.X., Stolfi, J., Lotufo, R.: The image foresting transform: Theory, algorithms, and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 19–29 (2004)
Criminisi, A., Sharp, T., Blake, A.: GeoS: Geodesic image segmentation. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part I. LNCS, vol. 5302, pp. 99–112. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stawiaski, J. (2011). Optimal Path: Theory and Models for Vessel Segmentation. In: Soille, P., Pesaresi, M., Ouzounis, G.K. (eds) Mathematical Morphology and Its Applications to Image and Signal Processing. ISMM 2011. Lecture Notes in Computer Science, vol 6671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21569-8_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-21569-8_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21568-1
Online ISBN: 978-3-642-21569-8
eBook Packages: Computer ScienceComputer Science (R0)