Abstract
We present an overview of part of our work on minimal paths. Introduced first in order to find the global minimum of active contours’ energy using Fast Marching [210], we have then used minimal paths for finding multiple contours for contour completion from points or curves in 2D or 3D images. Some variations allow to decease computation time, make easier initialization and centering a path in a tubular structure. Fast Marching is also an efficient way to solve balloon model evolution using level sets. We show applications like for road and vessel segmentation and for virtual endoscopy.
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.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Cohen, L. (2006). Minimal Paths and Fast Marching Methods for Image Analysis. In: Paragios, N., Chen, Y., Faugeras, O. (eds) Handbook of Mathematical Models in Computer Vision. Springer, Boston, MA. https://doi.org/10.1007/0-387-28831-7_6
Download citation
DOI: https://doi.org/10.1007/0-387-28831-7_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-26371-7
Online ISBN: 978-0-387-28831-4
eBook Packages: Computer ScienceComputer Science (R0)