Aiming at the problem that AKAZE algorithm has slow feature extraction speed and low accuracy in the feature matching process, this paper proposes to improve AKAZE's feature matching algorithm based on grid statistical motion. Firstly, in the feature extraction stage, the proposed algorithm uses the oFAST algorithm instead of constructing scale space to extract feature points. Then, the M-LDB descriptor is used for feature point description. Finally, the BF algorithm is used to perform coarse matching of features, and the grid motion statistics (GMS) algorithm is added to achieve the purification of matching point pairs and complete the matching. The performance of the proposed algorithm was compared with the AKAZE and ORB algorithms in the experimental fields and grayscale graph groups. The results show that the improved algorithm not only improves the matching speed, which is more than 2 times faster than the AKAZE algorithm, but also maintains a high matching accuracy, which is similar to the AKAZE algorithm.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.