Graph cuts with interacting edge weights: examples, approximations, and algorithms
Author(s)
Bilmes, Jeff A.; Jegelka, Stefanie Sabrina
Download10107_2016_1038_ReferencePDF.pdf (1.283Mb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2016-07Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
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
ISSN
0025-5610
1436-4646