scholarly journals Asymmetric Learning for Stereo Matching Cost Computation

2020 ◽  
Vol E103.D (10) ◽  
pp. 2162-2167
Author(s):  
Zhongjian MA ◽  
Dongzhen HUANG ◽  
Baoqing LI ◽  
Xiaobing YUAN
Author(s):  
E. Dall'Asta ◽  
R. Roncella

Encouraged by the growing interest in automatic 3D image-based reconstruction, the development and improvement of robust stereo matching techniques is one of the most investigated research topic of the last years in photogrammetry and computer vision.<br><br> The paper is focused on the comparison of some stereo matching algorithms (local and global) which are very popular both in photogrammetry and computer vision. In particular, the Semi-Global Matching (SGM), which realizes a pixel-wise matching and relies on the application of consistency constraints during the matching cost aggregation, will be discussed.<br><br> The results of some tests performed on real and simulated stereo image datasets, evaluating in particular the accuracy of the obtained digital surface models, will be presented. Several algorithms and different implementation are considered in the comparison, using freeware software codes like MICMAC and OpenCV, commercial software (e.g. Agisoft PhotoScan) and proprietary codes implementing Least Square e Semi-Global Matching algorithms. The comparisons will also consider the completeness and the level of detail within fine structures, and the reliability and repeatability of the obtainable data.


2015 ◽  
Author(s):  
Qingxing Yue ◽  
Xinming Tang ◽  
Xiaoming Gao

2016 ◽  
Vol 26 (9) ◽  
pp. 1632-1645 ◽  
Author(s):  
Yunlong Zhan ◽  
Yuzhang Gu ◽  
Kui Huang ◽  
Cheng Zhang ◽  
Keli Hu

2020 ◽  
Author(s):  
Chih-Shuan Huang ◽  
Ya-Han Huang ◽  
Din-Yuen Chan ◽  
Jar-Ferr Yang

Abstract Stereo matching is one of the most important topics in computer vision and aims at generating precise depth maps for various applications. The main challenge of stereo matching is to suppress inevitable errors occurring in smooth, occluded and discontinuous regions. To solve the aforementioned problems, in this paper, the proposed robust stereo matching system by using segment-based superpixels and magapixels to design adaptive stereo matching computation and dual-path refinement. After determination for edge and smooth regions and selection of matching cost, we suggest the segment–based adaptive support weights in cost aggregation instead of color similarity and spatial proximity only. The proposed dual-path depth refinements utilize the cross-based support region by referring texture features to correct the inaccurate disparities with iterative procedures to improve the depth maps for shape reserving. Specially for left-most and right most regions, the segment-based refinement can greatly improve the mismatched disparity holes. The experimental results demonstrate that the proposed system can obtain higher accurate depth maps compared with the conventional methods.


Author(s):  
A. F. Kadmin ◽  
◽  
R. A. Hamzah ◽  
M. N. Abd Manap ◽  
M. S. Hamid ◽  
...  

Stereo matching is a significant subject in the stereo vision algorithm. Traditional taxonomy composition consists of several issues in the stereo correspondences process such as radiometric distortion, discontinuity, and low accuracy at the low texture regions. This new taxonomy improves the local method of stereo matching algorithm based on the dynamic cost computation for disparity map measurement. This method utilised modified dynamic cost computation in the matching cost stage. A modified Census Transform with dynamic histogram is used to provide the cost volume. An adaptive bilateral filtering is applied to retain the image depth and edge information in the cost aggregation stage. A Winner Takes All (WTA) optimisation is applied in the disparity selection and a left-right check with an adaptive bilateral median filtering are employed for final refinement. Based on the dataset of standard Middlebury, the taxonomy has better accuracy and outperformed several other state-ofthe-art algorithms. Keywords—Stereo matching, disparity map, dynamic cost, census transform, local method


2021 ◽  
Vol 2021 ◽  
pp. 1-20
Author(s):  
Lingyin Kong ◽  
Jiangping Zhu ◽  
Sancong Ying

Adaptive cross-region-based guided image filtering (ACR-GIF) is a commonly used cost aggregation method. However, the weights of points in the adaptive cross-region (ACR) are generally not considered, which affects the accuracy of disparity results. In this study, we propose an improved cost aggregation method to address this issue. First, the orthogonal weight is proposed according to the structural feature of the ACR, and then the orthogonal weight of each point in the ACR is computed. Second, the matching cost volume is filtered using ACR-GIF with orthogonal weights (ACR-GIF-OW). In order to reduce the computing time of the proposed method, an efficient weighted aggregation computing method based on orthogonal weights is proposed. Additionally, by combining ACR-GIF-OW with our recently proposed matching cost computation method and disparity refinement method, a local stereo matching algorithm is proposed as well. The results of Middlebury evaluation platform show that, compared with ACR-GIF, the proposed cost aggregation method can significantly improve the disparity accuracy with less additional time overhead, and the performance of the proposed stereo matching algorithm outperforms other state-of-the-art local and nonlocal algorithms.


Sign in / Sign up

Export Citation Format

Share Document