Stereo using monocular cues within the tensor voting framework

被引:34
作者
Mordohai, P [1 ]
Medioni, G
机构
[1] Univ N Carolina, Dept Comp Sci, Chapel Hill, NC 27599 USA
[2] Univ So Calif, Inst Robot & Intelligent Syst, Los Angeles, CA 90083 USA
基金
美国国家科学基金会;
关键词
stereo; occlusion; pixel correspondence; computer vision; perceptual organization; tensor voting;
D O I
10.1109/TPAMI.2006.129
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We address the fundamental problem of matching in two static images. The remaining challenges are related to occlusion and lack of texture. Our approach addresses these difficulties within a perceptual organization framework, considering both binocular and monocular cues. Initially, matching candidates for all pixels are generated by a combination of matching techniques. The matching candidates are then embedded in disparity space, where perceptual organization takes place in 3D neighborhoods and, thus, does not suffer from problems associated with scanline or image neighborhoods. The assumption is that correct matches produce salient, coherent surfaces, while wrong ones do not. Matching candidates that are consistent with the surfaces are kept and grouped into smooth layers. Thus, we achieve surface segmentation based on geometric and not photometric properties. Surface overextensions, which are due to occlusion, can be corrected by removing matches whose projections are not consistent in color with their neighbors of the same surface in both images. Finally, the projections of the refined surfaces on both images are used to obtain disparity hypotheses for unmatched pixels. The final disparities are selected after a second tensor voting stage, during which information is propagated from more reliable pixels to less reliable ones. We present results on widely used benchmark stereo pairs.
引用
收藏
页码:968 / 982
页数:15
相关论文
共 46 条
  • [1] Agrawal M, 2004, PROC CVPR IEEE, P66
  • [2] Belhumeur P. N., 1992, Proceedings. 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.92CH3168-2), P506, DOI 10.1109/CVPR.1992.223143
  • [3] A Bayesian approach to binocular stereopsis
    Belhumeur, PN
    [J]. INTERNATIONAL JOURNAL OF COMPUTER VISION, 1996, 19 (03) : 237 - 260
  • [4] Birchfield S., 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision, P489, DOI 10.1109/ICCV.1999.791261
  • [5] A pixel dissimilarity measure that is insensitive to image sampling
    Birchfield, S
    Tomasi, C
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1998, 20 (04) : 401 - 406
  • [6] Depth discontinuities by pixel-to-pixel stereo
    Birchfield, S
    Tomasi, C
    [J]. SIXTH INTERNATIONAL CONFERENCE ON COMPUTER VISION, 1998, : 1073 - 1080
  • [7] Large occlusion stereo
    Bobick, AF
    Intille, SS
    [J]. INTERNATIONAL JOURNAL OF COMPUTER VISION, 1999, 33 (03) : 181 - 200
  • [8] Fast approximate energy minimization via graph cuts
    Boykov, Y
    Veksler, O
    Zabih, R
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) : 1222 - 1239
  • [9] Advances in computational stereo
    Brown, MZ
    Burschka, D
    Hager, GD
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2003, 25 (08) : 993 - 1008
  • [10] A maximum likelihood stereo algorithm
    Cox, IJ
    Hingorani, SL
    Rao, SB
    Maggs, BM
    [J]. COMPUTER VISION AND IMAGE UNDERSTANDING, 1996, 63 (03) : 542 - 567