Abstract

The classical SURF algorithm has many disadvantages, such as high dimension of feature descriptor, large amount of computation, and low matching accuracy when the angle of rotation and angle of view is too large. To solve the above problems, an improved algorithm is proposed. Firstly, image preprocessing is carried out by image binarization, feature points are extracted by Hes-sian matrix, and then feature description is carried out by using circular neighborhood of feature points. Har wavelet response is used to establish descriptors for each feature point, and the normalized gray-level difference and second-order gradient in the neighborhood are calculated simultaneously to form a new feature descriptor. Finally, the RANSAC algorithm is used to eliminate the mismatch points. The algorithm does not Compared with the classical SURF algorithm, it has the advantage of speed, and makes full use of the gray level information and the detail information, so it has higher accuracy. Experimental results show that the algorithm has good robustness and stability to image blur, illumination difference, angle rotation, field of view transformation and so on. The algorithm is applied to remote sensing image stitching to obtain the stitched image with no obvious geometric shift and good edge connection. This algorithm is a kind of image registration algorithm with short time and high precision, which can meet the registration requirements of remote sensing image stitching.

Highlights

  • According to the difference of registration methods, image mosaic can be divided into the following three kinds.Image mosaic algorithm based on gray area is developed from the field of image matching [1]

  • It is found that the median running time of the algorithm is 9.125s before the algorithm is improved, and the median running time of the improved algorithm is 8.49s

  • It is found that compared with the improved algorithm, the efficiency of the improved algorithm is increased by about 17%, and the stitching speed of the improved algorithm is obviously faster, which verifies the validity of the algorithm in this paper

Read more

Summary

Introduction

According to the difference of registration methods, image mosaic can be divided into the following three kinds. Image mosaic algorithm based on gray area is developed from the field of image matching [1]. The reference image is segmented into a fixed geometric area, and the regions of the same size are selected from the image to be stitched, and the similarity of the regions is calculated by using the topological characteristics of the two image regions [2]. In 1982, Rofenfied first proposed the crosscorrelation similarity measure to calculate the similarity between regions. Barnea proposed Sequential Similarity Detection (SSDA) algorithm [3].

Methods
Findings
Discussion
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call