Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images
Top Cited Papers
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 105-112
- https://doi.org/10.1109/iccv.2001.937505
Abstract
In this paper we describe a new technique for general purpose interactive segmentation of N-dimensional images. The user marks certain pixels as "object" or "background" to provide hard constraints for segmentation. Additional soft constraints incorporate both boundary and region information. Graph cuts are used to find the globally optimal segmentation of the N-dimensional image. The obtained solution gives the best balance of boundary and region properties among all segmentations satisfying the constraints. The topology of our segmentation is unrestricted and both "object" and "background" segments may consist of several isolated parts. Some experimental results are presented in the context of photo/video editing and medical image segmentation. We also demonstrate an interesting Gestalt example. A fast implementation of our segmentation method is possible via a new max-flow algorithm.Keywords
This publication has 15 references indexed in Scilit:
- Segmentation by grouping junctionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Markov random fields with efficient approximationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Normalized cuts and image segmentationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Exact voxel occupancy with graph cutsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Globally optimal regions and boundariesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Interactive Segmentation with Intelligent ScissorsGraphical Models and Image Processing, 1998
- Hierarchical Segmentation Satisfying ConstraintsPublished by British Machine Vision Association and Society for Pattern Recognition ,1994
- On active contour models and balloonsCVGIP: Image Understanding, 1991
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulationsJournal of Computational Physics, 1988
- Snakes: Active contour modelsInternational Journal of Computer Vision, 1988