IMAGE MOSAIC ALGORITHM BASED ON PCA-ORB FEATURE MATCHING

• Main Authors: Zhu, J. T., Gong, C. F., Zhao, M. X., Wang, L., Luo, Y.
• Format: Conference Proceeding
• Language: English
• Subjects: Algorithms; Computer simulation; Computer vision; Fading; Image processing; Matching; Principal components analysis; Scale invariance; Stitching
• ISSN: 2194-9034; 1682-1750; 2194-9034
• DOI: 10.5194/isprs-archives-XLII-3-W10-83-2020

In the process of image stitching, the ORB (Oriented FAST and Rotated BRIEF) algorithm lacks the characteristics of scale invariance and high mismatch rate. A principal component invariant feature transform (PCA-ORB, Principal Component Analysis- Oriented) is proposed. FAST and Rotated BRIEF) image stitching method. Firstly, the ORB algorithm is used to optimize the feature points to obtain the feature points with uniform distribution. Secondly, the principal component analysis (PCA) method can reduce the dimension of the traditional ORB feature descriptor and reduce the complexity of the feature point descriptor data. Thirdly, KNN (K-Nearest Neighbor) is used, and the k-nearest neighbor algorithm performs roughly matching on the feature points after dimensionality reduction. Then the random matching consistency algorithm (RANSAC, Random Sample Consensus) is used to remove the mismatched points. Finally, the fading and fading fusion algorithm is used to fuse the images. In 8 sets of simulation experiments, the image stitching speed is improved relative to the PCA-SIFT algorithm. The experimental results show that the proposed algorithm improves the image stitching speed under the premise of ensuring the quality of stitching, and can play a role in fast, real-time and large-scale applications, which are conducive to image fusion.