Journal of System Simulation ›› 2022, Vol. 34 ›› Issue (4): 727-734.doi: 10.16182/j.issn1004731x.joss.21-0857

• Modeling Theory and Methodology • Previous Articles     Next Articles

Feature Matching Algorithm Based on Optimal Geometric Constraints and RANSAC

Xiaojuan Ning1,2(), Jieru Li1(), Fan Gao1, Yinghui Wang3   

  1. 1.Institute of Computer Science and Engineering, Xi'an University of Technology, Xi'an 710048, China
    2.Shaanxi Key Laboratory for Network Computing and Security Technology, Xi'an 710048, China
    3.Institute of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214122, China
  • Received:2021-08-24 Revised:2021-12-17 Online:2022-04-30 Published:2022-04-19
  • Contact: Jieru Li E-mail:ningxiaojuan@xaut.edu.cn;1353654876@qq.com

Abstract:

In order to solve the problem that it's hard to reconcile the quality and computational efficiency of feature point matching. The initial matching for the extracted feature points is implemented through k-nearest neighbor (KNN) algorithm. According to the characteristics of equal length and same slope of the connecting line between matching points, the optimal geometric constraint is constructed based on the statistical sorting strategy to eliminate the obvious matching errors. Then random sample consensus (RANSAC) algorithm is utilized for further filtering to ensure the accuracy of the feature matching point pairs. Experimental results show that the method can obtain more matched point pairs under normal light, compared with Lowe's algorithm and GMS algorithm, and can ensure the quality of feature points.

Key words: statistical ranking, optimal geometric constraint, random sample consensus algorithm, feature point match

CLC Number: