10148 search results - page 1692 / 2030 » Optimal sub-graphical models |
327
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
179
click to vote
FOCS
2005
IEEE
16 years 12 days ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
175
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
236
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
In this paper, we present a stochastic algorithm by effective Markov chain Monte Carlo (MCMC) for segmenting and reconstructing 3D scenes. The objective is to segment a range image...
162
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
Image-based rendering data sets, such as light fields, require efficient compression due to their large data size, but also easy random access when rendering from the data set. Ef...