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...
Päätekijät: | Kumar, MP, Torr, PHS |
---|---|
Aineistotyyppi: | Conference item |
Kieli: | English |
Julkaistu: |
Association for Computing Machinery
2008
|
Samankaltaisia teoksia
-
An analysis of convex relaxations for MAP estimation
Tekijä: Kumar, MP, et al.
Julkaistu: (2008) -
Analyzing convex relaxations for map estimation
Tekijä: Kumar, MP, et al.
Julkaistu: (2011) -
An analysis of convex relaxations for MAP estimation of discrete MRFs
Tekijä: Pawan Kumar, M, et al.
Julkaistu: (2009) -
Solving Markov random fields using second order cone programming relaxations
Tekijä: Kumar, MP, et al.
Julkaistu: (2006) -
Improved moves for truncated convex models
Tekijä: Kumar, MP, et al.
Julkaistu: (2009)