25 search results - page 1 / 5 » Stereo Matching with Symmetric Cost Functions |
CVPR
2006
IEEE
14 years 6 months ago
2006
IEEE
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 ...
IJCV
2002
13 years 4 months ago
2002
In this paper, a new hierarchical stereo algorithm is presented. The algorithm matches individual pixels in corresponding scanlines by minimizing a cost function. Several cost fun...
ICCV
2005
IEEE
14 years 6 months ago
2005
IEEE
Most dense stereo correspondence algorithms start by establishing discrete pixel matches and later refine these matches to sub-pixel precision. Traditional sub-pixel refinement me...
CVPR
2007
IEEE
14 years 6 months ago
2007
IEEE
Stereo correspondence methods rely on matching costs for computing the similarity of image locations. In this paper we evaluate the insensitivity of different matching costs with ...
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching between two uncalibrated wide-baseline images by exploiting the results of sparse...