Image Matching Based on Scale Invariant Regions

Author(s):  
Lei Qin ◽  
Wei Zeng ◽  
Weiqiang Wang
Author(s):  
Lei Zhou ◽  
Siyu Zhu ◽  
Tianwei Shen ◽  
Jinglu Wang ◽  
Tian Fang ◽  
...  

Author(s):  
Yuan Xu ◽  
Hehui Lu ◽  
Defu Zhou ◽  
Jiongbin Zheng ◽  
Jianguo Zhang

A novel image matching algorithm based on both Taguchi method and spatial clustering is proposed to optimize the Scale Invariant Feature Transform (SIFT) matching results. To improve the matching accuracy, adaptive spatial clustering is used. What is more, in order to get the fitting parameters to balance matching accuracy and quantity, Taguchi method is adopted to optimize the key parameter combination including the ratio threshold of Euclidean distance and the constrain parameters in the process of adaptive spatial clustering. Moreover, signal-to-noise ratio (SNR) results are analyzed by variance to get the effect factor which is taken as the basis for the selection of optimized parameters. The optimum parameters combination is obtained eventually. The final experimental results show that the matching quality based on SIFT feature are improved significantly.


Author(s):  
Min Chen ◽  
Qing Zhu ◽  
Shengzhi Huang ◽  
Han Hu ◽  
Jingxue Wang

Improving the matching reliability of low-altitude images is one of the most challenging issues in recent years, particularly for images with large viewpoint variation. In this study, an approach for low-altitude remote sensing image matching that is robust to the geometric transformation caused by viewpoint change is proposed. First, multiresolution local regions are extracted from the images and each local region is normalized to a circular area based on a transformation. Second, interest points are detected and clustered into local regions. The feature area of each interest point is determined under the constraint of the local region which the point belongs to. Then, a descriptor is computed for each interest point by using the classical scale invariant feature transform (SIFT). Finally, a feature matching strategy is proposed on the basis of feature similarity confidence to obtain reliable matches. Experimental results show that the proposed method provides significant improvements in the number of correct matches compared with other traditional methods.


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.


Author(s):  
LICHUAN GENG ◽  
SONGZHI SU ◽  
DONGLIN CAO ◽  
SHAOZI LI

A novel perspective invariant image matching framework is proposed in this paper, noted as Perspective-Invariant Binary Robust Independent Elementary Features (PBRIEF). First, we use the homographic transformation to simulate the distortion between two corresponding patches around the feature points. Then, binary descriptors are constructed by comparing the intensity of sample points surrounding the feature location. We transform the location of the sample points with simulated homographic matrices. This operation is to ensure that the intensities which we compared are the realistic corresponding pixels between two image patches. Since the exact perspective transform matrix is unknown, an Adaptive Particle Swarm Optimization (APSO) algorithm-based iterative procedure is proposed to estimate the real transformation angles. Experimental results obtained on five different datasets show that PBRIEF outperforms significantly the existing methods on images with large viewpoint difference. Moreover, the efficiency of our framework is also improved comparing with Affine-Scale Invariant Feature Transform (ASIFT).


Sign in / Sign up

Export Citation Format

Share Document