The Method of Round Image Matching Based on Log-Polar Transform*

2011 ◽  
Vol 467-469 ◽  
pp. 1024-1029
Author(s):  
Zhi Jia Zhang ◽  
Jing Chen
Keyword(s):  
Image Matching ◽  
Matching Method ◽  
Matching Problem ◽  
Matching Methods ◽  
Polar Coordinate ◽  
Angle Rotation ◽  
Image Transform ◽  
Traditional Image

Traditional image matching methods are not proper for the situation of the angle rotation. Aiming at this problem, This paper proposes an round image matching method based on log-polar transform. Log-polar image transform can convert the rotation changes in Descartes coordinate to shift changes in log-polar coordinate, which had such trait as invariance to rotation. Results show that this algorithm based on log-polar transform can match the images with rotation changes, Compared with existing algorithms, the new algorithm not only had higher matching rate and stronger adaptability, but also can effectively solve matching problem under the circumstance of brightness changes, contrast changes or noise interferences.

Image Matching Using a Bat Algorithm with Mutation

2012 ◽  
Vol 203 ◽  
pp. 88-93 ◽  
Author(s):  
Jia Wei Zhang ◽  
Gai Ge Wang
Keyword(s):  
Image Matching ◽  
Heuristic Method ◽  
Bat Algorithm ◽  
Optimization Methods ◽  
Population Based ◽  
The Other ◽  
Matching Problem ◽  
New Approach ◽  
Strong Robustness ◽  
Traditional Image

Due to shortcoming of traditional image matching for computing the fitness for every pixel in the searching space, a new bat algorithm with mutation (BAM) is proposed to solve image matching problem, and a modification is applied to mutate between bats during the process of the new solutions updating. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic BA. The realization procedure for this improved meta-heuristic approach BAM is also presented. To prove the performance of this proposed meta-heuristic method, BAM is compared with BA and other population-based optimization methods, DE and SGA. The experiment shows that the proposed approach is more effective and feasible in image matching than the other model.

Identification of the Hook on Investment Casting Shell Line Based on Machine Vision

2012 ◽  
Vol 220-223 ◽  
pp. 1356-1361
Author(s):  
Xi Jie Tian ◽  
Jing Yu ◽  
Chang Chun Li
Keyword(s):  
Machine Vision ◽  
Investment Casting ◽  
Hough Transform ◽  
Image Matching ◽  
Feature Matching ◽  
Image Acquisition ◽  
Target Range ◽  
Target Area ◽  
Matching Method ◽  
Vertical Projection

In this paper, the idea identify the hook on investment casting shell line based on machine vision has been proposed. According to the characteristic of the hook, we do the image acquisition and preprocessing, we adopt Hough transform to narrow the target range, and find the target area based on the method combining the level projection and vertical projection, use feature matching method SIFT to do the image matching. Finally, we get the space information of the target area of the hook.

Implementation of Verification and Matching E-KTP with Faster R-CNN and ORB

2021 ◽  
Vol 5 (4) ◽  
pp. 783-793
Author(s):  
Muhammad Muttabi Hudaya ◽  
Siti Saadah ◽  
Hendy Irawan
Keyword(s):  
Image Matching ◽  
Nearest Neighbor ◽  
Feature Matching ◽  
Image Feature ◽  
Brute Force ◽  
K Nearest Neighbor ◽  
Matching Method ◽  
Average Precision ◽  
Detection Model ◽  
Matching Process

needs a solid validation that has verification and matching uploaded images. To solve this problem, this paper implementing a detection model using Faster R-CNN and a matching method using ORB (Oriented FAST and Rotated BRIEF) and KNN-BFM (K-Nearest Neighbor Brute Force Matcher). The goal of the implementations is to reach both an 80% mark of accuracy and prove matching using ORB only can be a replaced OCR technique. The implementation accuracy results in the detection model reach mAP (Mean Average Precision) of 94%. But, the matching process only achieves an accuracy of 43,46%. The matching process using only image feature matching underperforms the previous OCR technique but improves processing time from 4510ms to 60m). Image matching accuracy has proven to increase by using a high-quality dan high quantity dataset, extracting features on the important area of EKTP card images.

Pigeon-inspired optimization and lateral inhibition for image matching of autonomous aerial refueling

