scholarly journals Geometric-constrained multi-view image matching method based on semi-global optimization

2018 ◽  
Vol 21 (2) ◽  
pp. 115-126 ◽  
Author(s):  
Wenhao Zhao ◽  
Li Yan ◽  
Yunsheng Zhang
2012 ◽  
Vol 220-223 ◽  
pp. 1356-1361
Author(s):  
Xi Jie Tian ◽  
Jing Yu ◽  
Chang Chun Li

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.


2021 ◽  
Vol 5 (4) ◽  
pp. 783-793
Author(s):  
Muhammad Muttabi Hudaya ◽  
Siti Saadah ◽  
Hendy Irawan

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.


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.


Author(s):  
C. Zhang ◽  
Y. Ge ◽  
Q. Zhang ◽  
B. Guo

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.


Author(s):  
S. Rhee ◽  
T. Kim

3D spatial information from unmanned aerial vehicles (UAV) images is usually provided in the form of 3D point clouds. For various UAV applications, it is important to generate dense 3D point clouds automatically from over the entire extent of UAV images. In this paper, we aim to apply image matching for generation of local point clouds over a pair or group of images and global optimization to combine local point clouds over the whole region of interest. We tried to apply two types of image matching, an object space-based matching technique and an image space-based matching technique, and to compare the performance of the two techniques. The object space-based matching used here sets a list of candidate height values for a fixed horizontal position in the object space. For each height, its corresponding image point is calculated and similarity is measured by grey-level correlation. The image space-based matching used here is a modified relaxation matching. We devised a global optimization scheme for finding optimal pairs (or groups) to apply image matching, defining local match region in image- or object- space, and merging local point clouds into a global one. For optimal pair selection, tiepoints among images were extracted and stereo coverage network was defined by forming a maximum spanning tree using the tiepoints. From experiments, we confirmed that through image matching and global optimization, 3D point clouds were generated successfully. However, results also revealed some limitations. In case of image-based matching results, we observed some blanks in 3D point clouds. In case of object space-based matching results, we observed more blunders than image-based matching ones and noisy local height variations. We suspect these might be due to inaccurate orientation parameters. The work in this paper is still ongoing. We will further test our approach with more precise orientation parameters.


2012 ◽  
Vol 239-240 ◽  
pp. 1133-1137 ◽  
Author(s):  
Li Ming Guan ◽  
Qian Kai Yang ◽  
Jian Lin ◽  
Yi Fan Wu

A two-dimensional image matching method based on the improved Hausdorff distance and global harmony search optimization is presented in this paper. First, edges are extracted form the original images by the Canny edge detector. Then, a fitness function based on the improved Hausdorff distance is constructed. Finally the global harmony search optimization is adopted to optimize the fitness function. Experiments show that the proposed method is able to locate the object of interest globally and efficiently.


2018 ◽  
Vol 6 (1) ◽  
pp. 78-90 ◽  
Author(s):  
Cuong Nguyen KIM ◽  
Kei KAWAMURA ◽  
Masando SHIOZAKI ◽  
Amir TARIGHAT

Sign in / Sign up

Export Citation Format

Share Document