Coarse-to-fine stereo vision with accurate 3D boundaries

被引:32
作者
Sizintsev, Mikhail [1 ]
Wildes, Richard P.
机构
[1] York Univ, Dept Comp Sci & Engn, Toronto, ON M3J 1P3, Canada
关键词
Computer vision; Stereo; Coarse-to-fine; Occlusions; Real-time algorithms; ENERGY MINIMIZATION; ALGORITHM; PROPAGATION;
D O I
10.1016/j.imavis.2009.06.008
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents methods for efficient recovery of accurate binocular disparity estimates in the vicinity of 3D surface discontinuities. Of particular concern are methods that impact coarse-to-fine, local block-based matching as it forms the basis of the fastest and the most resource efficient stereo computation procedures. A novel coarse-to-fine refinement procedure that adapts match window support across scale to ameliorate corruption of disparity estimates near boundaries is presented. Extensions are included to account for half-occlusions and colour uniformity. Empirical results show that incorporation of these advances in the standard coarse-to-fine, block matching framework reduces disparity errors by more than a factor of two, while performing little extra computation, preserving low complexity and the parallel/pipeline nature of the framework. Moreover, the proposed advances prove to be beneficial for CTF global matchers as well. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:352 / 366
页数:15
相关论文
共 57 条
[1]  
AGARWAL A, 2006, P IEEE C COMP VIS PA, P2339
[2]   A COMPUTATIONAL FRAMEWORK AND AN ALGORITHM FOR THE MEASUREMENT OF VISUAL-MOTION [J].
ANANDAN, P .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1989, 2 (03) :283-310
[3]  
[Anonymous], 1994, Scale-Space Theory in Computer Vision
[4]  
[Anonymous], 2006, P BMVC CIT
[5]   A pixel dissimilarity measure that is insensitive to image sampling [J].
Birchfield, S ;
Tomasi, C .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1998, 20 (04) :401-406
[6]   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
[7]   An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision [J].
Boykov, Y ;
Kolmogorov, V .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (09) :1124-1137
[8]   Disparity component matching for visual correspondence [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
1997 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, 1997, :470-475
[9]   Advances in computational stereo [J].
Brown, MZ ;
Burschka, D ;
Hager, GD .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2003, 25 (08) :993-1008
[10]  
*BROWN U, 2006, BROWN U IM SEQ