Fast Decomposable Submodular Function Minimization using Constrained Total Variation
Year: 2019
Type: conference-paper
Abstract: We consider the problem of minimizing the sum of submodular set functions as-suming minimization oracles of each summand function. Most existing approachesreformulate the problem as the convex minimization of the sum of the correspond-ing Lovász extensions and the squared Euclidean norm, leading to algorithmsrequiring total variation oracles of the summand functions; without further assump-tions, these more complex oracles require many calls to the simpler minimizationoracles often available in practice. In this paper, we consider a modified convexproblem requiring a constrained version of the total variation oracles that can besolved with significantly fewer calls to the simple minimization oracles. We supportour claims by showing results on graph cuts for 2D and 3D graphs.
Source: Spiral (Imperial College London)
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2970187046
