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

Fuld beskrivelse

Bibliografiske detaljer
Main Authors:	Kumar, MP, Torr, PHS
Format:	Conference item
Sprog:	English
Udgivet:	Association for Computing Machinery 2008

Lignende værker

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Obj cut
af: Kumar, MP, et al.
Udgivet: (2005)

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

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

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

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

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

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

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

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

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

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

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

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

Solving the convex ordered set problem
Udgivet: (2003)

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