Geodesic star convexity for interactive image segmentation

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 t...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition pp. 3129 - 3136
Main Authors Gulshan, V, Rother, C, Criminisi, A, Blake, A, Zisserman, A
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2010
Subjects
Brushes
Focusing
Humans
Image segmentation
Joining processes
Level measurement
Object recognition
Robots
Shape
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:1424469848
9781424469840
ISSN:1063-6919
1063-6919
DOI:10.1109/CVPR.2010.5540073