ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Conference Paper A dense stereo matching using two-pass dynamic programming with generalized ground control points
Cited 171 time in scopus Share share facebook twitter linkedin kakaostory
Authors
Jae Chul Kim, Kyoung Mu Lee, Byoung Tae Choi, Sang Uk Lee
Issue Date
2005-06
Citation
Conference on Computer Vision and Pattern Recognition (CVPR) 2005, pp.1-8
Language
English
Type
Conference Paper
DOI
https://dx.doi.org/10.1109/cvpr.2005.22
Abstract
A method for solving dense stereo matching problem is presented in this paper. First, a new generalized ground control points (GGCPs) scheme is introduced, where one or more disparity candidates for the true disparity of each pixel are assigned by local matching using the oriented spatial filters. By allowing "all" pixels to have multiple candidates for their true disparities, GGCPs not only guarantee to provide a sufficient number of starting pixels needed for guiding the subsequent matching process, but also remarkably reduce the risk of false match, improving the previous GCP-based approaches where the number of the selected control points tends to be inversely proportional to the reliability. Second, by employing a two-pass dynamic programming technique that performs optimization both along and across the scanlines, we solve the typical inter-scanline inconsistency problem. Moreover, combined with the GGCPs, the stability and efficiency of the optimization are improved significantly. Experimental results for the standard data sets show that the proposed algorithm achieves comparable results to the state-of-the-arts with much less computational cost.
KSP Keywords
Data sets, Dense stereo matching, Dynamic programming technique, Local matching, Matching Problem, Matching Process, Spatial Filter, Subsequent Matching, computational cost, false match, ground control points