•  
  •  
 

Journal of System Simulation

Abstract

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.

First Page

727

Revised Date

2021-12-17

Last Page

734

CLC

TP391.41

Recommended Citation

Xiaojuan Ning, Jieru Li, Fan Gao, Yinghui Wang. Feature Matching Algorithm Based on Optimal Geometric Constraints and RANSAC[J]. Journal of System Simulation, 2022, 34(4): 727-734.

Corresponding Author

Jieru Li,1353654876@qq.com

DOI

10.16182/j.issn1004731x.joss.21-0857

Share

COinS