摘要
立体匹配是计算机立体视觉的研究核心.根据约束条件的不同,将立体匹配算法分为三类:全局立体匹配算法、半全局立体匹配算法和局部立体匹配算法.介绍了双目立体匹配的原理和立体匹配算法,深入研究了全局匹配算法中的GC算法、局部匹配算法中的BM算法和半全局匹配SGM算法.结合实验结果,分析了三种算法的匹配效果及匹配速度,并对各自优缺点进行了比较和总结.
Stereo matching was the core of computer vision. According to the different constraint conditions,the stereo matching algorithms were divided into three categories: global stereo matching algorithm,semi global stereo matching algorithm and local stereo matching algorithm. The principle of binocular stereo matching and the stereo matching algorithms were introduced. The GC algorithm of the global matching algorithms,the BM algorithm of the local matching algorithms and the semi global matching SGM algorithm were studied intensively. Based on the experimental results,the matching accuracy and matching speed of the three algorithms were analyzed,and their advantages and disadvantages were compared and summarized.
出处
《鲁东大学学报(自然科学版)》
2018年第1期25-30,共6页
Journal of Ludong University:Natural Science Edition
基金
国家自然科学基金(61602399)
关键词
计算机视觉
立体匹配
图割法
块匹配
半全局匹配算法
computer vision
stereo matching
Graph Cut method
block matching
semi-global matching