Image matching of Gaussian blurred image based on SIFT algorithm

Author(s):  
Zheng-Jian Ding ◽  
Yang Zhang ◽  
A-Qing Yang ◽  
Dai-Li
2018 ◽  
Vol 35 (10) ◽  
pp. 1373-1391 ◽  
Author(s):  
Bahman Sadeghi ◽  
Kamal Jamshidi ◽  
Abbas Vafaei ◽  
S. Amirhassan Monadjemi

2014 ◽  
Vol 926-930 ◽  
pp. 3058-3062
Author(s):  
Dong Guang Zuo ◽  
Tao Wen ◽  
Zhong Ke Li ◽  
Zhan Liang Li

In order to improve the generality and real-time of image matching procedure, Visual Studio 2010 and MATLAB R2009a have been used as the platform to research mixed programming and improved SIFT algorithm. In this method, the advantages of C # and Matlab have been combined to reduce the difficulty of programming and to improve programming efficiency. The results show that, improved SIFT algorithm can greatly improve real-time of matching program while guaranteeing good matching rate, its suitable in real-time applications.


2013 ◽  
Vol 2013 ◽  
pp. 1-12
Author(s):  
Yong Chen ◽  
Lei Shang ◽  
Eric Hu

As for the unsatisfactory accuracy caused by SIFT (scale-invariant feature transform) in complicated image matching, a novel matching method on multiple layered strategies is proposed in this paper. Firstly, the coarse data sets are filtered by Euclidean distance. Next, geometric feature consistency constraint is adopted to refine the corresponding feature points, discarding the points with uncoordinated slope values. Thirdly, scale and orientation clustering constraint method is proposed to precisely choose the matching points. The scale and orientation differences are employed as the elements ofk-means clustering in the method. Thus, two sets of feature points and the refined data set are obtained. Finally, 3 * delta rule of the refined data set is used to search all the remaining points. Our multiple layered strategies make full use of feature constraint rules to improve the matching accuracy of SIFT algorithm. The proposed matching method is compared to the traditional SIFT descriptor in various tests. The experimental results show that the proposed method outperforms the traditional SIFT algorithm with respect to correction ratio and repeatability.


Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Yuanjie Shao ◽  
Nong Sang ◽  
Juncai Peng ◽  
Changxin Gao

Image matching is important for vision-based navigation. However, most image matching approaches do not consider the degradation of the real world, such as image blur; thus, the performance of image matching often decreases greatly. Recent methods try to deal with this problem by utilizing a two-stage framework—first resorting to image deblurring and then performing image matching, which is effective but depends heavily on the quality of image deblurring. An emerging way to resolve this dilemma is to perform image deblurring and matching jointly, which utilize sparse representation prior to explore the correlation between deblurring and matching. However, these approaches obtain the sparse representation prior in the original pixel space, which do not adequately consider the influence of image blurring and thus may lead to an inaccurate estimation of sparse representation prior. Fortunately, we can extract the pseudo-Zernike moment with blurred invariant from images and obtain a reliable sparse representation prior in the blurred invariant space. Motivated by the observation, we propose a joint image deblurring and matching method with blurred invariant-based sparse representation prior (JDM-BISR), which obtains the sparse representation prior in the robust blurred invariant space rather than the original pixel space and thus can effectively improve the quality of image deblurring and the accuracy of image matching. Moreover, since the dimension of the pseudo-Zernike moment is much lower than the original image feature, our model can also increase the computational efficiency. Extensive experimental results demonstrate that the proposed method performs favorably against the state-of-the-art blurred image matching approach.


Author(s):  
Vaibhav Setia ◽  
Shreya Kumar

Blurred images are difficult to avoid in situations when minor Atmospheric turbulence or camera movement results in low-quality images. We propose a system that takes a blurred image as input and produces a deblurred image by utilizing various filtering techniques. Additionally, we utilize the Siamese Network to match local image segments. A Siamese Neural Network model is used that is trained to account for image matching in the spatial domain. The best-matched image returned by the model is then further used for Signal-to-Noise ratio and Point Spread Function estimation. The Wiener filter is then used to deblur the image. Finally, the results of the deblurring techniques with existing algorithms are compared and it is shown that the error in deblurring an image using the techniques presented in this paper is considerably lesser than other techniques.


Author(s):  
M. Shankayi ◽  
M. Saadatseresht ◽  
M. A. V. Bitetto

There was always a speed/accuracy challenge in photogrammetric mapping process, including feature detection and matching. Most of the researches have improved algorithm's speed with simplifications or software modifications which increase the accuracy of the image matching process. This research tries to improve speed without enhancing the accuracy of the same algorithm using Neuromorphic techniques. In this research we have developed a general design of a Neuromorphic ASIC to handle algorithms such as SIFT. We also have investigated neural assignment in each step of the SIFT algorithm. With a rough estimation based on delay of the used elements including MAC and comparator, we have estimated the resulting chip's performance for 3 scenarios, Full HD movie (Videogrammetry), 24 MP (UAV photogrammetry), and 88 MP image sequence. Our estimations led to approximate 3000 fps for Full HD movie, 250 fps for 24 MP image sequence and 68 fps for 88MP Ultracam image sequence which can be a huge improvement for current photogrammetric processing systems. We also estimated the power consumption of less than10 watts which is not comparable to current workflows.


2011 ◽  
Vol 268-270 ◽  
pp. 2178-2184
Author(s):  
Shang Bo Zhou ◽  
Kai Kang

The SIFT (scale invariant feature transform) algorithm has been successfully used in the image matching field. In this paper, a simplified SIFT algorithm is designed. The number of layers in the Gaussian pyramid is reduced. When it is comparing the keypoints, it uses an outspreading method. The new method can reduce the comparison time and matching time. Although the new algorithm (C-SIFT algorithm) has less matching accuracy than the SIFT algorithm, it adopts a distortion detection method to abandon the wrong matching. Then it uses the coordinate displacement to determine the tracking position. Experimental results show that C-SIFT algorithm can perform steadily and timely.


Sign in / Sign up

Export Citation Format

Share Document