Unordered Image Stitching Based on the Registration Index Table

Abstract

Listen

Translate article

In order to solve the problem of large amount of calculation and time-consuming in the process of unordered image stitching, we propose an image stitching algorithm based on the image registration index table in this paper. Firstly, we construct the matching index sequence based on the similarity of the matching area. Then we search for image matching pairs according to the matching index sequence, carry out image registration and stitch directly, and generate the registration index table. For image stitching, we build a binary tree model assisted by the image registration index table, we need to search for matching pairs and carry out registration and stitching according to the registration index table generated by each layer. Compare to the current research on disordered image stitching, our method significantly reduces the times of feature extraction and matching by at least half, therefore, it greatly improves the efficiency of image stitching.