Corpus ID: 15275532

Cooperative Cuts for Image Segmentation

  title={Cooperative Cuts for Image Segmentation},
  author={Stefanie Jegelka and Jeff A. Bilmes},
We propose a novel framework for graph-based cooperative regularization that uses submodular costs on graph edges. We introduce an efficient iterative algorithm to solve the resulting hard discrete optimization problem, and show that it has a guaranteed approximation factor. The edge-submodular formulation is amenable to the same extensions as standard graph cut approaches, and applicable to a range of problems. We apply this method to the image segmentation problem. Specifically, Here, we… Expand
An Algorithmic Theory of Dependent Regularizers, Part 1: Submodular Structure
We present an exploration of the rich theoretical connections between several classes of regularized models, network flows, and recent results in submodular function theory. This work unifies keyExpand
Deep Interactive Thin Object Selection
The effectiveness of the proposed solution on segmenting thin objects is demonstrated, surpassing the baseline by ~ 30% IoUthin despite using only four clicks, and a novel integrative thin object segmentation network consisting of three streams. Expand
An Algorithmic Framework for High Dimensional Regression with Dependent Variables
An Algorithmic Framework for High Dimensional Regression with Dependent Variables Hoyt Koepke Chair of the Supervisory Committee: Professor Marina Meila-Predoviciu Department of Statistics We presentExpand
Online algorithms for submodular minimization with combinatorial constraints
This work addresses online approximation algorithms for submodular minimization with combinatorial constraints and discusses two types of algorithms and outline approximation algorithms that integrate into those. Expand
Some Results about the Contractions and the Pendant Pairs of a Submodular System
Submodularity is an important  property of set functions with deep theoretical results  and various  applications. Submodular systems appear in many applicable area, for example machine learning,Expand


Graph cut based image segmentation with connectivity priors
This work forms several versions of the connectivity constraint and shows that the corresponding optimization problems are all NP-hard. Expand
Graph Cuts and Efficient N-D Image Segmentation
This application epitomizes the best features of combinatorial graph cuts methods in vision: global optima, practical efficiency, numerical robustness, ability to fuse a wide range of visual cues and constraints, unrestricted topological properties of segments, and applicability to N-D problems. Expand
Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images
A new technique for general purpose interactive segmentation of N-dimensional images where the user marks certain pixels as “object” or “background” to provide hard constraints for segmentation. Expand
"GrabCut": interactive foreground extraction using iterated graph cuts
A more powerful, iterative version of the optimisation of the graph-cut approach is developed and the power of the iterative algorithm is used to simplify substantially the user interaction needed for a given quality of result. Expand
Interactive Image Segmentation Using an Adaptive GMMRF Model
Estimation is performed by solving a graph cut problem for which very efficient algorithms have recently been developed, however the model depends on parameters which must be set by hand and the aim of this work is for those constants to be learned from image data. Expand
Image segmentation with a bounding box prior
This paper discusses how the bounding box can be further used to impose a powerful topological prior, which prevents the solution from excessive shrinking and ensures that the user-provided box bounds the segmentation in a sufficiently tight way. Expand
Robust Higher Order Potentials for Enforcing Label Consistency
This paper proposes a novel framework for labelling problems which is able to combine multiple segmentations in a principled manner based on higher order conditional random fields and uses potentials defined on sets of pixels generated using unsupervised segmentation algorithms. Expand
Minimizing Nonsubmodular Functions with Graph Cuts-A Review
  • V. Kolmogorov, C. Rother
  • Mathematics, Medicine
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2007
This survey reviews some results that show that graph cuts can be applied to a much larger class of energy functions (in particular, nonsubmodular functions) and demonstrates the relevance of these results to vision on the problem of binary texture restoration. Expand
Global connectivity potentials for random field models
Markov random field (MRF, CRF) models are popular in computer vision. However, in order to be computationally tractable they are limited to incorporate only local interactions and cannot model globalExpand
What energy functions can be minimized via graph cuts?
  • V. Kolmogorov, R. Zabih
  • Medicine, Computer Science
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2004
This work gives a precise characterization of what energy functions can be minimized using graph cuts, among the energy functions that can be written as a sum of terms containing three or fewer binary variables. Expand