2017 ◽  
Vol 232 (8) ◽  
pp. 1571-1583 ◽  
Author(s):  
Yongbin Sun ◽  
Haibin Duan
Keyword(s):  
Particle Swarm Optimization ◽  
Lateral Inhibition ◽  
Image Matching ◽  
Hybrid Algorithm ◽  
Particle Swarm ◽  
Matching Problem ◽  
Aerial Refueling ◽  
Swarm Optimization ◽  
Swarm Intelligence Algorithm ◽  
Computation Speed

Autonomous aerial refueling (AAR) is an essential application of unmanned aerial vehicles for both military and civilian domains. In this paper, a hybrid algorithm of the pigeon-inspired optimization (PIO) and lateral inhibition (LI), called LI-PIO, is proposed for image matching problem of AAR. LI is adopted for image pre-processing to enhance the edges and contrast of images. PIO, inspired from the homing characteristics of pigeons, is a novel bio-inspired swarm intelligence algorithm. To demonstrate the effectiveness and feasibility of our proposed algorithm, we make extensive comparative experiments with particle swarm optimization (PSO), particle swarm optimization based on lateral inhibition (LI-PSO), and PIO. It can be concluded from the experimental results that our proposed LI-PIO has excellent performances for image matching problem of AAR, especially in convergent rate and computation speed.

scholarly journals Hybrid Invariant Local Features for Multiple Satellite Image Matching and Registration

2019 ◽  
Vol 9 (2) ◽  
pp. 309-314
Keyword(s):  
Image Matching ◽  
Feature Matching ◽  
Satellite Image ◽  
Remote Sensing Data ◽  
Local Features ◽  
Feature Descriptor ◽  
Matching Method ◽  
Multiple Images ◽  
Feature Sets ◽  
Precise Relationship

Automatic image registration (IR) is very challenging and very important in the field of hyperspectral remote sensing data. Efficient autonomous IR method is needed with high precision, fast, and robust. A key operation of IR is to align the multiple images in single co-ordinate system for extracting and identifying variation between images considered. In this paper, presented a feature descriptor by combining features from both Feature from Accelerated Segment Test (FAST) and Binary Robust Invariant Scalable Key point (BRISK). The proposed hybrid invariant local features (HILF) descriptor extract useful and similar feature sets from reference and source images. The feature matching method allows finding precise relationship or matching among two feature sets. An experimental analysis described the outcome BRISK, FASK and proposed HILF in terms of inliers ratio and repeatability evaluation metrics.

scholarly journals OPTIMIZATION ALGORITHM OF TILTED IMAGE MATCHING BASED ON ADAPTIVE INITIAL OBJECT ASPECT

2020 ◽  
Vol XLIII-B2-2020 ◽  
pp. 547-554
Author(s):  
C. Zhang ◽  
Y. Ge ◽  
Q. Zhang ◽  
B. Guo
Keyword(s):  
Least Squares ◽  
Image Matching ◽  
Normal Vector ◽  
Matching Method ◽  
Initial Value ◽  
Initial State ◽  
Matching Process ◽  
Low Degree ◽  
Verification Process ◽  
Initial Object

Abstract. When adopting the matching method of the least squares image based on object-patch to match tilted images, problems like the low degree of connection points for images with the discontinuity of depth or the discrepancy in elevation or low availability of aerotriangulation points would frequently appear. To address such problems, a tilted-image-matching algorithm based on an adaptive initial object-patch is proposed by this paper. By means of the existing initial values of the interior and exterior orientation elements of the tilted image and the information of object points generated in the matching process, the algorithm takes advantage of the method of multi-patch forward intersection and object variance partition so as to adaptively calculate the elevation of the object-patch and the initial value of the normal vector direction angle. Furthermore, this algorithm aims to solve the problem of difficulties in matching the tilted image with its corresponding points brought about by the low accuracy of the initial value of the tilted image when adopting the matching method of the least squares image based on object-patch to match the tilted image with high discrepancy in elevation. We adopt the algorithm as proposed in this paper and the least squares image matching method in which the initial state of the object-patch is horizontal to the object-patch respectively to conduct the verification process of comparing and matching two groups of tilted images. Finally, the effectiveness of the algorithm as proposed in this paper is verified by the testing results.

Sign in / Sign up

Export Citation Format

Share Document