Near-real-time stereo matching method using temporal and spatial propagation of reliable disparity

被引:7
作者
Kang, Sungil [1 ]
Hong, Hyunki [2 ]
机构
[1] Chung Ang Univ, Grad Sch Adv Imaging Sci & Arts, Seoul 156756, South Korea
[2] Chung Ang Univ, Sch Integrat Engn, Seoul 156756, South Korea
基金
新加坡国家研究基金会;
关键词
stereo matching; correspondence; disparity map; reliability; compute unified device architecture programming;
D O I
10.1117/1.OE.53.6.063107
中图分类号
O43 [光学];
学科分类号
070207 [光学];
摘要
A stereo approach to resolve the occlusion problem in stereo video sequence is introduced. We define a measure to evaluate the reliability of an initial disparity in combination with a left-right consistency check. An initial matching cost volume is computed with an absolute difference-census measure. In the spatial propagation stage, the outlier with a low reliability value is replaced/updated with the reliable disparity information in the support region. Because previous methods establish correspondence on a per-frame basis, they cannot obtain temporally coherent disparity results over a stereo sequence. In order to overcome the occlusion problem in a dynamic situation, we employ the modified codebook with color, disparity, reliability, array of the matching cost, and final access time in a temporal propagation procedure. Experimental results show that the proposed algorithm with general-purpose computing on graphics processing units (GPGPU) provides better performance when applied to disparity maps of realtime indoor/outdoor scenes. (C) The Authors. Published by SPIE under a Creative Commons Attribution 3.0 Unported License. Distribution or reproduction of this work in whole or in part requires full attribution of the original publication, including its DOI.
引用
收藏
页数:10
相关论文
共 27 条
[1]
[Anonymous], P BRIT MACH VIS C BR
[2]
[Anonymous], P ECCV
[3]
PatchMatch Stereo - Stereo Matching with Slanted Support Windows [J].
Bleyer, Michael ;
Rhemann, Christoph ;
Rother, Carsten .
PROCEEDINGS OF THE BRITISH MACHINE VISION CONFERENCE 2011, 2011,
[4]
Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239
[5]
Cook S., 2012, NVIDIA GPU PROGRAMMI
[6]
Near-real-time stereo matching with slanted surface modeling and sub-pixel accuracy [J].
Gong, Minglun ;
Zhang, Yilei ;
Yang, Yee-Hong .
PATTERN RECOGNITION, 2011, 44 (10-11) :2701-2710
[7]
Hirschmüller H, 2008, IEEE T PATTERN ANAL, V30, P328, DOI 10.1109/TPAMl.2007.1166
[8]
Evaluation of Stereo Matching Costs on Images with Radiometric Differences [J].
Hirschmueller, Heiko ;
Scharstein, Daniel .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2009, 31 (09) :1582-1599
[9]
Hong L, 2004, PROC CVPR IEEE, P74
[10]
Ke Zhang, 2009, 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops, P794, DOI 10.1109/ICCVW.2009.5457623