Image feature point matching method based on improved BRISK Online publication date: Fri, 09-Apr-2021
by Qian Shi; Yong Liu; Yichun Xu
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 20, No. 2, 2021
Abstract: In order to improve the accuracy of the BRISK algorithm of feature point matching, an improved BRISK feature point matching method is proposed by combining the SIFT algorithm idea with high matching accuracy. Firstly, the Gaussian image pyramid is established, then the FAST algorithm is used to detect the feature points of each image layer in the image pyramid, and the intensity centroid method is used to determine the direction of the feature points, so the feature points obtained have scale information and direction information. Then, using the BRISK descriptor to describe the feature points, using the Hamming distance to measure the similarity of the feature descriptors, and calculating the matching accuracy and matching time. The experimental results show that the accuracy of the method proposed in this paper is higher than that of the BRISK algorithm and the time is better than that of the SIFT algorithm and the BRISK algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook