Graph cuts with interacting edge weights: examples, approximations, and algorithms
Name
10107_2016_1038_ReferencePDF.pdf
Size
1.28 MB
Format
Adobe PDF
Checksum (MD5)
a73f9a177fe0c0d6c2e018364eb760ae
Author(s)
Bilmes, Jeff A.
Jegelka, Stefanie Sabrina
Date Issued
July 2016
Journal
Mathematical Programming
Publisher
Springer Berlin Heidelberg
Citation
Jegelka, Stefanie, and Jeff A. Bilmes. “Graph Cuts with Interacting Edge Weights: Examples, Approximations, and Algorithms.” Mathematical Programming 162, no. 1–2 (July 1, 2016): 241–282.
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s10107-016-1038-y
