A SIFT feature based registration algorithm in automatic seal verification

2012 ◽  
Author(s):  
Jin He ◽  
Xuewen Ding ◽  
Hao Zhang ◽  
Tiegen Liu
Keyword(s):  
Sift Feature ◽  
Registration Algorithm ◽  
Feature Based

scholarly journals SIFT Feature-Based Video Camera Boundary Detection Algorithm

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Lingqiang Kong
Keyword(s):  
Complex Structure ◽  
Boundary Detection ◽  
Recall Rate ◽  
Detection Algorithm ◽  
Detection Accuracy ◽  
Gradual Change ◽  
Dynamic Texture ◽  
Sift Feature ◽  
Film And Television ◽  
Feature Based

Aiming at the problem of low accuracy of edge detection of the film and television lens, a new SIFT feature-based camera detection algorithm was proposed. Firstly, multiple frames of images are read in time sequence and converted into grayscale images. The frame image is further divided into blocks, and the average gradient of each block is calculated to construct the film dynamic texture. The correlation of the dynamic texture of adjacent frames and the matching degree of SIFT features of two frames were compared, and the predetection results were obtained according to the matching results. Next, compared with the next frame of the dynamic texture and SIFT feature whose step size is lower than the human eye refresh frequency, the final result is obtained. Through experiments on multiple groups of different types of film and television data, high recall rate and accuracy rate can be obtained. The algorithm in this paper can detect the gradual change lens with the complex structure and obtain high detection accuracy and recall rate. A lens boundary detection algorithm based on fuzzy clustering is realized. The algorithm can detect sudden changes/gradual changes of the lens at the same time without setting a threshold. It can effectively reduce the factors that affect lens detection, such as flash, movies, TV, and advertisements, and can reduce the influence of camera movement on the boundaries of movies and TVs. However, due to the complexity of film and television, there are still some missing and false detections in this algorithm, which need further study.

An Image Registration Algorithm Based on Improved SIFT Feature

2013 ◽  
Vol 347-350 ◽  
pp. 3411-3415 ◽  
Author(s):  
Yin Wen Dong ◽  
Luan Wan ◽  
Zhao Ming Shi ◽  
Ming Lei Zhu
Keyword(s):  
Image Registration ◽  
Nearest Neighbor ◽  
Interpolation Method ◽  
Space Structure ◽  
Cruise Missile ◽  
Feature Descriptor ◽  
Sift Algorithm ◽  
Sift Feature ◽  
Registration Algorithm ◽  
Image Registration Algorithm

Aiming at there are long matching time and many wrong matching in the traditional SIFT algorithm, An image registration algorithm based on improved SIFT feature is put forward. First of all, through setting the number of extreme points in the feature point detection, feature points is found according to the DOG space structure from coarse to fine, and the improved SIFT feature descriptor generation algorithm is used. The preliminary matched point pairs are obtained by the nearest neighbor matching criterion, and the bilateral matching method is used for screening the preliminary matched point. Then, the second matching will be done by the similar measurement method based on mahalanobis distance, and RANSAC algorithm is used to calculate the affine transform model. Finally, the transformed image is resampled and interpolated through the bilinear interpolation method. Experimental results show that the algorithm can realize image registration effectively. Image registration technique is an important research content in computer vision and image processing in the, which are widely used in vehicle matching navigation and positioning, cruise missile terminal guidance, target tracking and recognition, image mosaic[1-6]. SIFT algorithm[3-5]can achieve image registration when there are translation, rotation, affine transformation between two images, even for images took by arbitrary angles. And SIFT feature is the milestone of local feature study. But there are long matching time and many wrong matching in the traditional SIFT algorithm, it is difficult to meet the requirement of fast image registration. This paper puts forward an image registration algorithm based on improved SIFT feature, which is robust for image rotation, affine and scale change, and is better than traditional SIFT algorithm.

A Image Registration Algorithm Based on Wavelet Pyramid for CCD Image

2014 ◽  
Vol 644-650 ◽  
pp. 4273-4277
Author(s):  
Gang Lu ◽  
J.P. Kang ◽  
Z.N. Zhai
Keyword(s):  
Image Registration ◽  
Search Strategy ◽  
Bottom Of The Pyramid ◽  
Hand Search ◽  
Registration Algorithm ◽  
Image Registration Algorithm ◽  
Feature Based ◽  
Hierarchical Image Registration ◽  
Ccd Image ◽  
Wavelet Pyramid

Image registration is the key process in analyzing images and data from satellites. Feature-based methods find correspondence pixels which point to the same place between two images. In this paper, a wavelet pyramid hierarchical image registration algorithm is presented. First mismatching exclusion policy on the top of pyramid is used. Other hand search strategy which gets the scope of the search layer on the bottom of the pyramid is adopted. Both of them rely on pair of matching-right points. Experimental results show that the algorithm can significantly improve the search efficiency, and obtain a good match accuracy and reliability.

Sign in / Sign up

Export Citation Format

Share Document