Efficiently solving convex relaxations for MAP estimation

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

Descripció completa

Dades bibliogràfiques
Autors principals:	Kumar, MP, Torr, PHS
Format:	Conference item
Idioma:	English
Publicat:	Association for Computing Machinery 2008

Ítems similars

An analysis of convex relaxations for MAP estimation
per: Kumar, MP, et al.
Publicat: (2008)

Analyzing convex relaxations for map estimation
per: Kumar, MP, et al.
Publicat: (2011)

An analysis of convex relaxations for MAP estimation of discrete MRFs
per: Pawan Kumar, M, et al.
Publicat: (2009)

Solving Markov random fields using second order cone programming relaxations
per: Kumar, MP, et al.
Publicat: (2006)

Improved moves for truncated convex models
per: Kumar, MP, et al.
Publicat: (2009)

Solving ptychography with a convex relaxation
per: Roarke Horstmeyer, et al.
Publicat: (2015-01-01)

Efficient relaxations for dense CRFs with sparse higher-order potentials
per: Joy, T, et al.
Publicat: (2019)

P3 and beyond: solving energies with higher order cliques
per: Kohli, P, et al.
Publicat: (2007)

Fast memory-efficient generalized belief propagation
per: Kumar, MP, et al.
Publicat: (2006)

Improved moves for truncated convex models
per: Pawan Kumar, M, et al.
Publicat: (2011)

Efficiently solving dynamic Markov random fields using graph cuts
per: Kohli, P, et al.
Publicat: (2005)

Reduce, reuse and recycle: efficiently solving multi-label MRFs
per: Alahari, K, et al.
Publicat: (2008)

Efficient discriminative learning of parts-based models
per: Kumar, MP, et al.
Publicat: (2010)

OBJCUT: efficient segmentation using top-down and bottom-up cues
per: Kumar, MP, et al.
Publicat: (2009)

Estimations of Covering Functionals of Convex Bodies Based on Relaxation Algorithm
per: Man Yu, et al.
Publicat: (2023-04-01)

Overcoming the convex barrier for simplex input
per: Behl, HS, et al.
Publicat: (2021)

On Convex Relaxations in Nonconvex Optimization
per: T. Westerlund, et al.
Publicat: (2011-04-01)

A convex relaxation for approximate global optimization in simultaneous localization and mapping
per: DuHadway, Charles, et al.
Publicat: (2017)

Distributed non-convex ADMM-based inference in large-scale random fields
per: Miksik, O, et al.
Publicat: (2014)

Scaling the convex barrier with active sets
per: De Palma, A, et al.
Publicat: (2021)

P3 & beyond: move making algorithms for solving higher order functions
per: Kohli, P, et al.
Publicat: (2008)

Bayesian model estimation and selection for epipolar geometry and generic manifold fitting
per: Torr, PHS
Publicat: (2002)

MLESAC: a new robust estimator with application to estimating image geometry
per: Torr, PHS, et al.
Publicat: (2000)

Efficient continuous relaxations for dense CRF
per: Bunel, R, et al.
Publicat: (2016)

An object category specific mrf for segmentation
per: Kumar, MP, et al.
Publicat: (2007)

Obj cut
per: Kumar, MP, et al.
Publicat: (2005)

Learning layered motion segmentations of video
per: Kumar, MP, et al.
Publicat: (2005)

Extending pictorial structures for object recognition
per: Kumar, MP, et al.
Publicat: (2004)

An invariant large margin nearest neighbour classifier
per: Kumar, MP, et al.
Publicat: (2007)

Feature based methods for structure and motion estimation
per: Torr, PHS, et al.
Publicat: (2002)

New convex relaxations for MRF inference with unknown graphs
per: Wang, Z, et al.
Publicat: (2020)

The Non-Tightness of a Convex Relaxation to Rotation Recovery
per: Yuval Alfassi, et al.
Publicat: (2021-11-01)

A convex relaxation approach for power flow problem
per: Saeed D. Manshadi, et al.
Publicat: (2019-01-01)

Polynomial Structure in Semidefinite Relaxations and Non-Convex Formulations
per: Yuan, Chenyang
Publicat: (2023)

The development and comparison of robust methods for estimating the fundamental matrix
per: Torr, PHS, et al.
Publicat: (1997)

PoseField: an efficient mean-field based method for joint estimation of human pose, segmentation, and depth
per: Vineet, V, et al.
Publicat: (2013)

Performance characterization of fundamental matrix estimation under image degradation
per: Torr, PHS, et al.
Publicat: (1997)

Dynamic graph cuts for efficient inference in Markov random fields
per: Kohli, P, et al.
Publicat: (2007)

Solving the convex ordered set problem
Publicat: (2003)

Convexity and boundedness relaxation for fixed point theorems in modular spaces
per: Fatemeh Lael, et al.
Publicat: (2021-04-01)