Sciweavers

38 search results - page 1 / 8
» Stereo matching using random walks
Sort
View
53
Voted
ICPR
2008
IEEE
15 years 4 months ago
Stereo matching using random walks
This paper presents a novel two-phase stereo matching algorithm using the random walks framework. At first, a set of reliable matching pixels is extracted with prior matrices deļ...
Rui Shen, Irene Cheng, Xiaobo Li, Anup Basu
ACCV
2009
Springer
15 years 4 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee
ECCV
2002
Springer
15 years 11 months ago
Stereo Matching Using Belief Propagation
In this paper, we formulate the stereo matching problem as a Markov network consisting of three coupled Markov random fields (MRF's). These three MRF's model a smooth fie...
Jian Sun, Heung-Yeung Shum, Nanning Zheng
CVPR
2006
IEEE
15 years 11 months ago
Stereo Matching with Symmetric Cost Functions
Recently, many global stereo methods have achieved good results by modeling a disparity surface as a Markov random field (MRF) and by solving an optimization problem with various ...
Kuk-Jin Yoon, In-So Kweon
CRV
2007
IEEE
161views Robotics» more  CRV 2007»
15 years 4 months ago
Dense Stereo Range Sensing with Marching Pseudo-Random Patterns
As an extension to classical structured lighting techniques, the use of bi-dimensional pseudo-random color codes is explored to perform range sensing with variable density from a ...
Danick Desjardins, Pierre Payeur