{"publication_status":"published","date_published":"2004-08-01T00:00:00Z","type":"conference","publisher":"ACM","_id":"3179","main_file_link":[{"open_access":"0","url":"http://research.microsoft.com/pubs/67890/siggraph04-grabcut.pdf"}],"volume":23,"page":"309 - 314","title":"&quot;GrabCut&quot; - Interactive foreground extraction using iterated graph cuts ","issue":"3","author":[{"full_name":"Rother, Carsten","last_name":"Rother","first_name":"Carsten"},{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov"},{"first_name":"Andrew","full_name":"Blake, Andrew","last_name":"Blake"}],"status":"public","year":"2004","doi":"10.1145/1015706.1015720","abstract":[{"text":"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 &quot;border matting&quot; 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.","lang":"eng"}],"citation":{"short":"C. Rother, V. Kolmogorov, A. Blake, in:, ACM, 2004, pp. 309–314.","ieee":"C. Rother, V. Kolmogorov, and A. Blake, “&#38;quot;GrabCut&#38;quot; - Interactive foreground extraction using iterated graph cuts ,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, 2004, vol. 23, no. 3, pp. 309–314.","ama":"Rother C, Kolmogorov V, Blake A. &#38;quot;GrabCut&#38;quot; - Interactive foreground extraction using iterated graph cuts . In: Vol 23. ACM; 2004:309-314. doi:<a href=\"https://doi.org/10.1145/1015706.1015720\">10.1145/1015706.1015720</a>","chicago":"Rother, Carsten, Vladimir Kolmogorov, and Andrew Blake. “&#38;quot;GrabCut&#38;quot; - Interactive Foreground Extraction Using Iterated Graph Cuts ,” 23:309–14. ACM, 2004. <a href=\"https://doi.org/10.1145/1015706.1015720\">https://doi.org/10.1145/1015706.1015720</a>.","apa":"Rother, C., Kolmogorov, V., &#38; Blake, A. (2004). &#38;quot;GrabCut&#38;quot; - Interactive foreground extraction using iterated graph cuts  (Vol. 23, pp. 309–314). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, ACM. <a href=\"https://doi.org/10.1145/1015706.1015720\">https://doi.org/10.1145/1015706.1015720</a>","mla":"Rother, Carsten, et al. <i>&#38;quot;GrabCut&#38;quot; - Interactive Foreground Extraction Using Iterated Graph Cuts </i>. Vol. 23, no. 3, ACM, 2004, pp. 309–14, doi:<a href=\"https://doi.org/10.1145/1015706.1015720\">10.1145/1015706.1015720</a>.","ista":"Rother C, Kolmogorov V, Blake A. 2004. &#38;quot;GrabCut&#38;quot; - Interactive foreground extraction using iterated graph cuts . SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques vol. 23, 309–314."},"extern":1,"date_created":"2018-12-11T12:01:51Z","conference":{"name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques"},"month":"08","intvolume":"        23","day":"01","quality_controlled":0,"date_updated":"2021-01-12T07:41:36Z","publist_id":"3505"}