计算机工程与应用2017，Vol.53Issue(16)：182-186,5.DOI:10.3778/j.issn.1002-8331.1611-0049
POKD-tree:一种有效的SIFT图像特征点匹配方法
POKD-tree:effective SIFT image feature point matching method.
摘要
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.关键词
POKD-tree算法/分区直线/对应搜索/交叉搜索/匹配效率Key words
POKD-tree algorithm/partition line/corresponding match/cross search/matching efficiency分类
信息技术与安全科学引用本文复制引用
董本志,龙建勇,景维鹏..POKD-tree:一种有效的SIFT图像特征点匹配方法[J].计算机工程与应用,2017,53(16):182-186,5.基金项目
国家自然科学基金(No.31370565,No.61300098) （No.31370565,No.61300098）
哈尔滨市人才项目专项(No.2015RAYXJ005). （No.2015RAYXJ005）
