Efficiently solving convex relaxations for MAP estimation

<p>The problem of obtaining the maximum&nbsp;<em>a posteriori</em>&nbsp;(MAP) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build on the tree reweighted message passing (TRW) framework of (Kolmogorov, 20...

Täydet tiedot

Bibliografiset tiedot
Päätekijät: Kumar, MP, Torr, PHS
Aineistotyyppi: Conference item
Kieli:English
Julkaistu: Association for Computing Machinery 2008

Samankaltaisia teoksia