A fast, accurate and dense feature matching algorithm for aerial images

3Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Three-dimensional (3D) reconstruction based on aerial images has broad prospects, and feature matching is an important step of it. However, for high-resolution aerial images, there are usually problems such as long time, mismatching and sparse feature pairs using traditional algorithms. Therefore, an algorithm is proposed to realize fast, accurate and dense feature matching. The algorithm consists of four steps. Firstly, we achieve a balance between the feature matching time and the number of matching pairs by appropriately reducing the image resolution. Secondly, to realize further screening of the mismatches, a feature screening algorithm based on similarity judgment or local optimization is proposed. Thirdly, to make the algorithm more widely applicable, we combine the results of different algorithms to get dense results. Finally, all matching feature pairs in the low-resolution images are restored to the original images. Comparisons between the original algorithms and our algorithm show that the proposed algorithm can effectively reduce the matching time, screen out the mismatches, and improve the number of matches.

Cite

CITATION STYLE

APA

Ying, L., Guanghong, G., & Lin, S. (2020). A fast, accurate and dense feature matching algorithm for aerial images. Journal of Systems Engineering and Electronics, 31(6), 1128–1139. https://doi.org/10.23919/JSEE.2020.000085

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