An improved ORB feature matching algorithm

13Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

An improved ORB feature matching algorithm is proposed to solve the problem of decreasing matching accuracy under the conditions of image blur, light change, image compression and noise. First, in the process of extracting feature points, the image is meshed and quad-tree structure is introduced to make the extracted feature points evenly distributed in the image, thus solving the problem of feature points concentration encountered by traditional feature extraction methods. Then, the brute-force matching is used for preliminary matching, and cross validation is adopted to eliminate some mismatches and improve the result of brute-force matching. Finally, Gaussian kernel is used to weight the results of grid-based motion statistics to optimize the statistical results and further eliminate the mismatches to obtain the matching set with higher accuracy. The experimental results show that this algorithm improves the average accuracy by 3.5%, 4.2%, 1.8% and 6% respectively under the conditions of image blur, light change, image compression and noise.

Cite

CITATION STYLE

APA

Liao, H., Wang, L., Sun, H., & Liu, Y. (2021). An improved ORB feature matching algorithm. Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics, 47(10), 2149–2154. https://doi.org/10.13700/j.bh.1001-5965.2020.0359

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free