
MPLP++: Fast, Parallel Dual BlockCoordinate Ascent for Dense Graphical Models
Dense, discrete Graphical Models with pairwise potentials are a powerful...
read it

Taxonomy of Dual BlockCoordinate Ascent Methods for Discrete Energy Minimization
We consider the maximumaposteriori inference problem in discrete graph...
read it

A PrimalDual Solver for LargeScale TrackingbyAssignment
We propose a fast approximate solver for the combinatorial problem known...
read it

Exact MAPInference by Confining Combinatorial Search with LP Relaxation
We consider the MAPinference problem for graphical models, which is a v...
read it

Discrete graphical models – an optimization perspective
This monograph is about discrete energy minimization for discrete graphi...
read it

A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching
We study the quadratic assignment problem, in computer vision also known...
read it

A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems
We propose a general dual ascent framework for Lagrangean decomposition ...
read it

Global Hypothesis Generation for 6D Object Pose Estimation
This paper addresses the task of estimating the 6D pose of a known 3D ob...
read it

InstanceCut: from Edges to Instances with MultiCut
This work addresses the task of instanceaware semantic segmentation. Ou...
read it

Joint MBestDiverse Labelings as a Parametric Submodular Minimization
We consider the problem of jointly inferring the Mbest diverse labeling...
read it

Multicuts and Perturb & MAP for Probabilistic Graph Clustering
We present a probabilistic graphical model formulation for the graph clu...
read it

Maximum Persistency via Iterative Relaxed Inference with Graphical Models
We consider the NPhard problem of MAPinference for undirected discrete...
read it

Partial Optimality by Pruning for MAPInference with General Graphical Models
We consider the energy minimization problem for undirected graphical mod...
read it

Efficient MRF Energy Minimization via Adaptive Diminishing Smoothing
We consider the linear programming relaxation of an energy minimization ...
read it

Getting Feasible Variable Estimates From Infeasible Ones: MRF Local Polytope Study
This paper proposes a method for construction of approximate feasible pr...
read it
Bogdan Savchynskyy
is this you? claim profile