15 search results - page 1 / 3 » Improving subpixel stereo matching with segment evolution |
ICIP
2010
IEEE
13 years 2 months ago
2010
IEEE
Segmentation-based approach has shown significant success in stereo matching. By assuming pixels within one image segment belong to the same 3D surface, robust depth estimation ca...
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
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 ...
TSMC
2008
13 years 4 months ago
2008
Abstract--This paper proposes algorithms for iris segmentation, quality enhancement, match score fusion, and indexing to improve both the accuracy and the speed of iris recognition...
ICIAP
2007
ACM
13 years 6 months ago
2007
ACM
The paper deals with the design and implementation of a stereo algorithm. Disparity map is formulated as a Markov Random Field with a new smoothness constraint depending not only ...