scholarly journals AN IMPROVED IMAGE MATCHING METHOD BASED ON SURF ALGORITHM

2018 ◽  
Vol XLII-3 ◽  
pp. 179-184 ◽  
Author(s):  
S. J. Chen ◽  
S. Z. Zheng ◽  
Z. G. Xu ◽  
C. C. Guo ◽  
X. L. Ma
Keyword(s):  
Remote Sensing ◽  
Information Entropy ◽  
Image Matching ◽  
Feature Matching ◽  
Operating Efficiency ◽  
Similarity Function ◽  
Entropy Theory ◽  
Matching Method ◽  
Matching Process ◽  
Invariant Transformation

Many state-of-the-art image matching methods, based on the feature matching, have been widely studied in the remote sensing field. These methods of feature matching which get highly operating efficiency, have a disadvantage of low accuracy and robustness. This paper proposes an improved image matching method which based on the SURF algorithm. The proposed method introduces color invariant transformation, information entropy theory and a series of constraint conditions to increase feature points detection and matching accuracy. First, the model of color invariant transformation is introduced for two matching images aiming at obtaining more color information during the matching process and information entropy theory is used to obtain the most information of two matching images. Then SURF algorithm is applied to detect and describe points from the images. Finally, constraint conditions which including Delaunay triangulation construction, similarity function and projective invariant are employed to eliminate the mismatches so as to improve matching precision. The proposed method has been validated on the remote sensing images and the result benefits from its high precision and robustness.

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.

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.

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.

scholarly journals ROLE OF TIE-POINTS DISTRIBUTION IN AERIAL PHOTOGRAPHY

2016 ◽  
Vol XL-3/W4 ◽  
pp. 41-44
Author(s):  
S. Kerner ◽  
I. Kaufman ◽  
Y. Raizman
Keyword(s):  
Feature Extraction ◽  
Spatial Distribution ◽  
Aerial Photography ◽  
Image Matching ◽  
Feature Matching ◽  
Real Data ◽  
Matching Process ◽  
Feature Based ◽  
Extraction Stage

Automatic image matching algorithms, and especially feature-based methods, profoundly changed our understanding and requirements of tie points. The number of tie points has increased by orders of magnitude, yet the notions of accuracy and reliability of tie points remain equally important. The spatial distribution of tie points is less predictable, and is subject only to limited control. Feature-based methods also highlighted a conceptual division of the matching process into two separate stages – feature extraction and feature matching. <br><br> In this paper we discuss whether spatial distribution requirements, such as Von Gruber positions, are still relevant to modern matching methods. We argue that forcing such patterns might no longer be required in the feature extraction stage. However, we claim spatial distribution is important in the feature matching stage. <br><br> We will focus on terrains that are notorious for difficult matching, such as water bodies, with real data obtained by users of VisionMap’s A3 Edge camera and LightSpeed photogrammetric suite.

scholarly journals Feedback Unilateral Grid-Based Clustering Feature Matching for Remote Sensing Image Registration

2019 ◽  
Vol 11 (12) ◽  
pp. 1418
Author(s):  
Zhaohui Zheng ◽  
Hong Zheng ◽  
Yong Ma ◽  
Fan Fan ◽  
Jianping Ju ◽  
...  
Keyword(s):  
Remote Sensing ◽  
Image Registration ◽  
Image Matching ◽  
Feature Matching ◽  
Remote Sensing Image ◽  
Registration Accuracy ◽  
Computation Efficiency ◽  
Feature Based ◽  
Local Grid ◽  
Grid Based

In feature-based image matching, implementing a fast and ultra-robust feature matching technique is a challenging task. To solve the problems that the traditional feature matching algorithm suffers from, such as long running time and low registration accuracy, an algorithm called feedback unilateral grid-based clustering (FUGC) is presented which is able to improve computation efficiency, accuracy and robustness of feature-based image matching while applying it to remote sensing image registration. First, the image is divided by using unilateral grids and then fast coarse screening of the initial matching feature points through local grid clustering is performed to eliminate a great deal of mismatches in milliseconds. To ensure that true matches are not erroneously screened, a local linear transformation is designed to take feedback verification further, thereby performing fine screening between true matching points deleted erroneously and undeleted false positives in and around this area. This strategy can not only extract high-accuracy matching from coarse baseline matching with low accuracy, but also preserves the true matching points to the greatest extent. The experimental results demonstrate the strong robustness of the FUGC algorithm on various real-world remote sensing images. The FUGC algorithm outperforms current state-of-the-art methods and meets the real-time requirement.

