Authors
Varun Gulshan, Carsten Rother, Antonio Criminisi, Andrew Blake, Andrew Zisserman
Publication date
2010/6/13
Conference
2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Pages
3129-3136
Publisher
IEEE
Description
In this paper we introduce a new shape constraint for interactive image segmentation. It is an extension of Veksler's star-convexity prior, in two ways: from a single star to multiple stars and from Euclidean rays to Geodesic paths. Global minima of the energy function are obtained subject to these new constraints. We also introduce Geodesic Forests, which exploit the structure of shortest paths in implementing the extended constraints. The star-convexity prior is used here in an interactive setting and this is demonstrated in a practical system. The system is evaluated by means of a “robot user” to measure the amount of interaction required in a precise way. We also introduce a new and harder dataset which augments the existing Grabcut dataset with images and ground truth taken from the PASCAL VOC segmentation challenge.
Total citations
20102011201220132014201520162017201820192020202120222023202421717364160585730343332334019
Scholar articles
V Gulshan, C Rother, A Criminisi, A Blake, A Zisserman - 2010 IEEE Computer Society Conference on Computer …, 2010