23 citations · 90 across the 22 of their papers we have counts for
5 papers · 1 filter
MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models
Siddharth Tourani, Alexander Shekhovtsov, Carsten Rother +1
Dense, discrete Graphical Models with pairwise potentials are a powerful class of models which are employed in state-of-the-art computer vision and bio-imaging applications. This w…
Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization
Siddharth Tourani, Alexander Shekhovtsov, Carsten Rother +1
We consider the maximum-a-posteriori inference problem in discrete graphical models and study solvers based on the dual block-coordinate ascent rule. We map all existing solvers in…
A Primal-Dual Solver for Large-Scale Tracking-by-Assignment
Stefan Haller, Mangal Prakash, Lisa Hutschenreiter +5
We propose a fast approximate solver for the combinatorial problem known as tracking-by-assignment, which we apply to cell tracking. The latter plays a key role in discovery in man…
Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation
Stefan Haller, Paul Swoboda, Bogdan Savchynskyy
We consider the MAP-inference problem for graphical models, which is a valued constraint satisfaction problem defined on real numbers with a natural summation operation. We propose…
Discrete graphical models -- an optimization perspective
Bogdan Savchynskyy
This monograph is about discrete energy minimization for discrete graphical models. It considers graphical models, or, more precisely, maximum a posteriori inference for graphical…