CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
Watershed cuts are among the fastest segmentation algorithms and therefore well suited for interactive segmentation of very large 3D data sets. To minimize the number of user inte...
ICCV
2011
IEEE
12 years 5 months ago
2011
IEEE
Convex relaxation techniques have become a popular approach to image segmentation as they allow to compute solutions independent of initialization to a variety of image segmentati...
PR
2010
13 years 3 months ago
2010
In this paper we present a comparative evaluation of four popular interactive segmentation algorithms. The evaluation was carried out as a series of user-experiments, in which par...
ECCV
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We propose a novel method for unsupervised class segmentation on a set of images. It alternates between segmenting object instances and learning a class model. The method...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
In this paper, we deal with a generative model for multi-label, interactive segmentation. To estimate the pixel likelihoods for each label, we propose a new higher-order formulatio...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
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 ...
MICCAI
2006
Springer
14 years 6 months ago
2006
Springer
The Graph Cuts method of interactive segmentation has become very popular in recent years. This method performs at interactive speeds for smaller images/volumes, but an unacceptabl...
CVPR
2005
IEEE
14 years 7 months ago
2005
IEEE
Interactive or semi-automatic segmentation is a useful alternative to pure automatic segmentation in many applications. While automatic segmentation can be very challenging, a sma...