
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 |
Published in The Insight Journal - 2010 July-December.
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 [1] 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.
Code







Click here for more details.
Go here to access the main testing dashboard.
Reviews
Quick Comments
Resources
![]() |
|
Download All | |
Download Paper , View Paper | |
Download Source code | |
Github |
Statistics more
![]() |
|
Global rating: | ![]() ![]() ![]() ![]() ![]() |
Review rating: | ![]() ![]() ![]() ![]() ![]() |
Code rating: | ![]() ![]() ![]() ![]() ![]() |
Paper Quality: |
![]() ![]() |
Information more
![]() |
|
Categories: | Mixture of densities, Optimization, Probability, Segmentation |
Keywords: | Vessels segmentation, graph min-cut |
Toolkits: | ITK, CMake |
Export citation: |
Share
![]() |
Linked Publications more
![]() |
||
![]() by Padfield D., Miller J.
|
||
![]() by Vercauteren T., Pennec X., Perchant A., Ayache N.
|
View license
Loading license...
Send a message to the author
