Optimal path: theory and models for vessel segmentation

Authors:
Jean Stawiaski
Affiliations:
Philips Healthcare, Medisys Research Laboratory, Suresnes, France
Venue:
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
Year:
2011

Citing 5
Cited 0

Fast Extraction of Tubular and Tree 3D Surfaces with Front Propagation Methods

ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 1 - Volume 1
The Image Foresting Transform: Theory, Algorithms, and Applications

IEEE Transactions on Pattern Analysis and Machine Intelligence
Graphs, Dioids and Semirings: New Models and Algorithms (Operations Research/Computer Science Interfaces Series)

Graphs, Dioids and Semirings: New Models and Algorithms (Operations Research/Computer Science Interfaces Series)
GeoS: Geodesic Image Segmentation

ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part I
Shortest distance problems in graphs using history-dependent transition costs with application to kinodynamic path planning

ACC'09 Proceedings of the 2009 conference on American Control Conference

Quantified Score

Hi-index	0.00

Visualization

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.