Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images

Proceedings of the IEEE International Conference on Computer Vision

Volumn 1, Issue , 2001, Pages 105-112

  Boykov, Y Y ^a   Jolly, M P ^a  

^a SIEMENS CORPORATE RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; GRAPH THEORY; IMAGE CODING; IMAGE SEGMENTATION; INTERACTIVE COMPUTER SYSTEMS; MEDICAL IMAGING;

GRAPH CUTS; INTERACTIVE SEGMENTATION; MAX-FLOW ALGORITHMS; VIDEO EDITING;

COMPUTER VISION;

EID: 0034844730     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Interactive organ segmentation using graph cuts
2. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
3. Markov random fields with efficient approximations
4. On active contour models and balloons
5. "Ratio regions": A technique for image segmentation
6. User-steered image segmentation paradigms: Live wire and live lane
7. A new approach to the maximum flow problem
8. Exact maximum a posteriori estimation for binary images
9. Hierarchical segmentation satisfying constraints
10. Segmentation by grouping junctions
11. Globally optimal regions and boundaries
12. Snakes: Active contour models
13. Interactive segmentation with intelligent scissors
14. Fronts propagating with curvature-dependent speed: Algorithms based on the Hamilton-Jacobi formulation
15. Intelligent paint: Region-based interactive image segmentation
16. Normalized cuts and image segmentation
17. Exact voxel occupancy with graph cuts
18. An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation
19. Deformable templates
20. Region competition: Unifying snakes, region growing, and Bayes/MDL for multiband image segmentation