scholarly journals RESEARCH PROGRESS ON FEATURE MATCHING OF SAR AND OPTICAL IMAGES

2020 ◽  
Vol XLII-3/W10 ◽  
pp. 77-82 ◽  
Author(s):  
H. Qian ◽  
J. W. Yue ◽  
M. Chen
Keyword(s):  
Image Matching ◽  
Feature Matching ◽  
Optical Image ◽  
Research Progress ◽  
Phase Congruency ◽  
Matching Method ◽  
Sift Algorithm ◽  
Matching Problems ◽  
Optical Images ◽  
Edge Features

Abstract. Before obtaining information and identifying ground target from images, image matching is necessary. However, problems of strong pixel noise interference and nonlinear gray scale differences in synthetic aperture radar image still exist. Feature matching becomes a kind possible solution. To learn the research progress of SAR and optical image matching, as well as finding solutions for above matching problems, a summary for feature matching with SAR and optical image is indispensable. By listing three typical methods below, we can discuss and compare how researchers improve and innovate methods for feature matching from different angles in matching process. First method is feature matching method proposed by CHEN Min et. It uses phase congruency method to detect point features. Feature descriptors are based on gaussian-gamma-shaped edge strength maps instead of original images. This method combines both edge features and point features to reach a match target. The second one is SAR-SIFT algorithm of F. Dellinger et. This kind of method is based on improvement of sift algorithm. It proposes a SAR-Harris method and also a calculation method for features descriptors named gradient by ratio. Thirdly, it is feature matching method proposed by Yu Qiuze et. By using edge features of image and improvement of hausdorff distance for similarity measure, it applies genetic algorithm to accelerate matching search process to complete matching tasks. Those methods are implemented by using python programs, and are compared by some indexes. Experimental data used multiple sets of terrasar and optical image pairs of different resolutions. To some extent, the results demonstrate that all three kinds of feature methods can improve the matching effect between SAR and optical images. It can be easier to reach match purposes of SAR and optical images by using image edge features, while such methods are too dependent on the edge features.

Research of Image Matching Based on Evolutionary Algorithm

2012 ◽  
Vol 236-237 ◽  
pp. 1168-1171
Author(s):  
Qing Hua Wu ◽  
Fang Xie ◽  
Yu Xin Sun ◽  
Jin Zhang ◽  
Xue Song Yan
Keyword(s):  
Evolutionary Algorithm ◽  
Image Matching ◽  
Search Strategy ◽  
Orthogonal Test ◽  
Match Problem ◽  
Matching Method ◽  
Matching Algorithm ◽  
Image Match ◽  
Matching Process ◽  
Common Defect

In image matching research, how to ensure that best match’s accuracy of the premise and a significant reduction in the amount of computing is the focus of concern by researchers. Search strategy to find the best match location of the image matching process to determine the amount of computing of image matching, in the existing image matching method are used to traverse search strategy, it is difficult to reduce the amount of computing. This is a common defect of the existing image matching algorithm. Traditional evolutionary algorithm trapped into the local minimum easily. Therefore, based on a simple evolutionary algorithm and combine the base ideology of orthogonal test then applied it to the population initialization, to prevent local convergence to form a new evolutionary algorithm. Compared the traditional evolutionary algorithm, the new algorithm enlarges the searching space and the complexity is not high. We use this new algorithm in image matching; from the results we reach the conclusion: in the optimization precision and the optimization speed, the new algorithm is efficiency for the image match problem.

scholarly journals SIFT Saliency Analysis for Matching Repetitive Structures

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Yan Yang ◽  
Xiaopeng Hu ◽  
Lijuan Xu ◽  
Fan Wang
Keyword(s):  
Monte Carlo Simulation ◽  
Monte Carlo ◽  
Image Matching ◽  
Feature Matching ◽  
Region Of Interest ◽  
Reference Image ◽  
Matching Method ◽  
Feature Saliency ◽  
Saliency Analysis ◽  
Feature Stability

The ambiguity resulting from repetitive structures in a scene presents a major challenge for image matching. This paper proposes a matching method based on SIFT feature saliency analysis to achieve robust feature matching between images with repetitive structures. The feature saliency within the reference image is estimated by analyzing feature stability and dissimilarity via Monte-Carlo simulation. In the proposed method, feature matching is performed only within the region of interest to reduce the ambiguity caused by repetitive structures. The experimental results demonstrate the efficiency and robustness of the proposed method, especially in the presence of respective structures.

Sign in / Sign up

Export Citation Format

Share Document