We introduce cooperative cut, a minimum cut problem whose cost is a submodular function on sets of edges: the cost of an edge that is added to a cut set depends on the edges in the set. Applications are e.g. in probabilistic graphical models and image processing. We prove NP hardness and a polynomial lower bound on the approximation factor, and upper bounds via four approximation algorithms based on different techniques. Our additional heuristics have attractive practical properties, e.g., to rely only on standard min-cut. Both our algorithms and heuristics appear to do well in practice.
| Author(s): | Jegelka, S. and Bilmes, J. |
| Year: | 2010 |
| Month: | July |
| Day: | 0 |
| Bibtex Type: | Talk (talk) |
| Digital: | 0 |
| Electronic Archiving: | grant_archive |
| Event Name: | 24th European Conference on Operational Research (EURO XXIV) |
| Event Place: | Lisboa, Portugal |
| Links: | |
BibTex
@talk{JegelkaB2010_2,
title = {Cooperative Cuts: Graph Cuts with Submodular Edge Weights},
abstract = {We introduce cooperative cut, a minimum cut problem whose cost is a submodular function on sets of edges: the cost of an edge that is added to a cut set depends on the edges in the set. Applications are e.g. in probabilistic graphical
models and image processing. We prove NP hardness and a polynomial lower bound on the approximation factor, and upper bounds via four approximation algorithms based on different techniques. Our additional heuristics have attractive practical properties, e.g., to rely only on standard min-cut. Both our algorithms and heuristics appear to do well in practice.},
month = jul,
year = {2010},
slug = {jegelkab2010_2},
author = {Jegelka, S. and Bilmes, J.},
month_numeric = {7}
}