190 search results - page 23 / 38 » Markov Random Fields with Efficient Approximations |
TSP
2008
13 years 7 months ago
2008
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
BMVC
2002
13 years 10 months ago
2002
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Learning undirected graphical models such as Markov random fields is an important machine learning task with applications in many domains. Since it is usually intractable to learn...
VMV
2008
13 years 9 months ago
2008
This work presents a real-time, data-parallel approach for global label assignment on regular grids. The labels are selected according to a Markov random field energy with a Potts...
NIPS
2007
13 years 9 months ago
2007
We give a new class of outer bounds on the marginal polytope, and propose a cutting-plane algorithm for efficiently optimizing over these constraints. When combined with a concav...