Constraints on deformable models: recovering 3D shape and nongrid motion
Artificial Intelligence
Interactive segmentation with Intelligent Scissors
Graphical Models and Image Processing
Computer Vision
ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume II - Volume II
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
"GrabCut": interactive foreground extraction using iterated graph cuts
ACM SIGGRAPH 2004 Papers
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Fast Vessel Centerline Extraction Algorithm for Catheter Simulation
CBMS '07 Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems
ICPR '10 Proceedings of the 2010 20th International Conference on Pattern Recognition
Nugget-cut: a segmentation scheme for spherically- and elliptically-shaped 3D objects
Proceedings of the 32nd DAGM conference on Pattern recognition
Segmentation of pituitary adenoma: A graph-based method vs. a balloon inflation method
Computer Methods and Programs in Biomedicine
Hi-index | 0.00 |
The basic principle of graph-based approaches for image segmentation is to interpret an image as a graph, where the nodes of the graph represent 2D pixels or 3D voxels of the image. The weighted edges of the graph are obtained by intensity differences in the image. Once the graph is constructed, the minimal cost closed set on the graph can be computed via a polynomial time s-t cut, dividing the graph into two parts: the object and the background. However, no segmentation method provides perfect results, so additional manual editing is required, especially in the sensitive field of medical image processing. In this study, we present a manual refinement method that takes advantage of the basic design of graph-based image segmentation algorithms. Our approach restricts a graph-cut by using additional user-defined seed points to set up fixed nodes in the graph. The advantage is that manual edits can be integrated intuitively and quickly into the segmentation result of a graph-based approach. The method can be applied to both 2D and 3D objects that have to be segmented. Experimental results for synthetic and real images are presented to demonstrate the feasibility of our approach.