摘要
为提高立体匹配的运算速度,提出一种新的图像匹配扫描策略改进传统算法。在匹配扫描过程中,将图像由左至右的三列作为一组,各组内除首行外扫描次序为中间列、左列、右列像素点,按照文中扫描策略及像素点,在图像中所处位置,分别给出了各种情况下,以较小的存储空间,利用水平和竖直方向相邻像素点的模板已计算值,减少算法执行时间的方法。通过仿真实验与传统算法比较,该算法在保证相同匹配精度下,匹配时间短,可满足实时性要求较高的应用场合。
To improve the speediness of stereo matching algorithm,a new scanning strategy for improving algorithm is presented.During the scanning,the whole image is divided into groups of three columns from left to right,besides the first row;the scanning sequence is middle column pixel,left column pixel and right column pixel.According to the scanning strategy and the position of matching pixel in the image,the methods of reducing the execution time are given as follows：the adjacent pixels computed values of horizontal and vertical orientation are stored using less space.Experimental result shows that the proposed algorithm is the less calculation and the higher matching speed than traditional method under the same matching results and can be used in the environment requiring more real-time operation.
出处
《电子科技》
2011年第8期12-14,17,共4页
Electronic Science and Technology
基金
广西教育厅科研基金资助项目(201010LX220)
广西工学院科学研究基金资助项目(院科自1166101)
关键词
立体匹配
扫描策略
存储
模板
stereo matching
scanning strategy
store
template
