收稿日期: 2017-11-23
网络出版日期: 2019-02-26
Stereo matching algorithm based on multi-feature fusion and tree structure aggregation
Received date: 2017-11-23
Online published: 2019-02-26
针对立体匹配中弱纹理区域和深度不连续区域的匹配精度问题, 提出了一种基于多特征融合的树形结构代价聚合立体匹配算法. 首先, 融合图像颜色、梯度和图像的 Census 变换进行匹配代价计算; 然后, 在由原始图像生成的最小生成树上进行匹配代价聚合, 并使用多方向扫描线优化, 进一步提升立体匹配的精确度; 最后, 使用左右一致性检测标记出误匹配点, 并进行视差修正. 为了验证该算法的有效性, 使用 Middlebury 测试集提供的测试图像进行测试, 平均误匹配率为 6.38%; 分别对 2 种场景实际拍摄图像进行深度信息提取误差率测试, 测试得到 2 种场景的测距误差率分别为 5.76% 和 5.55%, 证明了该算法的实用性.
郁怀波, 胡越黎, 徐杰 . 基于多特征融合与树形结构代价聚合的立体匹配算法[J]. 上海大学学报(自然科学版), 2019 , 25(1) : 66 -74 . DOI: 10.12066/j.issn.1007-2861.1987
reo matching in texture and depth discontinuities, a stereo matching algorithm based on multi-feature fusion and tree structure aggregation was proposed. The first step was color image fusion, gradient image Census transform and cost calculation. Next came the matching cost aggregation in the minimum spanning tree generated by the original image. Then the accuracy of stereo matching was further improved through using multi direction scanning line optimization. Finally, through using the left and right consistency check, error matching points were marked and parallax correction is made. In order to verify the effectiveness of the proposed algorithm, and the first set of test images provided were tested using the Middlebury test, and the average error rate is 6.38%; then on both actual scene images error rate testing for depth information extracted was conducted, and the test scenarios point to error rates at 5.76% and 5.55% respectively, demonstrating the practicality of the algorithm.
Key words: stereo matching; multi-feature fusion; minimum spanning tree
| [1] | Zhou Z, Wu D, Zhu Z . Stereo matching using dynamic programming based on differential smoothing[J]. Optik - International Journal for Light and Electron Optics, 2016,127(4):2287-2293. |
| [2] | 张红颖, 刘奕萱, 杨宇 . 快速收敛的置信度传播立体匹配算法[J]. 计算机应用, 2013,33(2):484-486. |
| [3] | Taniai T, Matsushita Y, Naemura T . Graph cut based continuous stereo matching using locally shared labels[C] //Computer Vision and Pattern Recognition. 2014: 1613-1620. |
| [4] | Zhan Y, Gu Y, Huang K , et al. Accurate image-guided stereo matching with efficient matching cost and disparity refinement[J]. IEEE Transactions on Circuits and Systems for Video Technology, 2016,26(9):1632-1645. |
| [5] | 祝世平, 李政 . 基于改进梯度和自适应窗口的立体匹配算法[J]. 光学学报, 2015,35(1):110003. |
| [6] | Hirschmuller H . Stereo processing by semiglobal matching and mutual information[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2007,30(2):328-341. |
| [7] | Zhang K, Lu J, Lafruit G . Cross-based local stereo matching using orthogonal integral images[J]. IEEE Transactions on Circuits and Systems for Video Technology, 2009,19(7):1073-1079. |
| [8] | Shi H, Zhu H, Wang J , et al. Segment-based adaptive window and multi-feature fusion for stereo matching[J]. Journal of Algorithms and Computational Technology, 2016,10(1):184-200. |
| [9] | Hong P N, Chang W A . Stereo matching using fusion of spatial weight variable window and adaptive support weight[J]. International Journal of Computer and Electrical Engineering, 2014,6(3):211-217. |
| [10] | 王军政, 朱华健, 李静 . 一种基于Census 变换的可变权值立体匹配算法[J]. 北京理工大学学报, 2013,33(7):704-710. |
| [11] | Yang Q . A non-local cost aggregation method for stereo matching[C] //Computer Vision and Pattern Recognition. 2012: 1402-1409. |
| [12] | Long Q, Xie Q W, Mita S , et al. A real-time dense stereo matching method for critical environment sensing in autonomous driving[C] //IEEE International Conference on Intelligent Transportation Systems. 2014: 853-860. |
/
| 〈 |
|
〉 |