检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:钟永安 陈冲[1] Zhong Yongan;Chen Chong(College of Electrical Engineering and Automation,Fuzhou University,Fuzhou Fujian 350108,China)
机构地区:[1]福州大学电气工程与自动化学院
出 处:《电气自动化》2019年第6期111-114,共4页Electrical Automation
摘 要:图像匹配算法是很多计算机视觉应用的重要组成部分,其中算法的匹配准确度和匹配损耗时间是衡量匹配算法性能的重要指标。针对目前的图像特征匹配算法无法同时获得高匹配准确度和低匹配损耗时间的特点,提出了基于AKAZE算法特征提取与融合匹配算法相结合的匹配策略。通过AKAZE算法计算待匹配图像的特征描述子,融合匹配算法首先利用KD-Tree进行粗匹配,然后再结合PROSAC算法分两个阶段剔除误匹配特征点。通过试验测试,在获得高的匹配准确度的同时,保持低的匹配损耗时间。Image matching algorithm is an important component of many computer vision applications,whereby the matching accuracy and match loss time of the algorithm are major indicators for the measurement of the performance of the matching algorithm.Considering that current image feature matching algorithm cannot have high matching accuracy and low matching loss time at the same time,a matching strategy based on AKAZE algorithm feature extraction and fusion matching algorithm was proposed in this paper.The AKAZE algorithm was used to calculate the feature descriptors of the image to be matched.According to the fusion matching algorithm,firstly,the KD-tree was used to complete rough matching.Then,the PROSAC algorithm was used to eliminate mismatched feature points in two stages.Experimental results showed that the algorithm proposed in this paper could not only achieve high matching accuracy,but also maintain a low matching loss time.
关 键 词:图像匹配 特征提取 融合匹配 AKAZE KD-TREE PROSAC
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28