VSLAM系统中的快速特征点匹配算法  

Fast Feature Point Matching Algorithm in VSLAM System

作　　者：谢东[1] 张泽均 谢坚筱 周雅凯 蒙研 XIE Dong;ZHANG Zejun;XIE Jianxiao;ZHOU Yakai;MENG Yan(School of Physics and Electronic Information Engineering,Zhejiang Normal University,Jinhua 321000,China)

机构地区：[1]浙江师范大学物理与电子信息工程学院,浙江金华321000

出　　处：《计算机测量与控制》2024年第10期222-227,共6页Computer Measurement &Control

基　　金：浙江省自然科学基金项目(LZ24F030009)。

摘　　要：连续图像帧之间特征点匹配是视觉同步定位与建图(VSLAM)技术的关键技术;针对VSLAM系统中连续图像帧之间特征点匹配耗时且精度低的问题,一种基于局部像素运动模型的快速特征点匹配算法(LPMM)被提出;该算法基于运动平滑约束假设,利用连续图像帧中局部区域内的像素点的运动具有一致性这一特性,将图像划分成局部网格区域后利用每个网格中的部分特征点估算该网格区域的运动向量,并以此为基础,计算下一帧匹配特征点的搜索范围的中心点;最终在计算出下一帧的中心点的局部邻域内搜索与当前帧的特征点相匹配的特征点;实验结果表明,所提出的匹配算法与广泛使用的ORB-SLAM2中的投影匹配算法相比,平均匹配速度提高50%以上,匹配精度提升了约4%。Feature point matching between consecutive image frames is a key technology in visual simultaneous localization and mapping(VSLAM).To address the issues of time-consuming and low accuracy in feature point matching between consecutive image frames in VSLAM systems,a fast feature point matching algorithm based on local pixel motion model(LPMM)is proposed.Based on the assumption of motion smoothness constraint,this algorithm adopts the consistency of pixel motion within local regions in consecutive image frames to divide the image into local grid regions,and estimate the motion vector of each grid by using some feature points within the grid.On this basis,the center point of the search range for matching feature points in the next frame is calculated.Finally,the feature points that match the current frame s feature points are searched for within the local neighborhood of the calculated center point of the next frame.Experimental results show that the proposed matching algorithm,compared with the widely used projection matching algorithm in ORB-SLAM2,has an average matching speed increase of over 50%and an accuracy improvement of approximately 4%.

关 键 词：VSLAM 特征点匹配 局部像素运动模型 局部区域网格 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]