A real-time matching algorithm using sparse matrix. (3rd December 2019)

• Record Type: Journal Article
• Authors: Li, Aomei; Jiang, Wanli; Ma, Po; Guo, Jiahui; Yuan, Weihua; Dai, Dehui
• Is Part Of: International journal of grid and utility computing. Volume 11:Number 1(2020)
• Page Start: 1
• Page End: 9
• Publication Date: 2019-12-03
• Subjects: sparse matrices -- Laplace weighted -- FAST -- SURF -- symmetry method -- affine invariance check; Electronic data processing -- Distributed processing -- Periodicals; Electronic commerce -- Management -- Computer programs -- Periodicals; 004.605
• Languages: English
• ISSNs: 1741-847X

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.