A stereo matching using variable windows and dynamic programming

Authors:
Won-Pyo Dong;Yun-Seok Lee;Chang-Sung Jeong
Affiliations:
Department of Electronics Engineering, Korea University, Seoul, Korea;Department of Electronics Engineering, Korea University, Seoul, Korea;Department of Electronics Engineering, Korea University, Seoul, Korea
Venue:
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Year:
2005

Citing 4
Cited 0

Watershed-based segmentation and region merging

Computer Vision and Image Understanding
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms

International Journal of Computer Vision
A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Dense Stereo Matching Using Two-Pass Dynamic Programming with Generalized Ground Control Points

CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a segment-based stereo matching algorithm using adaptive variable windows and dynamic programming with a robust disparity. We solve the problem of window shape and size using adaptive line masks and adaptive rectangular windows which are constrained by segments and visibility that reduces ambiguity produced by the occlusion in the computation window. In dynamic programming, we also propose the method that selects an efficient occlusion penalty.