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...
Główni autorzy: | Kumar, MP, Kolmogorov, V, Torr, PHS |
---|---|
Format: | Conference item |
Język: | English |
Wydane: |
Curran Associates
2008
|
Podobne zapisy
-
Analyzing convex relaxations for map estimation
od: Kumar, MP, i wsp.
Wydane: (2011) -
An analysis of convex relaxations for MAP estimation of discrete MRFs
od: Pawan Kumar, M, i wsp.
Wydane: (2009) -
Efficiently solving convex relaxations for MAP estimation
od: Kumar, MP, i wsp.
Wydane: (2008) -
Improved moves for truncated convex models
od: Kumar, MP, i wsp.
Wydane: (2009) -
Solving Markov random fields using second order cone programming relaxations
od: Kumar, MP, i wsp.
Wydane: (2006)