Bidirectional scale-invariant feature transform feature matching algorithms based on priority k-d tree search. (19th December 2016)

• Record Type: Journal Article
• Authors: Liu, XiangShao; Zhou, Shangbo; Li, Hua; Li, Kun
• Is Part Of: International journal of advanced robotic systems. Volume 14:Number 1(2017:Jan./Feb.)
• Publication Date: 2016-12-19
• Subjects: Bidirectional matching -- priority k-d tree search -- SIFT -- matching precision -- recall rate; Robotics -- Periodicals; Robotics; Periodicals; 629.892
• DOI: 10.1177/1729881416682700
• Languages: English
• ISSNs: 1729-8806

Abstract

In this article, a bidirectional feature matching algorithm and two extended algorithms based on the priority k -d tree search are presented for the image registration using scale-invariant feature transform features. When matching precision of image registration is below 50%, the discarding wrong match performance of many robust fitting methods like Random Sample Consensus (RANSAC) is poor. Therefore, improving matching precision is a significant work. Generally, a feature matching algorithm is used once in the image registration system. We propose a bidirectional algorithm that utilizes the priority k -d tree search twice to improve matching precision. There are two key steps in the bidirectional algorithm. According to the case of adopting the ratio restriction of distances in the two key steps, we further propose two extended bidirectional algorithms. Experiments demonstrate that there are some special properties of these three bidirectional algorithms, and the two extended algorithms can achieve higher precisions than previous feature matching algorithms.