Journal of Applied Sciences ›› 2022, Vol. 40 ›› Issue (2): 266-278.doi: 10.3969/j.issn.0255-8297.2022.02.009

• Signal and Information Processing • Previous Articles    

An Improved ORB Algorithm Based on Quad-Tree Partition

NI Cui1, WANG Peng1, SUN Hao1, LI Qian2   

  1. 1. School of Information Science and Electric Engineering, Shandong Jiao Tong University, Jinan 250357, Shandong, China;
    2. Institute of Automation, Shandong Academy of Sciences, Jinan 250014, Shandong, China
  • Received:2021-04-19 Published:2022-04-01

Abstract: The image feature points extracted by the original ORB algorithm often appear the phenomenon of "clustering and overlapping", and their distribution is relatively dense and lack of scale invariance, which easily leads to the problem of mismatching of image feature points. In order to solve this problem, this paper proposes an image feature point extraction algorithm based on quad-tree structure. First, the scale pyramid of the image is built, and then the quad-tree is used to divide the image, and the depth of the partition is limited. The FAST algorithm is employed to detect the feature points of the scaled image by multiple detection thresholds. Second, the ORB feature points will be extracted based on the division of the total sub-block and the total number of the feature points. And then the best feature points are obtained by taking the maximum inhibition method, and the feature points' descriptors are calculated with the help of the improved BRIEF algorithm. Finally the work of feature points matching will be realized. Experimental results show that compared with the original ORB algorithm, the uniformity of feature points extracted by the proposed algorithm in this paper is significantly improved. The number of redundant and overlapping feature points is reduced, and the extraction speed of feature points is improved by more than 30%.

Key words: ORB(oriented FAST and rotated BRIEF) algorithm, quad-tree, image pyramid, feature extraction, image matching

CLC Number: