Title: A real-time matching algorithm using sparse matrix

Authors: Aomei Li; Wanli Jiang; Po Ma; Jiahui Guo; Weihua Yuan; Dehui Dai

Addresses: Army Officer Academy of PLA, Hefei, Anhui, China ' Army Officer Academy of PLA, Hefei, Anhui, China ' Army Officer Academy of PLA, Hefei, Anhui, China ' Army Officer Academy of PLA, Hefei, Anhui, China ' Army Officer Academy of PLA, Hefei, Anhui, China ' Army Officer Academy of PLA, Hefei, Anhui, China

Abstract: Aiming at the shortcomings of the traditional image feature matching algorithm, which is computationally expensive and time-consuming, this paper presents a real-time feature matching algorithm. Firstly, the algorithm constructs sparse matrices by Laplace operator and the Laplace weighted is carried out. Then, the feature points are detected by the FAST feature point detection algorithm. The SURF algorithm is used to assign the direction and descriptor to the feature for rotation invariance, and then the Gaussian pyramid is used to make it scalable invariant. Secondly, the match pair is extracted by the violent matching method, and the matching pair is purified by Hamming distance and symmetry method. Finally, the RANSAC algorithm is used to get the optimal matrix, and the affine invariance check is used to match the result. The algorithm is compared with the classical feature point matching algorithm, which proves that the method has high real-time performance under the premise of guaranteeing the matching precision.

Keywords: sparse matrices; Laplace weighted; FAST; SURF; symmetry method; affine invariance check.

DOI: 10.1504/IJGUC.2020.103964

International Journal of Grid and Utility Computing, 2020 Vol.11 No.1, pp.1 - 9

Received: 14 Nov 2017
Accepted: 06 May 2018
Published online: 04 Dec 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article