Results 1  10
of
56
Constrained Parametric MinCuts for Automatic Object Segmentation
, 2010
"... We present a novel framework for generating and rankingplausibleobjectshypothesesin animage using bottomup processes and midlevel cues. The object hypotheses arerepresented as figureground segmentations, and are extracted automatically, withoutpriorknowledgeabout properties of individual object c ..."
Abstract

Cited by 112 (11 self)
 Add to MetaCart
(Show Context)
We present a novel framework for generating and rankingplausibleobjectshypothesesin animage using bottomup processes and midlevel cues. The object hypotheses arerepresented as figureground segmentations, and are extracted automatically, withoutpriorknowledgeabout properties of individual object classes, by solving a sequence of constrained parametric mincut problems (CPMC) on a regular image grid. We then learn to rank the object hypotheses by training a continuous model to predict how plausible the segments are, given their midlevel region properties. We show that this algorithm significantly outperforms the state of the art for lowlevel segmentation in the VOC09 segmentation dataset. It achieves the same average best segmentation covering as the best performing technique to date [2], 0.61 when using just the top 7 ranked segments, instead of the full hierarchy in [2]. Our methodachieves0.78averagebest covering using 154 segments. In a companion paper [18], we also show that the algorithm achieves stateofthe art results when used in a segmentationbased recognition pipeline.
Fast approximate energy minimization with label costs
, 2010
"... The αexpansion algorithm [7] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involve unary, pairwise, and specialized higherorder terms. Our main contribution is to extend αexpansion so that it can simult ..."
Abstract

Cited by 103 (8 self)
 Add to MetaCart
(Show Context)
The αexpansion algorithm [7] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involve unary, pairwise, and specialized higherorder terms. Our main contribution is to extend αexpansion so that it can simultaneously optimize “label costs ” as well. An energy with label costs can penalize a solution based on the set of labels that appear in it. The simplest special case is to penalize the number of labels in the solution. Our energy is quite general, and we prove optimality bounds for our algorithm. A natural application of label costs is multimodel fitting, and we demonstrate several such applications in vision: homography detection, motion segmentation, and unsupervised image segmentation. Our C++/MATLAB implementation is publicly available.
Graph cut based image segmentation with connectivity priors
, 2008
"... Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated objects due to the “shrinking bias”. To overcome this problem, we propose to impose an additional connectivity prior, which ..."
Abstract

Cited by 99 (8 self)
 Add to MetaCart
(Show Context)
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated objects due to the “shrinking bias”. To overcome this problem, we propose to impose an additional connectivity prior, which is a very natural assumption about objects. We formulate several versions of the connectivity constraint and show that the corresponding optimization problems are all NPhard. For some of these versions we propose two optimization algorithms: (i) a practical heuristic technique which we call DijkstraGC, and (ii) a slow method based on problem decomposition which provides a lower bound on the problem. We use the second technique to verify that for some practical examples DijkstraGC is able to find the global minimum. 1.
An efficient algorithm for Cosegmentation
"... This paper is focused on the Cosegmentation problem [1] – where the objective is to segment a similar object from a pair of images. The background in the two images may be arbitrary; therefore, simultaneous segmentation of both images must be performed with a requirement that the appearance of the ..."
Abstract

Cited by 53 (4 self)
 Add to MetaCart
(Show Context)
This paper is focused on the Cosegmentation problem [1] – where the objective is to segment a similar object from a pair of images. The background in the two images may be arbitrary; therefore, simultaneous segmentation of both images must be performed with a requirement that the appearance of the two sets of foreground pixels in the respective images are consistent. Existing approaches [1, 2] cast this problem as a Markov Random Field (MRF) based segmentation of the image pair with a regularized difference of the two histograms – assuming a Gaussian prior on the foreground appearance [1] or by calculating the sum of squared differences [2]. Both are interesting formulations but lead to difficult optimization problems, due to the presence of the second (histogram difference) term. The model proposed here bypasses measurement of the histogram differences in a direct fashion; we show that this enables obtaining efficient solutions to the underlying optimization model. Our new algorithm is similar to the existing methods in spirit, but differs substantially in that it can be solved to optimality in polynomial time using a maximum flow procedure on an appropriately constructed graph. We discuss our ideas and present promising experimental results. 1.
Geos: Geodesic image segmentation
 ECCV '08 PROCEEDINGS OF THE 10TH EUROPEAN CONFERENCE ON COMPUTER VISION: PART I
, 2008
"... Abstract. This paper presents GeoS, a new algorithm for the efficient segmentation of ndimensional image and video data. The segmentation problem is cast as approximate energy minimization in a conditional random field. A new, parallel filtering operator built upon efficient geodesic distance compu ..."
Abstract

Cited by 43 (4 self)
 Add to MetaCart
(Show Context)
Abstract. This paper presents GeoS, a new algorithm for the efficient segmentation of ndimensional image and video data. The segmentation problem is cast as approximate energy minimization in a conditional random field. A new, parallel filtering operator built upon efficient geodesic distance computation is used to propose a set of spatially smooth, contrastsensitive segmentation hypotheses. An economical search algorithm finds the solution with minimum energy within a sensible and highly restricted subset of all possible labellings. Advantages include: i) computational efficiency with high segmentation accuracy; ii) the ability to estimate an approximation to the posterior over segmentations; iii) the ability to handle generally complex energy models. Comparison with maxflow indicates up to 60 times greater computational efficiency as well as greater memory efficiency. GeoS is validated quantitatively and qualitatively by thorough comparative experiments on existing and novel groundtruth data. Numerous results on interactive and automatic segmentation of photographs, video and volumetric medical image data are presented. 1
Joint optimization of segmentation and appearance models
, 2009
"... Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable. Since the resulting optimization problem is NPhard the segmentation and appearance are typically optimized separately, in an EMstyle fashion. One contribution of this p ..."
Abstract

