Sciweavers

42 search results - page 2 / 9
» Stereo Matching Using Scanline Disparity Discontinuity Optim...
Sort
View
CVPR
2005
IEEE
14 years 7 months ago
Stereo Correspondence by Dynamic Programming on a Tree
Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art becau...
Olga Veksler
IJCV
2002
129views more  IJCV 2002»
13 years 4 months ago
A Hierarchical Symmetric Stereo Algorithm Using Dynamic Programming
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...
G. Van Meerbergen, Maarten Vergauwen, Marc Pollefe...
CVPR
2004
IEEE
14 years 7 months ago
Window-Based, Discontinuity Preserving Stereo
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
Motilal Agrawal, Larry S. Davis
CVPR
2006
IEEE
14 years 7 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
PAMI
1998
93views more  PAMI 1998»
13 years 4 months ago
Stereo Matching as a Nearest-Neighbor Problem
—We propose a representation of images, called intrinsic curves, that transforms stereo matching from a search problem into a nearest-neighbor problem. Intrinsic curves are the p...
Carlo Tomasi, Roberto Manduchi