Improved Census Transform Method for Semi-Global Matching Algorithm

Author(s):  
Xie Pan ◽  
Guoben Jun ◽  
Yuanping Xu ◽  
Zhijie Xu ◽  
Tukun Li ◽  
...  
Author(s):  
Han Hu ◽  
Chongtai Chen ◽  
Bo Wu ◽  
Xiaoxia Yang ◽  
Qing Zhu ◽  
...  

Textureless and geometric discontinuities are major problems in state-of-the-art dense image matching methods, as they can cause visually significant noise and the loss of sharp features. Binary census transform is one of the best matching cost methods but in textureless areas, where the intensity values are similar, it suffers from small random noises. Global optimization for disparity computation is inherently sensitive to parameter tuning in complex urban scenes, and must compromise between smoothness and discontinuities. The aim of this study is to provide a method to overcome these issues in dense image matching, by extending the industry proven Semi-Global Matching through 1) developing a ternary census transform, which takes three outputs in a single order comparison and encodes the results in two bits rather than one, and also 2) by using texture-information to self-tune the parameters, which both preserves sharp edges and enforces smoothness when necessary. Experimental results using various datasets from different platforms have shown that the visual qualities of the triangulated point clouds in urban areas can be largely improved by these proposed 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


Optik ◽  
2021 ◽  
pp. 168186
Author(s):  
Yuguang Hou ◽  
Changying Liu ◽  
Bowen An ◽  
Yang Liu

2018 ◽  
Vol 38 (2) ◽  
pp. 0215006
Author(s):  
范海瑞 Fan Hairui ◽  
杨帆 Yang Fan ◽  
潘旭冉 Pan Xuran ◽  
温洁 Wen Jie ◽  
王晓宇 Wang Xiaoyu

2014 ◽  
Vol 536-537 ◽  
pp. 67-76
Author(s):  
Xiang Zhang ◽  
Zhang Wei Chen

This paper proposes a FPGA implementation to apply a stereo matching algorithm based on a kind of sparse census transform in a FPGA chip which can provide a high-definition dense disparity map in real-time. The parallel stereo matching algorithm core involves census transform, cost calculation and cost aggregation modules. The circuits of the algorithm core are modeled by the Matlab/Simulink-based tool box: DSP Builder. The system can process many different sizes of stereo pair images through a configuration interface. The maximum horizon resolution of stereo images is 2048.


Sign in / Sign up

Export Citation Format

Share Document