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

Bibliografske podrobnosti
Main Authors:	Kumar, MP, Kolmogorov, V, Torr, PHS
Format:	Conference item
Jezik:	English
Izdano:	Curran Associates 2008

Podobne knjige/članki

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Obj cut
od: Kumar, MP, et al.
Izdano: (2005)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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