Binocular stereo matching algorithm based on MST cost aggregation

Abstract

For common binocular stereo matching algorithms in computer vision, it is not easy to obtain high precision and high matching speed at the same time. In this paper, an improved binocular stereo matching algorithm based on Minimum Spanning Tree (MST) cost aggregation is proposed. Firstly, the performance of the parallel algorithm can be improved by reducing the height of the tree. Then, an improved Root to Leaf (L2R) cost aggregation algorithm is proposed. By combining stereo matching technology with parallel computing technology, the above method can realize synchronous parallel computing at the algorithm level. Experimental results show that the improved algorithm has high accuracy and high matching speed for binocular stereo vision.

Keywords

• binocular vision
• stereo matching
• cost aggregation
• minimum spanning tree