"GrabCut"
Carsten Rother, Vladimir Kolmogorov, Andrew Blake · ACM Transactions on Graphics · 2004
The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors. Recently, an approach based on optimization by graph-cut has been developed which successfully combines both types of information. In this paper we extend the graph-cut approach in three respects. First, we have developed a more powerful, iterative version of the optimisation. Secondly, the power of the iterative algorithm is used to simplify substantially the user interaction needed for a given quality of result. Thirdly, a robust algorithm for "border matting" has been developed to estimate simultaneously the alpha-matte around an object boundary and the colours of foreground pixels. We show that for moderately difficult examples the proposed method outperforms competitive tools.
Cited by 5,697 works. doi:10.1145/1015706.1015720 Open-access PDF
Authors
References
- Maximum Likelihood from Incomplete Data Via the EM Algorithm
- Snakes: Active contour models
- Computer vision
- Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images
- What energy functions can be minimized via graph cuts?
- Exact Maximum A Posteriori Estimation for Binary Images
- Graphcut textures
- Geodesic active contours
- Intelligent scissors for image composition
- A Bayesian approach to digital matting