ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
"GrabCut": interactive foreground extraction using iterated graph cuts
Full text MovMov (20:20),  PdfPdf (473 KB)
Source ACM Transactions on Graphics (TOG) archive
Volume 23 ,  Issue 3  (August 2004) table of contents
Proceedings of ACM SIGGRAPH 2004
SESSION: Interacting with images table of contents
Pages: 309 - 314  
Year of Publication: 2004
ISSN:0730-0301
Also published in ...
Authors
Carsten Rother  Microsoft Research Cambridge, UK
Vladimir Kolmogorov  Microsoft Research Cambridge, UK
Andrew Blake  Microsoft Research Cambridge, UK
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 113,   Downloads (12 Months): 973,   Citation Count: 75
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1015706.1015720
What is a DOI?

Warning: The download time has expired please click on the item to try again.


ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ADOBE SYSTEMS INCORP. 2002. Adobe Photoshop User Guide.
 
2
BLAKE, A., ROTHER, C., BROWN, M., PEREZ, P., AND TORR, P. 2004. Interactive Image Segmentation using an adaptive GMMRF model. In Proc. European Conf. Computer Vision.
 
3
BOYKOV, Y., AND JOLLY, M.-P. 2001. Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images. In Proc. IEEE Int. Conf. on Computer Vision, CD--ROM.
 
4
 
5
 
6
CHUANG, Y.-Y., CURLESS, B., SALESIN, D., AND SZELISKI, R. 2001. A Bayesian approach to digital matting. In Proc. IEEE Conf. Computer Vision and Pattern Recog., CD--ROM.
 
7
COREL CORPORATION. 2002. Knockout user guide.
 
8
DEMPSTER, A., LAIRD, M., AND RUBIN, D. 1977. Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Stat. Soc. B. 39, 1--38.
 
9
GREIG, D., PORTEOUS, B., AND SEHEULT, A. 1989. Exact MAP estimation for binary images. J. Roy. Stat. Soc. B. 51, 271--279.
 
10
KASS, M., WITKIN, A., AND TERZOPOULOS, D. 1987. Snakes: Active contour models. In Proc. IEEE Int. Conf. on Computer Vision, 259--268.
 
11
 
12
KWATRA, V., SCHÖDL, A., ESSA, I., TURK, G., AND BOBICK, A. 2003. Graphcut Textures: Image and Video Synthesis Using Graph Cuts. Proc. ACM Siggraph, 277--286.
13
 
14
MORTENSEN, E., AND BARRETT, W. 1999. Tobogan-based intelligent scissors with a four parameter edge model. In Proc. IEEE Conf. Computer Vision and Pattern Recog., vol. 2, 452--458.
 
15
 
16
RUZON, M., AND TOMASI, C. 2000. Alpha estimation in natural images. In Proc. IEEE Conf. Comp. Vision and Pattern Recog.

CITED BY  77

Collaborative Colleagues:
Carsten Rother: colleagues
Vladimir Kolmogorov: colleagues
Andrew Blake: colleagues