We present a new proximal bundle method for Maximum-A-Posteriori (MAP) inference in structured energy minimization problems. The method optimizes a Lagrangean relaxation of the original energy minimization problem using a multi plane block-coordinate Frank-Wolfe method that takes advantage of the specific structure of the Lagrangean decomposition. We show empirically that our method outperforms state-of-the-art Lagrangean decomposition based algorithms on some challenging Markov Random Field, multi-label discrete tomography and graph matching problems
We introduce an algorithm, based on the Frank-Wolfe technique (conditional gra-dient), for performin...
International audienceGraphical models factorize a global probability distribution/energy function a...
In this paper, we propose novel algorithms for inferring the Maximum a Posteriori (MAP) solution of ...
We present a new proximal bundle method for Maximum-A-Posteriori (MAP) inference in structured energ...
Finding maximum a posterior (MAP) estimation is common problem in computer vision, such as the infer...
We consider the energy minimization problem for undirected graphical models, also known as MAP-infer...
We consider the energy minimization problem for undi-rected graphical models, also known as MAP-infe...
Estimating the most likely configuration (MAP) is one of the fundamental tasks in probabilis-tic mod...
Approximate inference by decomposition of discrete graphical models and Lagrangian relaxation has be...
We consider energy minimization for undirected graphical models, also known as the MAP-inference pro...
We consider energy minimization for undirected graphical models, also known as the MAP-inference pro...
This electronic version was submitted by the student author. The certified thesis is available in th...
International audienceLinear programming relaxations are central to MAP inference in discrete Markov...
Energy minimization algorithms, such as graph cuts, enable the computation of the MAP solution under...
Graphical models factorize a global probability distribution/energy function as the prod-uct/sum of ...
We introduce an algorithm, based on the Frank-Wolfe technique (conditional gra-dient), for performin...
International audienceGraphical models factorize a global probability distribution/energy function a...
In this paper, we propose novel algorithms for inferring the Maximum a Posteriori (MAP) solution of ...
We present a new proximal bundle method for Maximum-A-Posteriori (MAP) inference in structured energ...
Finding maximum a posterior (MAP) estimation is common problem in computer vision, such as the infer...
We consider the energy minimization problem for undirected graphical models, also known as MAP-infer...
We consider the energy minimization problem for undi-rected graphical models, also known as MAP-infe...
Estimating the most likely configuration (MAP) is one of the fundamental tasks in probabilis-tic mod...
Approximate inference by decomposition of discrete graphical models and Lagrangian relaxation has be...
We consider energy minimization for undirected graphical models, also known as the MAP-inference pro...
We consider energy minimization for undirected graphical models, also known as the MAP-inference pro...
This electronic version was submitted by the student author. The certified thesis is available in th...
International audienceLinear programming relaxations are central to MAP inference in discrete Markov...
Energy minimization algorithms, such as graph cuts, enable the computation of the MAP solution under...
Graphical models factorize a global probability distribution/energy function as the prod-uct/sum of ...
We introduce an algorithm, based on the Frank-Wolfe technique (conditional gra-dient), for performin...
International audienceGraphical models factorize a global probability distribution/energy function a...
In this paper, we propose novel algorithms for inferring the Maximum a Posteriori (MAP) solution of ...