Underwater stereo-matching algorithm based on belief propagation

Author(s):  
Yongbing Xu ◽  
Dabing Yu ◽  
Yunpeng Ma ◽  
Qingwu Li ◽  
Yaqin Zhou
2016 ◽  
Vol 46 (2) ◽  
pp. 029606
Author(s):  
FangFang CHEN ◽  
Yan SONG ◽  
YuGang TIAN ◽  
DongBo ZHU

2015 ◽  
Vol 2015 ◽  
pp. 1-13
Author(s):  
Hui Li ◽  
Xiao-Guang Zhang ◽  
Zheng Sun

In traditional adaptive-weight stereo matching, the rectangular shaped support region requires excess memory consumption and time. We propose a novel line-based stereo matching algorithm for obtaining a more accurate disparity map with low computation complexity. This algorithm can be divided into two steps: disparity map initialization and disparity map refinement. In the initialization step, a new adaptive-weight model based on the linear support region is put forward for cost aggregation. In this model, the neural network is used to evaluate the spatial proximity, and the mean-shift segmentation method is used to improve the accuracy of color similarity; the Birchfield pixel dissimilarity function and the census transform are adopted to establish the dissimilarity measurement function. Then the initial disparity map is obtained by loopy belief propagation. In the refinement step, the disparity map is optimized by iterative left-right consistency checking method and segmentation voting method. The parameter values involved in this algorithm are determined with many simulation experiments to further improve the matching effect. Simulation results indicate that this new matching method performs well on standard stereo benchmarks and running time of our algorithm is remarkably lower than that of algorithm with rectangle-shaped support region.


2013 ◽  
Vol 33 (2) ◽  
pp. 484-486
Author(s):  
Hongying ZHANG ◽  
Yixuan LIU ◽  
Yu YANG

2015 ◽  
Vol 713-715 ◽  
pp. 1931-1934
Author(s):  
Si Chen Pan

Stereo matching methods are widely used in computer vision and stereo reconstruction, from the perspective of improving the matching accuracy, this paper focuses on the global optimization algorithm. An improved Belief Propagation method is proposed in this paper, by involving more pixels into information transmission, our method improves the accuracy ofstereo matching. The experimental results verify the efficiencyand reliability of our method.


2011 ◽  
Vol 19 (11) ◽  
pp. 2774-2781 ◽  
Author(s):  
周自维 ZHOU Zi-wei ◽  
樊继壮 FAN Ji-zhuang ◽  
赵杰 ZHAO Jie ◽  
刘晓丽 LIU Xiao-li

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.


2021 ◽  
Vol 13 (2) ◽  
pp. 274
Author(s):  
Guobiao Yao ◽  
Alper Yilmaz ◽  
Li Zhang ◽  
Fei Meng ◽  
Haibin Ai ◽  
...  

The available stereo matching algorithms produce large number of false positive matches or only produce a few true-positives across oblique stereo images with large baseline. This undesired result happens due to the complex perspective deformation and radiometric distortion across the images. To address this problem, we propose a novel affine invariant feature matching algorithm with subpixel accuracy based on an end-to-end convolutional neural network (CNN). In our method, we adopt and modify a Hessian affine network, which we refer to as IHesAffNet, to obtain affine invariant Hessian regions using deep learning framework. To improve the correlation between corresponding features, we introduce an empirical weighted loss function (EWLF) based on the negative samples using K nearest neighbors, and then generate deep learning-based descriptors with high discrimination that is realized with our multiple hard network structure (MTHardNets). Following this step, the conjugate features are produced by using the Euclidean distance ratio as the matching metric, and the accuracy of matches are optimized through the deep learning transform based least square matching (DLT-LSM). Finally, experiments on Large baseline oblique stereo images acquired by ground close-range and unmanned aerial vehicle (UAV) verify the effectiveness of the proposed approach, and comprehensive comparisons demonstrate that our matching algorithm outperforms the state-of-art methods in terms of accuracy, distribution and correct ratio. The main contributions of this article are: (i) our proposed MTHardNets can generate high quality descriptors; and (ii) the IHesAffNet can produce substantial affine invariant corresponding features with reliable transform parameters.


Sign in / Sign up

Export Citation Format

Share Document