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...
Autori principali: | Kumar, MP, Torr, PHS |
---|---|
Natura: | Conference item |
Lingua: | English |
Pubblicazione: |
Association for Computing Machinery
2008
|
Documenti analoghi
Documenti analoghi
-
An analysis of convex relaxations for MAP estimation
di: Kumar, MP, et al.
Pubblicazione: (2008) -
Analyzing convex relaxations for map estimation
di: Kumar, MP, et al.
Pubblicazione: (2011) -
An analysis of convex relaxations for MAP estimation of discrete MRFs
di: Pawan Kumar, M, et al.
Pubblicazione: (2009) -
Solving Markov random fields using second order cone programming relaxations
di: Kumar, MP, et al.
Pubblicazione: (2006) -
Improved moves for truncated convex models
di: Kumar, MP, et al.
Pubblicazione: (2009)