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

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí: Kumar, MP, Kolmogorov, V, Torr, PHS
Formáid: Conference item
Teanga:English
Foilsithe / Cruthaithe: Curran Associates 2008

Míreanna comhchosúla