Sciweavers

190 search results - page 29 / 38
» Markov Random Fields with Efficient Approximations
Sort
View
CVPR
2010
IEEE
14 years 3 months ago
A Generative Perspective on MRFs in Low-Level Vision
Markov random fields (MRFs) are popular and generic probabilistic models of prior knowledge in low-level vision. Yet their generative properties are rarely examined, while applica...
Uwe Schmidt, Qi Gao, Stefan Roth
ICPR
2000
IEEE
13 years 11 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu
ICASSP
2009
IEEE
13 years 5 months ago
Fast belief propagation process element for high-quality stereo estimation
Belief propagation is a popular global optimization technique for many computer vision problems. However, it requires extensive computation due to the iterative message passing op...
Chao-Chung Cheng, Chia-Kai Liang, Yen-Chieh Lai, H...
IPPS
2010
IEEE
13 years 5 months ago
On the parallelisation of MCMC by speculative chain execution
Abstract--The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov C...
Jonathan M. R. Byrd, Stephen A. Jarvis, Abhir H. B...
ICCV
2005
IEEE
14 years 9 months ago
Globally Optimal Solutions for Energy Minimization in Stereo Vision Using Reweighted Belief Propagation
A wide range of low level vision problems have been formulated in terms of finding the most probable assignment of a Markov Random Field (or equivalently the lowest energy configu...
Talya Meltzer, Chen Yanover, Yair Weiss