Efficiently solving convex relaxations for MAP estimation
<p>The problem of obtaining the maximum <em>a posteriori</em> (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 |
---|---|
Format: | Conference item |
Jezik: | English |
Izdano: |
Association for Computing Machinery
2008
|
Podobne knjige/članki
-
An analysis of convex relaxations for MAP estimation
od: Kumar, MP, et al.
Izdano: (2008) -
Analyzing convex relaxations for map estimation
od: Kumar, MP, et al.
Izdano: (2011) -
An analysis of convex relaxations for MAP estimation of discrete MRFs
od: Pawan Kumar, M, et al.
Izdano: (2009) -
Solving Markov random fields using second order cone programming relaxations
od: Kumar, MP, et al.
Izdano: (2006) -
Improved moves for truncated convex models
od: Kumar, MP, et al.
Izdano: (2009)