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

類似資料