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

全面介绍

书目详细资料
Main Authors: Kumar, MP, Torr, PHS
格式: Conference item
语言:English
出版: Association for Computing Machinery 2008

相似书籍