k-最近邻算法
最近邻搜索
特征(语言学)
材料科学
匹配(统计)
模式识别(心理学)
人工智能
特征匹配
计算机科学
算法
特征提取
数学
统计
哲学
语言学
作者
Beiyi Wang,Xiaohong Zhang,Weibing Wang
标识
DOI:10.1080/10584587.2021.1911336
摘要
Aiming at dimensional feature vector matching problem of low accuracy, a kind of image matching algorithm is based on SURF and fast library for approximate nearest neighbor search. Fast-Hessian was used to detect the feature points, and the SURF feature description vector proposed was generated; through fast library for approximate nearest neighbor search algorithm, pre-matching point was got. With the introduction of Random Sample Consensus (RANSAC) algorithm points false-matching, based on the SIFT algorithm, the result of SURF algorithm and optimization algorithm was proposed and mismatching points were eliminated after the experiment simulation. Experimental results show that at the same time the matching algorithm improve matching accuracy rate, and the algorithm of the real-time performance is also improved.
科研通智能强力驱动
Strongly Powered by AbleSci AI