An analysis of convex relaxations for MAP estimation

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

Fuld beskrivelse

Bibliografiske detaljer
Main Authors:	Kumar, MP, Kolmogorov, V, Torr, PHS
Format:	Conference item
Sprog:	English
Udgivet:	Curran Associates 2008

Lignende værker

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)

Efficiently solving convex relaxations for MAP estimation
af: Kumar, MP, et al.
Udgivet: (2008)

Improved moves for truncated convex models
af: Kumar, MP, 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: Pawan Kumar, M, et al.
Udgivet: (2011)

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

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

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

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)

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

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

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

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)

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

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

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)

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

Performance Analysis of Regularized Convex Relaxation for Complex-Valued Data Detection
af: Ayed M. Alrashdi, et al.
Udgivet: (2022-05-01)

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)

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

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

Geometric multi-model fitting with a convex relaxation algorithm
af: Amayo, P, et al.
Udgivet: (2018)

Relaxation methods for network flow problems with convex arc costs
Udgivet: (2003)

Distributed asynchronous relaxation methods for convex network flow problems
Udgivet: (2002)

Higher order priors for joint intrinsic image, objects, and attributes estimation
af: Vineet, V, et al.
Udgivet: (2014)

Dynamic hybrid algorithms for MAP inference in discrete MRFs
af: Alahari, K, et al.
Udgivet: (2009)

On some inequalities for uniformly convex mapping with estimations to normal distributions
af: Saad Ihsan Butt, et al.
Udgivet: (2023-06-01)