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...

Полное описание

Библиографические подробности
Главные авторы: Kumar, MP, Torr, PHS
Формат: Conference item
Язык:English
Опубликовано: Association for Computing Machinery 2008

Схожие документы