An analysis of convex relaxations for MAP estimation

The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known to be NP-hard. However, due to its central importance in many applications, several approximate algorithms have been proposed...

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

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

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