DOPE: Distributed Optimization for Pairwise Energies

04/11/2017
by   Jose Dolz, et al.
0

We formulate an Alternating Direction Method of Mul-tipliers (ADMM) that systematically distributes the computations of any technique for optimizing pairwise functions, including non-submodular potentials. Such discrete functions are very useful in segmentation and a breadth of other vision problems. Our method decomposes the problem into a large set of small sub-problems, each involving a sub-region of the image domain, which can be solved in parallel. We achieve consistency between the sub-problems through a novel constraint that can be used for a large class of pair-wise functions. We give an iterative numerical solution that alternates between solving the sub-problems and updating consistency variables, until convergence. We report comprehensive experiments, which demonstrate the benefit of our general distributed solution in the case of the popular serial algorithm of Boykov and Kolmogorov (BK algorithm) and, also, in the context of non-submodular functions.

READ FULL TEXT

page 5

page 7

research
07/06/2021

Submodular Order Functions and Assortment Optimization

We define a new class of set functions that in addition to being monoton...
research
11/17/2021

Submodular Optimization for Coupled Task Allocation and Intermittent Deployment Problems

In this paper, we demonstrate a formulation for optimizing coupled submo...
research
07/10/2019

Two-block vs. Multi-block ADMM: An empirical evaluation of convergence

Alternating Direction Method of Multipliers (ADMM) has become a widely u...
research
06/17/2018

Approximate Submodular Functions and Performance Guarantees

We consider the problem of maximizing non-negative non-decreasing set fu...
research
11/25/2019

Discriminative training of conditional random fields with probably submodular constraints

Problems of segmentation, denoising, registration and 3D reconstruction ...
research
02/05/2021

Exploring the Subgraph Density-Size Trade-off via the Lovász Extension

Given an undirected graph, the Densest-k-Subgraph problem (DkS) seeks to...

Please sign up or login with your details

Forgot password? Click here to reset