A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Graph Cuts with Interacting Edge Costs - Examples, Approximations, and Algorithms
[article]
2016
arXiv
pre-print
Preserved Fulltext
Other Versions
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
arXiv:1402.0240v4
fatcat:wznkbacpcnashntirqnv5z24um