Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure

Author(s):  
A. Klaus ◽  
M. Sormann ◽  
K. Karner
Author(s):  
Xiaofeng Wang ◽  
Yingying Su ◽  
Liming Tang ◽  
Jie Tan

Belief propagation (BP) algorithm still exists some shortages, such as inaccurate edge preservation and ambiguous detail information in the foreground, while self-adapting dissimilarity measure (SDM) also exists some shortages, such as ill textureless and occluded information in the background. To address these problems, we present a novel stereo matching algorithm fusing BP and SDM with an excellent background and foreground information. Lots of experiments show that BP and SDM can complement each other. BP algorithm can hold the better background information due to message propagation inference, whereas SDM can possess the better foreground information due to detail treatment. Therefore, a piecewise function is proposed, which can combine BP algorithm in an excellent background information and SDM in the foreground information, and greatly improve the disparity effect as a whole. We also expect that this work can attract more attention on combination of local methods and global methods, due to its simplicity, efficiency, and accuracy. Experimental results show that the proposed method can keep the superior performance and hold better background and foreground on the Middlebury datasets, compared to BP and SDM.


Author(s):  
Chengzhi Luo ◽  
Jianjun Lei ◽  
Guanglong Hu ◽  
Kefeng Fan ◽  
Shupo Bu

Author(s):  
Jian Sun ◽  
Nan-Ning Zheng ◽  
Heung-Yeung Shum

2016 ◽  
Vol 46 (2) ◽  
pp. 029606
Author(s):  
FangFang CHEN ◽  
Yan SONG ◽  
YuGang TIAN ◽  
DongBo ZHU

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Cheng-Tao Zhu ◽  
Yau-Zen Chang ◽  
Huai-Ming Wang ◽  
Kai He ◽  
Shih-Tseng Lee ◽  
...  

Developing matching algorithms from stereo image pairs to obtain correct disparity maps for 3D reconstruction has been the focus of intensive research. A constant computational complexity algorithm to calculate dissimilarity aggregation in assessing disparity based on separable successive weighted summation (SWS) among horizontal and vertical directions was proposed but still not satisfactory. This paper presents a novel method which enables decoupled dissimilarity measure in the aggregation, further improving the accuracy and robustness of stereo correspondence. The aggregated cost is also used to refine disparities based on a local curve-fitting procedure. According to our experimental results on Middlebury benchmark evaluation, the proposed approach has comparable performance when compared with the selected state-of-the-art algorithms and has the lowest mismatch rate. Besides, the refinement procedure is shown to be capable of preserving object boundaries and depth discontinuities while smoothing out disparity maps.


2012 ◽  
Vol 546-547 ◽  
pp. 735-740
Author(s):  
Xing Nian Cui ◽  
Fan Yang ◽  
Qing Min Liao

In this paper, we present a stereo matching algorithm based on planar surface hypothesis. It improves the results of low texture regions and mixed pixels on object boundaries. First, regions are segmented by applying the mean-shift segmentation method. Then we propose a coarse-to-fine algorithm to increase the reliable correspondences in low texture regions. Third, the Belief Propagation algorithm is used to optimize disparity plane labeling. Finally, for a mixed pixel, we utilize the results of the depth plane and the local region of it to regulate its disparity. Experimental results using the Middlebury stereo test show that the performance of our method is high.


Sign in / Sign up

Export Citation Format

Share Document