3D entity-based stereo matching with ground control points and joint second-order smoothness prior

被引:18
作者
Liu, Jing [1 ,2 ]
Li, Chunpeng [1 ]
Mei, Feng [1 ,2 ]
Wang, Zhaoqi [1 ]
机构
[1] Chinese Acad Sci, Beijing Key Lab Mobile Comp & Pervas Device, Inst Comp Technol, Beijing 100190, Peoples R China
[2] Univ Chinese Acad Sci, Beijing 100049, Peoples R China
基金
国家高技术研究发展计划(863计划); 中国国家自然科学基金;
关键词
Stereo matching; Joint second-order smoothness prior; GCPs-plane; Fusion-move; 3D entity; BELIEF PROPAGATION; COST AGGREGATION; GRAPH;
D O I
10.1007/s00371-014-1009-3
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Disparity estimation for a scene with complex geometric characteristics such as slanted or highly curved surfaces is a basic and important issue in stereo matching. Traditional methods often use first-order smoothness priors that always lead to low-curvature frontal-parallel disparity maps. We propose a stereo framework that views the scene as a set of 3D entities with compact and smooth disparity distributions. The 3D entity-based representation enables some contributions to obtain a precise disparity estimation. A GCPs-plane constraint based on ground control points is used to strengthen the compact distributions of the disparities in each entity by restricting the scope of the disparity variance and reducing matching ambiguities in repetitive or low-texture areas. Furthermore, we have formulated a joint second-order smoothness prior, which combines a geometric weight with the derivative of disparity values. This prior encourages smooth disparity variations inside each entity and means that each entity is biased towards being a 3D planar surface. Segmentation is incorporated as soft constraint by effectively fusing the advantages of the image color gradient and GCPs-plane. This avoids blending of the foreground and background and retains only the disparity discontinuities from geometrically smooth regions with strong texture gradients. Our framework is formulated as a maximum a posteriori probability estimation problem that is optimized using the fusion-move approach. Evaluation results on the Middlebury benchmark show that the proposed method ranks second among the approximately listed algorithms. In addition, it performs well in real-world scenes.
引用
收藏
页码:1253 / 1269
页数:17
相关论文
共 45 条
[1]  
[Anonymous], INT C COMP SOFTW MOD
[2]  
[Anonymous], IEEE C COMP VIS PATT
[3]  
[Anonymous], 2007, IEEE C COMP VIS PATT, DOI DOI 10.1109/CVPR.2007.383203
[4]   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
[5]   A layered stereo matching algorithm using image segmentation and global visibility constraints [J].
Bleyer, M ;
Gelautz, M .
ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, 2005, 59 (03) :128-150
[6]   PatchMatch Stereo - Stereo Matching with Slanted Support Windows [J].
Bleyer, Michael ;
Rhemann, Christoph ;
Rother, Carsten .
PROCEEDINGS OF THE BRITISH MACHINE VISION CONFERENCE 2011, 2011,
[7]  
Bleyer M, 2010, PROC CVPR IEEE, P1570, DOI 10.1109/CVPR.2010.5539783
[8]  
Boros E, 2006, Tech rep, RRR 10-2006
[9]   A fast area-based stereo matching algorithm [J].
Di Stefano, L ;
Marchionni, M ;
Mattoccia, S .
IMAGE AND VISION COMPUTING, 2004, 22 (12) :983-1005
[10]   Efficient graph-based image segmentation [J].
Felzenszwalb, PF ;
Huttenlocher, DP .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2004, 59 (02) :167-181