Image stitching algorithm based on fast feature extraction and perceptual hash
by Ao-Mei Li; Zhe Wei; Wan-Li Jiang
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 11, No. 3, 2019

Abstract: The classic feature point image stitching algorithm is time-consuming in feature extraction, and an image sparse matrix method is proposed to determine the feature points. This method first uses Laplace operator to extract the image gradient and set the threshold to obtain the sparse matrix of image segmentation, then using features from accelerated segment test (FAST) detection algorithm for feature point. Finally, the speeded-up robust features (SURF) descriptor is given to increase the stability of the feature points. This method solves the problem of time-consuming feature extraction, making the real-time image mosaic possible. In the process of image mosaic, this paper presents a method using Kalman filter to predict the overlap region, thus reducing the computational complexity. In addition, because there is always a mismatch between feature points matching, this paper proposes a method using perceptual hashing to refine the matching pair, which solves the error caused by mismatching for the next image registration and improves the registration accuracy. Experimental results show that the proposed algorithm improves the speed and precision of image mosaic.

Online publication date: Mon, 30-Sep-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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