Image Matching Algorithm based on ORB and K-Means Clustering

With the rapid development of science and technology, image processing technology plays an important role in the field of computer vision. In order to improve the matching speed and real-time requirements, this paper proposes an image matching algorithm based on ORB and K-means clustering, which can effectively improve the accuracy of image feature point location and the accuracy and efficiency of image feature matching, and reduce the time consumption. The algorithm uses sub-pixel interpolation to optimize the traditional ORB algorithm, which improves the accuracy and characteristics of clustering calculation.