scholarly journals Optimization and Innovation of SIFT Feature Matching Algorithm in Static Image Stitching Scheme

2021 ◽  
Vol 1881 (3) ◽  
pp. 032017
Author(s):  
Yuan Jiao
2013 ◽  
Vol 5 (20) ◽  
pp. 4810-4815
Author(s):  
Gu Lichuan ◽  
Qiao Yulong ◽  
Cao Mengru ◽  
Guo Qingyan

2013 ◽  
Vol 303-306 ◽  
pp. 1056-1059
Author(s):  
Sen Wang ◽  
Yin Hui Zhang ◽  
Zhong Hai Shi ◽  
Zi Fen He

The image stitching method is widely used into the suspect's footprint information extraction. In order to improve the image detail and the matching precision, the Footprint map image stitching method which is based on the wavelet transform and the SIFT feature matching is put forward. The wavelet transform in this method is perform based on the pretreatment of image, move the low frequency wavelet coefficient to zero, adjusting thresholds of the high frequency wavelet coefficient and inverse transformation, then, use the SIFT to extract and match the key-points of the processed images. For the error matching pair of coarse match, you can use the RANSAC to filter them out. This article demonstrates its advantage through to the original image splicing comparisons. The experimental results show that the method display more clear detail and the precision of matching than the original method.


2014 ◽  
Vol 543-547 ◽  
pp. 2670-2673
Author(s):  
Lei Cao ◽  
Di Liao ◽  
Bin Dang Xue

Aiming to solve the high computational and time consuming problem in SIFT feature matching, this paper presents an improved SIFT feature matching algorithm based on reference point. The algorithm starts from selecting a suitable reference point in the feature descriptor space when SIFT features are extracted. In the feature matching stage, this paper uses the Euclidean distance between descriptor vectors of the feature point to be matched and the reference point to make a fast filtration which removes most of the features that could not be matched. For the remaining SIFT features, Best-bin-first (BBF) algrithm is utilized to obtain precise matches. Experimental results demonstrate that the proposed matching algorithm achieves good effectiveness in image matching, and takes only about 60 percent of the time that the traditional matching algorithm takes.


2013 ◽  
Vol 21 (8) ◽  
pp. 2146-2153 ◽  
Author(s):  
刘志文 LIU Zhi-wen ◽  
刘定生 LIU Ding-sheng ◽  
刘鹏 LIU Peng

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 88133-88140
Author(s):  
Yongchao Wang ◽  
Yijun Yuan ◽  
Zhao Lei

2011 ◽  
Vol 31 (1) ◽  
pp. 29-32
Author(s):  
Jin-qin ZHONG ◽  
Jie-qing TAN ◽  
Ying-ying LI ◽  
Li-chuan GU

2015 ◽  
Vol 743 ◽  
pp. 359-364 ◽  
Author(s):  
B. Liao ◽  
H.F. Wang

In the field of object recognition, the SIFT feature is known to be a very successful local invariant descriptor and has wide application in different domains. However it also has some limitations, for example, in the case of facial illumination variation or under large tilt angle, the identification rate of the SIFT algorithm drops quickly. In order to reduce the probability of mismatching pairs, and improve the matching efficiency of SIFT algorithm, this paper proposes a novel feature matching algorithm. The basic idea is taking the successful-matched SIFT feature points as the training samples to establish a space mapping model based on BP neural network. Then, with the help of this model, the estimated coordinate of the corresponding SIFT feature point in the candidate image is predicted. Finally search the possible matching points around the coordinate. The experiment results show that using the prediction model, the number of mismatching points can be reduced effectively and the number of correct matching pairs increases at the same time


2013 ◽  
Vol 647 ◽  
pp. 896-900 ◽  
Author(s):  
Feng Tian ◽  
Yu Bo Yan

For solving the low matching efficiency problem due to high dimension of eigenvector in SIFT, a SIFT feature matching algorithm based on semi-variance function is proposed. For each feature point in image SIFT feature point zone, m beams are generated by using the position of the feature point as center and the orientation of the feature point as start direction. The image semi-variance function value of each beam, which is treated as SIFT value of eigenvector descriptor, is used in the algorithm aiming at reducing the dimension of eigenvector and improving image matching efficiency. The experiment result shows that the matching rate of this algorithm is higher, the matching time of this algorithm is less.


Sign in / Sign up

Export Citation Format

Share Document