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.

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.

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.

Study of DEM Generation Method Based on Multi-Baseline Image Sequences in Alpine-Gorge Areas

2012 ◽  
Vol 239-240 ◽  
pp. 530-535 ◽  
Author(s):  
Hao Li ◽  
Shu Chen ◽  
Bo Su ◽  
Biao Yang
Keyword(s):  
Perspective Transformation ◽  
Measuring Method ◽  
Image Sequences ◽  
Relative Orientation ◽  
Matching Method ◽  
Initial Value ◽  
Relative Direction ◽  
Matching Process ◽  
Estimate Method ◽  
Baseline Image

Due to the peculiar terrain of Alpine and Gorge Areas, traditional measuring method is difficult to adapt. We studied on a DEM generation method based on multi-baseline image sequences including an initial value estimate method of relative direction elements based on the perspective transformation and a matching method of image sequences based on virtual epipolar plane. The experiment proves that the convergence and accuracy of relative orientation can be effectively improved by estimating the initial elements with perspective transformation. In matching process, the matching points are transferred through virtual epipolar plane. So that, we can decreased calculation redundancy and obtain multi-overlap corresponding points rapidly and accurately.

scholarly journals Using Least-Squares Residuals to Assess the Stochasticity of Measurements—Example: Terrestrial Laser Scanner and Surface Modeling

2021 ◽  
Vol 5 (1) ◽  
pp. 59
Author(s):  
Gaël Kermarrec ◽  
Niklas Schild ◽  
Jan Hartmann
Keyword(s):  
Least Squares ◽  
Laser Scanner ◽  
Real Data ◽  
Point Clouds ◽  
Statistical Testing ◽  
Normal Vector ◽  
Engineering Structures ◽  
3D Point Clouds ◽  
Least Squares Adjustment ◽  
Correlation Parameters

Terrestrial laser scanners (TLS) capture a large number of 3D points rapidly, with high precision and spatial resolution. These scanners are used for applications as diverse as modeling architectural or engineering structures, but also high-resolution mapping of terrain. The noise of the observations cannot be assumed to be strictly corresponding to white noise: besides being heteroscedastic, correlations between observations are likely to appear due to the high scanning rate. Unfortunately, if the variance can sometimes be modeled based on physical or empirical considerations, the latter are more often neglected. Trustworthy knowledge is, however, mandatory to avoid the overestimation of the precision of the point cloud and, potentially, the non-detection of deformation between scans recorded at different epochs using statistical testing strategies. The TLS point clouds can be approximated with parametric surfaces, such as planes, using the Gauss–Helmert model, or the newly introduced T-splines surfaces. In both cases, the goal is to minimize the squared distance between the observations and the approximated surfaces in order to estimate parameters, such as normal vector or control points. In this contribution, we will show how the residuals of the surface approximation can be used to derive the correlation structure of the noise of the observations. We will estimate the correlation parameters using the Whittle maximum likelihood and use comparable simulations and real data to validate our methodology. Using the least-squares adjustment as a “filter of the geometry” paves the way for the determination of a correlation model for many sensors recording 3D point clouds.

scholarly journals An Initial Value Estimation Method for the Kalman and Extended Kalman Filters in Underground Metal Detection

2019 ◽  
Vol 9 (19) ◽  
pp. 4113 ◽  
Author(s):  
Yadong Wan ◽  
Zhen Wang ◽  
Peng Wang ◽  
Zhiyang Liu ◽  
Na Li ◽  
...  
Keyword(s):  
Kalman Filter ◽  
Estimation Method ◽  
Detection Methods ◽  
Polarizability Tensor ◽  
Filter Method ◽  
Excellent Performance ◽  
Initial Value ◽  
Initial State ◽  
Metal Detection ◽  
Value Estimation

As an underground metal detection technology, the electromagnetic induction (EMI) method is widely used in many cases. Therefore, the EMI detection algorithms with excellent performance are worth studying. One of the EMI detection methods in the underground metal detection is the filter method, which first obtains the secondary magnetic field data and then uses the Kalman filter (KF) and the extended Kalman filter (EKF) to estimate the parameters of metal targets. However, the traditional KF methods used in the underground metal detection have an unsatisfactory performance of the convergence as the algorithms are given a random or a fixed initial value. Here, an initial state estimation algorithm for the underground metal detection is proposed. The initial state of the target’s horizontal position is estimated by the first order central moments of the secondary field strength map. In addition, the initial state of the target’s depth is estimated by the full width at half maximum (FWHM) method. In addition, the initial state of the magnetic polarizability tensor is estimated by the least squares method. Then, these initial states are used as the initial values for KF and EKF. Finally, the position, posture and polarizability of the target are recursively calculated. A simulation platform for the underground metal detection is built in this paper. The simulation results show that the initial value estimation method proposed for the filtering algorithm has an excellent performance in the underground metal detection.

Sign in / Sign up

Export Citation Format

Share Document