HX-MATCH: In-Memory Cross-Matching Algorithm for Astronomical Big Data

Author(s):  
Mariem Brahem ◽  
Karine Zeitouni ◽  
Laurent Yeh
2014 ◽  
Vol 57 (3) ◽  
pp. 577-583 ◽  
Author(s):  
Peng Du ◽  
JuanJuan Ren ◽  
JingChang Pan ◽  
ALi Luo

2020 ◽  
Vol 39 (4) ◽  
pp. 5109-5118
Author(s):  
Yubao Zhang

The purpose of this article is to explore effective image feature extraction algorithms in the context of big data, and to mine their potential information from complex image data. Based on the BRISK and SIFT algorithms, this paper proposes an image feature extraction and matching algorithm based on BRISK corner points. By combining the SIFT scale space and the BRISK algorithm, a new scale space construction method is proposed. The BRISK algorithm extracts the corner invariant features. Then, by using the improved feature matching method and eliminating the mismatching algorithm, the exact matching of the images is realized. A large number of experimental verifications were performed in the standard test Mikolajczyk image database and aerial image database. The experimental results show that the improved algorithm in this paper is an effective image matching algorithm. The highest accuracy of actual aerial image matching can reach 85.19%, and it can realize the actual aerial image matching that BRISK and SIFT algorithms cannot complete. The improved algorithm in this paper has the advantages of higher matching accuracy and strong robustness.


Sign in / Sign up

Export Citation Format

Share Document