Premium
DenseCut: Densely Connected CRFs for Realtime GrabCut
Author(s) -
Cheng M. M.,
Prisacariu V. A.,
Zheng S.,
Torr P. H. S.,
Rother C.
Publication year - 2015
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.12758
Subject(s) - crfs , computer science , artificial intelligence , computer vision , computer graphics (images) , conditional random field
Abstract Figure‐ground segmentation from bounding box input, provided either automatically or manually, has been extremely popular in the last decade and influenced various applications. A lot of research has focused on high‐quality segmentation, using complex formulations which often lead to slow techniques, and often hamper practical usage. In this paper we demonstrate a very fast segmentation technique which still achieves very high quality results. We propose to replace the time consuming iterative refinement of global colour models in traditional GrabCut formulation by a densely connected crf . To motivate this decision, we show that a dense crf implicitly models unnormalized global colour models for foreground and background. Such relationship provides insightful analysis to bridge between dense crf and GrabCut functional. We extensively evaluate our algorithm using two famous benchmarks. Our experimental results demonstrated that the proposed algorithm achieves an order of magnitude (10×) speed‐up with respect to the closest competitor, and at the same time achieves a considerably higher accuracy.