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.

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.

scholarly journals FSD-BRIEF: A Distorted BRIEF Descriptor for Fisheye Image Based on Spherical Perspective Model

Sensors ◽  
2021 ◽  
Vol 21 (5) ◽  
pp. 1839
Author(s):  
Yutong Zhang ◽  
Jianmei Song ◽  
Yan Ding ◽  
Yating Yuan ◽  
Hua-Liang Wei
Keyword(s):  
Feature Matching ◽  
Field Of View ◽  
Image Feature ◽  
Feature Points ◽  
Matching Process ◽  
Feature Descriptors ◽  
Coordinate Mapping ◽  
Matching Performance ◽  
Perspective Model ◽  
Attitude Matrix

Fisheye images with a far larger Field of View (FOV) have severe radial distortion, with the result that the associated image feature matching process cannot achieve the best performance if the traditional feature descriptors are used. To address this challenge, this paper reports a novel distorted Binary Robust Independent Elementary Feature (BRIEF) descriptor for fisheye images based on a spherical perspective model. Firstly, the 3D gray centroid of feature points is designed, and the position and direction of the feature points on the spherical image are described by a constructed feature point attitude matrix. Then, based on the attitude matrix of feature points, the coordinate mapping relationship between the BRIEF descriptor template and the fisheye image is established to realize the computation associated with the distorted BRIEF descriptor. Four experiments are provided to test and verify the invariance and matching performance of the proposed descriptor for a fisheye image. The experimental results show that the proposed descriptor works well for distortion invariance and can significantly improve the matching performance in fisheye images.

scholarly journals Detection Model on Fatigue Driving Behaviors Based on the Operating Parameters of Freight Vehicles

2021 ◽  
Vol 11 (15) ◽  
pp. 7132
Author(s):  
Jianfeng Xi ◽  
Shiqing Wang ◽  
Tongqiang Ding ◽  
Jian Tian ◽  
Hui Shao ◽  
...  
Keyword(s):  
Traffic Accidents ◽  
Nearest Neighbor ◽  
K Nearest Neighbor ◽  
Nearest Neighbor Algorithm ◽  
Operating Data ◽  
Detection Model ◽  
Driving Behaviors ◽  
K Nearest Neighbor Algorithm ◽  
Fatigue Driving ◽  
Freight Vehicles

Whether in developing or developed countries, traffic accidents caused by freight vehicles are responsible for more than 10% of deaths of all traffic accidents. Fatigue driving is one of the main causes of freight vehicle accidents. Existing fatigue driving studies mostly use vehicle operating data from experiments or simulation data, exposing certain drawbacks in the validity and reliability of the models used. This study collected a large quantity of real driving data to extract sample data under different fatigue degrees. The parameters of vehicle operating data were selected based on significant driver fatigue degrees. The k-nearest neighbor algorithm was used to establish the detection model of fatigue driving behaviors, taking into account influence of the number of training samples and other parameters in the accuracy of fatigue driving behavior detection. With the collected operating data of 50 freight vehicles in the past month, the fatigue driving behavior detection models based on the k-nearest neighbor algorithm and the commonly used BP neural network proposed in this paper were tested, respectively. The analysis results showed that the accuracy of both models are 75.9%, but the fatigue driving detection model based on the k-nearest neighbor algorithm is more reliable.

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 K-NN Classification of Brain Dominance

2018 ◽  
Vol 8 (4) ◽  
pp. 2494
Author(s):  
Khairul Amrizal Abu Nawas ◽  
Mahfuzah Mustafa ◽  
Rosdiyana Samad ◽  
Dwi Pebrianti ◽  
Nor Rul Hasma Abdullah
Keyword(s):  
Wavelet Analysis ◽  
Nearest Neighbor ◽  
Gabor Wavelet ◽  
Image Feature ◽  
Band Pass Filter ◽  
K Nearest Neighbor ◽  
Brain Dominance ◽  
Pass Filter ◽  
Band Frequency ◽  
The Brain

<span>The brain dominance is referred to right brain and left brain. The brain dominance can be observed with an Electroencephalogram (EEG) signal to identify different types of electrical pattern in the brain and will form the foundation of one’s personality. The objective of this project is to analyze brain dominance by using Wavelet analysis. The Wavelet analysis is done in 2-D Gabor Wavelet and the result of 2-D Gabor Wavelet is validated with an establish brain dominance questionnaire. Twenty-one samples from University Malaysia Pahang (UMP) student are required to answer the establish brain dominance questionnaire has been collected in this experiment. Then, brainwave signal will record using Emotiv device. The threshold value is used to remove the artifact and noise from data collected to acquire a smoother signal. Next, the Band-pass filter is applied to the signal to extract the sub-band frequency components from Delta, Theta, Alpha, and Beta. After that, it will extract the energy of the signal from image feature extraction process. Next the features were classified by using K-Nearest Neighbor (K-NN) in two ratios which 70:30 and 80:20 that are training set and testing set (training: testing). The ratio of 70:30 gave the highest percentage of 83% accuracy while a ratio of 80:20 gave 100% accuracy. The result shows that 2-D Gabor Wavelet was able to classify brain dominance with accuracy 83% to 100%.</span>

scholarly journals EMCM: A Novel Binary Edge-Feature-Based Maximum Clique Framework for Multispectral Image Matching

2019 ◽  
Vol 11 (24) ◽  
pp. 3026
Author(s):  
Bin Fang ◽  
Kun Yu ◽  
Jie Ma ◽  
Pei An
Keyword(s):  
Image Matching ◽  
Nearest Neighbor ◽  
Feature Matching ◽  
Maximum Clique ◽  
Feature Space ◽  
Multispectral Image ◽  
Feature Descriptor ◽  
Ranking Algorithm ◽  
Feature Based ◽  
Edge Feature

Seeking reliable correspondence between multispectral images is a fundamental and important task in computer vision. To overcome the nonlinearity problem occurring in multispectral image matching, a novel, edge-feature-based maximum clique-matching frame (EMCM) is proposed, which contains three main parts: (1) a novel strong edge binary feature descriptor, (2) a new correspondence-ranking algorithm based on keypoint distinctiveness analysis algorithms in the feature space of the graph, and (3) a false match removal algorithm based on maximum clique searching in the correspondence space of the graph considering both position and angle consistency. Extensive experiments are conducted on two standard multispectral image datasets with respect to the three parts. The feature-matching experiments suggest that the proposed feature descriptor is of high descriptiveness, robustness, and efficiency. The correspondence-ranking experiments validate the superiority of our correspondences-ranking algorithm over the nearest neighbor algorithm, and the coarse registration experiments show the robustness of EMCM with varied interferences.

Sign in / Sign up

Export Citation Format

Share Document