Cited by 40 (6 self)
 Add to MetaCart
(Show Context)
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable. Since the resulting optimization problem is NPhard the segmentation and appearance are typically optimized separately, in an EMstyle fashion. One contribution of this paper is to express the objective function purely in terms of the unknown segmentation, using higherorder cliques. This formulation reveals an interesting bias of the model towards balanced segmentations. Furthermore, it enables us to develop a new dual decomposition optimization procedure, which provides additionally a lower bound. Hence, we are able to improve on existing optimizers, and verify that for a considerable number of real world examples we even achieve global optimality. This is important since we are able, for the first time, to analyze the deficiencies of the model. Another contribution is to establish a property of a particular dual decomposition approach which involves convex functions depending on foreground area. As a consequence, we show that the optimal decomposition for our problem can be computed efficiently via a parametric maxflow algorithm. 1.
A global perspective on map inference for lowlevel vision
 In Microsoft Research Technical Report
, 2009
"... In recent years the Markov Random Field (MRF) has become the de facto probabilistic model for lowlevel vision applications. However, in a maximum a posteriori (MAP) framework, MRFs inherently encourage delta function marginal statistics. By contrast, many lowlevel vision problems have heavy tailed ..."
Abstract

Cited by 34 (5 self)
 Add to MetaCart
(Show Context)
In recent years the Markov Random Field (MRF) has become the de facto probabilistic model for lowlevel vision applications. However, in a maximum a posteriori (MAP) framework, MRFs inherently encourage delta function marginal statistics. By contrast, many lowlevel vision problems have heavy tailed marginal statistics, making the MRF model unsuitable. In this paper we introduce a more general Marginal Probability Field (MPF), of which the MRF is a special, linear case, and show that convex energy MPFs can be used to encourage arbitrary marginal statistics. We introduce a flexible, extensible framework for effectively optimizing the resulting NPhard MAP problem, based around dualdecomposition and a modified mincost flow algorithm, and which achieves global optimality in some instances. We use a range of applications, including image denoising and texture synthesis, to demonstrate the benefits of this class of MPF over MRFs. 1.
A Pylon Model for Semantic Segmentation
"... Graph cut optimization is one of the standard workhorses of image segmentation since for binary random field representations of the image, it gives globally optimal results and there are efficient polynomial time implementations. Often, the random field is applied over a flat partitioning of the ima ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
(Show Context)
Graph cut optimization is one of the standard workhorses of image segmentation since for binary random field representations of the image, it gives globally optimal results and there are efficient polynomial time implementations. Often, the random field is applied over a flat partitioning of the image into nonintersecting elements, such as pixels or superpixels. In the paper we show that if, instead of a flat partitioning, the image is represented by a hierarchical segmentation tree, then the resulting energy combining unary and boundary terms can still be optimized using graph cut (with all the corresponding benefits of global optimality and efficiency). As a result of such inference, the image gets partitioned into a set of segments that may come from different layers of the tree. We apply this formulation, which we call the pylon model, to the task of semantic segmentation where the goal is to separate an image into areas belonging to different semantic classes. The experiments highlight the advantage of inference on a segmentation tree (over a flat partitioning) and demonstrate that the optimization in the pylon model is able to flexibly choose the level of segmentation across the image. Overall, the proposed system has superior segmentation accuracy on several datasets (Graz02, Stanford background) compared to previously suggested approaches. 1
Shape Prior for GraphCut Image Segmentation
 in: European Conference on Computer Vision (ECCV
, 2008
"... Abstract. In recent years, segmentation with graph cuts is increasingly used for a variety of applications, such as photo/video editing, medical image processing, etc. One of the most common applications of graph cut segmentation is extracting an object of interest from its background. If there is a ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
(Show Context)
Abstract. In recent years, segmentation with graph cuts is increasingly used for a variety of applications, such as photo/video editing, medical image processing, etc. One of the most common applications of graph cut segmentation is extracting an object of interest from its background. If there is any knowledge about the object shape (i.e. a shape prior), incorporating this knowledge helps to achieve a more robust segmentation. In this paper, we show how to implement a star shape prior into graph cut segmentation. This is a generic shape prior, i.e. it is not specific to any particular object, but rather applies to a wide class of objects, in particular to convex objects. Our major assumption is that the center of the star shape is known, for example, it can be provided by the user. The star shape prior has an additional important benefit it allows an inclusion of a term in the objective function which encourages a longer object boundary. This helps to alleviate the bias of a graph cut towards shorter segmentation boundaries. In fact, we show that in many cases, with this new term we can achieve an accurate object segmentation with only a single pixel, the center of the object, provided by the user, which is rarely possible with standard graph cut interactive segmentation. 1
Submodularity beyond submodular energies: coupling edges in graph cuts
 In CVPR
, 2011
"... We propose a new family of nonsubmodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an efficient approximation algorithm that, thanks to the internal submodularity, can use standard graph cuts as a subroutine. We ..."
Abstract

Cited by 23 (16 self)
 Add to MetaCart
(Show Context)
We propose a new family of nonsubmodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an efficient approximation algorithm that, thanks to the internal submodularity, can use standard graph cuts as a subroutine. We demonstrate the advantages of edge coupling in a natural setting, namely image segmentation. In particular, for finestructured objects and objects with shading variation, our structured edge coupling leads to significant improvements over standard approaches. 1.