关键词: POKD-tree算法, 分区直线, 对应搜索, 交叉搜索, 匹配效率

Abstract: In order to solve the SIFT algorithm, and the algorithm efficiency is not high, POKD-tree algorithm （partition optimization KD tree search algorithm） is proposed. Firstly, image feature points are extracted using SIFT algorithm, the largest span direction in the image feature point set in X and Y direction is the partition line direction, and calculate the centroid of image features point set, through the partition to partition the image centroid line; using Euclidean distance between feature points in image matching, the first corresponding match, at the same time in order to solve the partition error, then cross search after the corresponding search. Finally, the experimental results show that POKD-tree algorithm is superior to BBF algorithm and RKD-tree algorithm in matching efficiency.

Key words: POKD-tree algorithm, partition line, corresponding match, cross search, matching efficiency