检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:杨洁 华云松[1] YANG Jie;HUA Yun-song(School of Optical-Electrical Information and Computer Engineering,University of Shanghai for Science&Technology,Shanghai 200093,China)
机构地区:[1]上海理工大学光电信息与计算机工程学院,上海200093
出 处:《软件导刊》2021年第8期195-199,共5页Software Guide
摘 要:针对传统SURF算法在图像匹配过程中,存在计算量大、算法精度低的问题,提出一种应用于双目测距系统的优化SURF算法。该优化算法可对预处理后的图像进行特征点检测和描述子构建,然后用FLANN算法进行初步匹配,再用最大和最小距离差值的阈值比筛选出匹配点对,进而利用半随机抽样PROSAC算法进行最后匹配。实验结果表明,优化后的SURF算法与传统SURF算法和加入RANSAC算法相比,误匹配率显著降低,分别从46.4%、11.8%降至6.4%。该算法在提高匹配精度方面优势明显,将其应用于目标测距系统中,最小测量误差仅为0.26%,能够满足精确测距要求。In order to solve the problems of large amount of computation and low precision of the traditional SURF algorithm in the process of image matching,this paper proposes an optimized SURF algorithm applied to binocular ranging system.This optimization algorithm can detect feature points and construct descriptors of preprocessed images.Then the FLANN algorithm is used for preliminary matching,and then the threshold ratio of the maximum and minimum distance difference is used to screen out the matching point pairs,and then the semi-random sampling PROSAC algorithm is used for final matching.Experimental results show that compared with the traditional SURF algorithm and RANSAC algorithm,the mismatching rate of the optimized SURF algorithm is significantly reduced from 46.4%,11.8%to 6.4%,respectively.The algorithm has obvious advantages in improving the matching accuracy.When applied to the target ranging system,the minimum measurement error is only 0.26%,which can meet the requirements of accurate ranging.
关 键 词:SURF算法 图像匹配 PROSAC算法 阈值比 双目测距
分 类 号:TP312[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229