Tree Shape Priors with Connectivity Constraints Using Convex Relaxation on General Graphs

In this work we propose a novel method to include a connectivity prior into image segmentation that is based on a binary labeling of a directed graph, in this case a geodesic shortest path tree. Specifically we make two contributions: First, we construct a geodesic shortest path tree with a distance...

Full description

Saved in:
Bibliographic Details
Main Authors: Stuhmer, Jan, Schroder, Peter, Cremers, Daniel
Format: Conference Proceeding
Language:English
Subjects:
Algorithms
Approximation algorithms
Biomedical imaging
Blood vessels
Computer vision
Convex functions
Elongated structure
Graphs
Image segmentation
Labeling
Medical Imaging
Optimization
Segmentation
Shortest-path problems
Topology
Trees
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this work we propose a novel method to include a connectivity prior into image segmentation that is based on a binary labeling of a directed graph, in this case a geodesic shortest path tree. Specifically we make two contributions: First, we construct a geodesic shortest path tree with a distance measure that is related to the image data and the bending energy of each path in the tree. Second, we include a connectivity prior in our segmentation model, that allows to segment not only a single elongated structure, but instead a whole connected branching tree. Because both our segmentation model and the connectivity constraint are convex a global optimal solution can be found. To this end, we generalize a recent primal-dual algorithm for continuous convex optimization to an arbitrary graph structure. To validate our method we present results on data from medical imaging in angiography and retinal blood vessel segmentation.
ISSN:1550-5499
2380-7504
DOI:10.1109/ICCV.2013.290