E-OrbF: a robust image feature matching algorithm

Abstract

To improve the real-time performance and robustness of traditional feature matching algorithms, an improved image feature matching algorithm E-OrbF based on ORB and FREAK is proposed. In E-OrbF, the original FAST feature points in ORB algorithm are distributed unevenly and redundant. The strategy of subregion and local threshold is adopted to improve the uniform distribution and stability of feature points. Then simplify the sampling mode of FREAK algorithm and design a new feature descriptor. While improving the matching speed, the sampling point pairs are further filtered to improve the matching accuracy. Finally, combine RANSAC matching algorithm to eliminate mismatches and reduce the rate of mismatches. The experimental results show that the algorithm has good real-time performance, while under the conditions of perspective transformation, rotation scale, complex illumination and blur. Both of them can well complete feature detection and feature matching and improve the robustness of existing methods. The algorithm can be applied to the fusion of virtual and real scenes on mobile terminals, and the average visual frame rate reaches 30 FPS, meeting the real-time requirements.