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

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Kumar, MP, Torr, PHS
Formáid:	Conference item
Teanga:	English
Foilsithe / Cruthaithe:	Association for Computing Machinery 2008

Míreanna comhchosúla

An analysis of convex relaxations for MAP estimation
de réir: Kumar, MP, et al.
Foilsithe / Cruthaithe: (2008)

Analyzing convex relaxations for map estimation
de réir: Kumar, MP, et al.
Foilsithe / Cruthaithe: (2011)

An analysis of convex relaxations for MAP estimation of discrete MRFs
de réir: Pawan Kumar, M, et al.
Foilsithe / Cruthaithe: (2009)

Solving Markov random fields using second order cone programming relaxations
de réir: Kumar, MP, et al.
Foilsithe / Cruthaithe: (2006)

Improved moves for truncated convex models
de réir: Kumar, MP, et al.
Foilsithe / Cruthaithe: (2009)

Solving ptychography with a convex relaxation
de réir: Roarke Horstmeyer, et al.
Foilsithe / Cruthaithe: (2015-01-01)

Efficient relaxations for dense CRFs with sparse higher-order potentials
de réir: Joy, T, et al.
Foilsithe / Cruthaithe: (2019)

P3 and beyond: solving energies with higher order cliques
de réir: Kohli, P, et al.
Foilsithe / Cruthaithe: (2007)

Fast memory-efficient generalized belief propagation
de réir: Kumar, MP, et al.
Foilsithe / Cruthaithe: (2006)

Improved moves for truncated convex models
de réir: Pawan Kumar, M, et al.
Foilsithe / Cruthaithe: (2011)

Efficiently solving dynamic Markov random fields using graph cuts
de réir: Kohli, P, et al.
Foilsithe / Cruthaithe: (2005)

Reduce, reuse and recycle: efficiently solving multi-label MRFs
de réir: Alahari, K, et al.
Foilsithe / Cruthaithe: (2008)

Efficient discriminative learning of parts-based models
de réir: Kumar, MP, et al.
Foilsithe / Cruthaithe: (2010)

OBJCUT: efficient segmentation using top-down and bottom-up cues
de réir: Kumar, MP, et al.
Foilsithe / Cruthaithe: (2009)

Estimations of Covering Functionals of Convex Bodies Based on Relaxation Algorithm
de réir: Man Yu, et al.
Foilsithe / Cruthaithe: (2023-04-01)

Overcoming the convex barrier for simplex input
de réir: Behl, HS, et al.
Foilsithe / Cruthaithe: (2021)

On Convex Relaxations in Nonconvex Optimization
de réir: T. Westerlund, et al.
Foilsithe / Cruthaithe: (2011-04-01)

A convex relaxation for approximate global optimization in simultaneous localization and mapping
de réir: DuHadway, Charles, et al.
Foilsithe / Cruthaithe: (2017)

Distributed non-convex ADMM-based inference in large-scale random fields
de réir: Miksik, O, et al.
Foilsithe / Cruthaithe: (2014)

Scaling the convex barrier with active sets
de réir: De Palma, A, et al.
Foilsithe / Cruthaithe: (2021)

P3 & beyond: move making algorithms for solving higher order functions
de réir: Kohli, P, et al.
Foilsithe / Cruthaithe: (2008)

Bayesian model estimation and selection for epipolar geometry and generic manifold fitting
de réir: Torr, PHS
Foilsithe / Cruthaithe: (2002)

MLESAC: a new robust estimator with application to estimating image geometry
de réir: Torr, PHS, et al.
Foilsithe / Cruthaithe: (2000)

Efficient continuous relaxations for dense CRF
de réir: Bunel, R, et al.
Foilsithe / Cruthaithe: (2016)

An object category specific mrf for segmentation
de réir: Kumar, MP, et al.
Foilsithe / Cruthaithe: (2007)

Obj cut
de réir: Kumar, MP, et al.
Foilsithe / Cruthaithe: (2005)

Learning layered motion segmentations of video
de réir: Kumar, MP, et al.
Foilsithe / Cruthaithe: (2005)

Extending pictorial structures for object recognition
de réir: Kumar, MP, et al.
Foilsithe / Cruthaithe: (2004)

An invariant large margin nearest neighbour classifier
de réir: Kumar, MP, et al.
Foilsithe / Cruthaithe: (2007)

Feature based methods for structure and motion estimation
de réir: Torr, PHS, et al.
Foilsithe / Cruthaithe: (2002)

New convex relaxations for MRF inference with unknown graphs
de réir: Wang, Z, et al.
Foilsithe / Cruthaithe: (2020)

The Non-Tightness of a Convex Relaxation to Rotation Recovery
de réir: Yuval Alfassi, et al.
Foilsithe / Cruthaithe: (2021-11-01)

A convex relaxation approach for power flow problem
de réir: Saeed D. Manshadi, et al.
Foilsithe / Cruthaithe: (2019-01-01)

Polynomial Structure in Semidefinite Relaxations and Non-Convex Formulations
de réir: Yuan, Chenyang
Foilsithe / Cruthaithe: (2023)

The development and comparison of robust methods for estimating the fundamental matrix
de réir: Torr, PHS, et al.
Foilsithe / Cruthaithe: (1997)

PoseField: an efficient mean-field based method for joint estimation of human pose, segmentation, and depth
de réir: Vineet, V, et al.
Foilsithe / Cruthaithe: (2013)

Performance characterization of fundamental matrix estimation under image degradation
de réir: Torr, PHS, et al.
Foilsithe / Cruthaithe: (1997)

Dynamic graph cuts for efficient inference in Markov random fields
de réir: Kohli, P, et al.
Foilsithe / Cruthaithe: (2007)

Solving the convex ordered set problem
Foilsithe / Cruthaithe: (2003)

Convexity and boundedness relaxation for fixed point theorems in modular spaces
de réir: Fatemeh Lael, et al.
Foilsithe / Cruthaithe: (2021-04-01)