Graph Cuts with Interacting Edge Costs - Examples, Approximations, and Algorithms

02/02/2014
βˆ™
by   Stefanie Jegelka, et al.
βˆ™
0
βˆ™

We study an extension of the classical graph cut problem, wherein we replace the modular (sum of edge weights) cost function by a submodular set function defined over graph edges. Special cases of this problem have appeared in different applications in signal processing, machine learning, and computer vision. In this paper, we connect these applications via the generic formulation of "cooperative graph cuts", for which we study complexity, algorithms, and connections to polymatroidal network flows. Finally, we compare the proposed algorithms empirically.

READ FULL TEXT
research
βˆ™ 07/09/2021

Preventing Small (𝐬,𝐭)-Cuts by Protecting Edges

We introduce and study Weighted Min (s,t)-Cut Prevention, where we are g...
research
βˆ™ 02/26/2019

Near Optimal Algorithms for Hard Submodular Programs with Discounted Cooperative Costs

In this paper, we investigate a class of submodular problems which in ge...
research
βˆ™ 06/12/2018

Minimum Shared-Power Edge Cut

We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC)....
research
βˆ™ 01/28/2020

Discrete Signal Processing with Set Functions

Set functions are functions (or signals) indexed by the power set (set o...
research
βˆ™ 12/06/2013

An Algorithmic Theory of Dependent Regularizers, Part 1: Submodular Structure

We present an exploration of the rich theoretical connections between se...
research
βˆ™ 10/28/2021

Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components

Minimizing a sum of simple submodular functions of limited support is a ...
research
βˆ™ 01/02/2016

A Unified Framework for Compositional Fitting of Active Appearance Models

Active Appearance Models (AAMs) are one of the most popular and well-est...

Please sign up or login with your details

Forgot password? Click here to reset