108 search results - page 2 / 22 » Efficiently solving convex relaxations for MAP estimation |
NIPS
2008
13 years 6 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
ICML
2010
IEEE
13 years 5 months ago
2010
IEEE
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
PAMI
2011
12 years 11 months ago
2011
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
In this paper, we consider the problem of geolocating an unknown emitter by a satellite cluster. We formulate the problem as the maximum likelihood location estimation by using TD...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...