- 4113 users, 635 publications, 769 reviews -
Implementation of graph-based interactive 3D vessel segmentation filter
|Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3183|
Submitted by Moti Freiman on 07-18-2010.
This paper describes an ITK implementation of a 3D vascular segmentation filter using a graph-based energy minimization algorithm. The method first computes the shortest path between two user provided points in the vessel and then performs a graph min-cut based segmentation of the vessel based on the intensity information coupled with the computed path as a spatial constraint. The shortest path computation is adapted from the algorithm in  to use a vesselness based weighting function. The min-cut algorithm uses the Boost graph library to calculate the minimal cut. Several examples of applications are provided, along with images of the resulting segmentations.
Automatic Testing Results by Insight-Journal Dashboard on Mon Jul 19 08:25:18 2010 for revision #1
expertise: 5 sensitivity: 5
|Download Paper , View Paper|
|Download Source code|
|Categories:||Mixture of densities, Optimization, Probability, Segmentation|
|Keywords:||Vessels segmentation, graph min-cut|
Linked Publications more
A Label Geometry Image Filter for Multiple Object Measurement
by Padfield D., Miller J.
Diffeomorphic Demons Using ITK's Finite Difference Solver Hierarchy
by Vercauteren T., Pennec X., Perchant A., Ayache N.
Send a message to the author