A Real-time and Robust Image Matching Algorithm Using Inertial Information in Dynamic Environment

Author(s):  
Songhui Ma ◽  
Mingming Shi ◽  
Chufeng Hu
2012 ◽  
Vol 49 (21) ◽  
pp. 20-24
Author(s):  
Behloul Ali ◽  
Aksa Abla

Author(s):  
Jianyu Duan ◽  
Lingyu Sun ◽  
Lijun Li ◽  
Zongmiao Dai ◽  
Zhenkai Xiong ◽  
...  

Abstract Binocular stereo measurement system can obtain accurate three-dimensional information from two-dimensional images. It has been widely applied in many fields such as vehicle tracking, robot navigating, automatic crane lifting, as well as other fields. The crucial step of binocular stereo measurement is image matching. For the image matching, it is a great challenge to ensure both real-time and matching accuracy simultaneously. The image matching algorithm has a great influence on the image matching time and accuracy. In this paper, a real-time image matching algorithm for binocular stereo measurement system is proposed based on Speedup Robust Features (SURF) algorithm. In the proposed algorithm, firstly, the key feature points are identified by the original SURF algorithm method. Secondly, the main direction of the key feature point is determined by intensity centroid method. Then, the feature descriptor is calculated by the BRIEF binary method so that the time of feature description can be shortened. Finally, RANSAC (Random Sample Consensus) method is adopted to remove mismatching points. The experiments results show that the proposed algorithm can shorten image matching time obviously and improve the accuracy of matching points.


2021 ◽  
Vol 15 ◽  
pp. 174830262110126
Author(s):  
Ke Zhang ◽  
Xiaolei Yu ◽  
Lin Li ◽  
Zhenlu Liu ◽  
Shanhao Zhou ◽  
...  

We propose an improved image matching algorithm that combines the minimum feature value algorithm to extract feature points and the direction gradient histogram to calculate the description vector. This algorithm is oriented to RFID multi-tag identification and distribution optimization in the actual scenario, and the traditional SURF algorithm has the problems of low matching accuracy and high complexity in multi-tag matching. This algorithm effectively improves the positioning accuracy of the RFID multi-tag positioning system. The experimental results show that the matching success rate of the improved algorithm in this paper is 87.4%, which is 50% higher than the SURF algorithm. Not only the matching accuracy is greatly improved, but the running speed is also increased by 48%. The algorithm in this paper has high matching accuracy and real-time performance.It provides an effective way for RFID multi-tag real-time fast matching and precise positioning.


2011 ◽  
Vol 33 (9) ◽  
pp. 2152-2157 ◽  
Author(s):  
Yong-he Tang ◽  
Huan-zhang Lu ◽  
Mou-fa Hu

2011 ◽  
Vol 121-126 ◽  
pp. 701-704
Author(s):  
Xue Tong Wang ◽  
Yao Xu ◽  
Feng Gao ◽  
Jing Yi Bai

Feature points can be used to match images. Candidate feature points are extracted through SIFT firstly. Then feature points are selected from candidate points through singular value decomposing. Distance between feature points sets is computed According to theory of invariability of feature points set, images are matched if the distance is less than a threshold. Experiment showed that this algorithm is available.


Sign in / Sign up

Export Citation Format

Share Document