• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.26 no.4
• /
• pp.407-414
• /
• 2008

This study introduces an automatic image matching algorithm that can be applied for the scale different image pairs consisting of the satellite pushbroom images and the aerial frame images. The proposed method is based on several image processing techniques such as pre-processing, filtering, edge thinning, interest point extraction, and key-descriptor matching, in order to enhance the matching accuracy and the processing speed. The proposed method utilizes various characteristics, such as the different geometry of image acquisition and the different radiometric characteristics, of the multi-sensor images. In addition, the suggested method uses the sensor model to minimize search area and eliminate false-matching points automatically.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1003-1010
• /
• 2004

In this paper, we address efficient processing of subsequence matching in time-series databases. We first point out the performance problems occurring in the index searching of a prior method for subsequence matching. Then, we propose a new method that resolves these problems. Our method starts with viewing the index searching of subsequence matching from a new angle, thereby regarding it as a kind of a spatial-join called a window-join. For speeding up the window-join, our method builds an R＊-tree in main memory for f query sequence at starting of sub-sequence matching. Our method also includes a novel algorithm for joining effectively one R＊-tree in disk, which is for data sequences, and another R＊-tree in main memory, which is for a query sequence. This algorithm accesses each R＊-tree page built on data sequences exactly cure without incurring any index-level false alarms. Therefore, in terms of the number of disk accesses, the proposed algorithm proves to be optimal. Also, performance evaluation through extensive experiments shows the superiority of our method quantitatively.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2022.07a
• /
• pp.563-566
• /
• 2022

본 논문에서는 증강현실에서 객체 증강 시, 특징점과 GPS를 이용하여 증강 위치를 효율적으로 보간할 수 있는 ICP(Iterative closest point) 매칭 기법을 제안한다. 다양한 환경에서 제한받지 않고 객체를 증강하기 위해 일반적으로 마커리스(Markerless) 방식을 사용하며, 대표적으로 평면 검출과 페이스 검출을 사용한다. 이는 현실과 자연스러운 동기화를 위한 것으로 계산은 작지만, 인식의 범위가 넓기 때문에 증강 위치에 대한 오차가 존재한다. 이러한 작은 오차는 특정 산업에서는 치명적일 수 있으며, 특히 건설이나 의료시설에서 발생하면 큰 사고로 이어진다. 객체를 증강 시킬 때 해당 환경에 대한 점 구름(Point cloud)을 수집하여 데이터베이스에 저장한다. 본 논문에서는 관측되는 점 구름과의 오차를 줄이기 위해 ICP 매칭 기법을 사용하며, 실린더 기반의 각도 보간을 이용하여 계산량을 줄인다. 결과적으로 특징점과 GPS를 이용하여 ICP 매칭 기법을 통해 효율적으로 처리함으로써, 증강 위치에 대한 정확도가 개선된 증강 방식을 보여준다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.6
• /
• pp.453-464
• /
• 2019

Recently, as the demand for 3D geospatial information increases, the importance of rapid and accurate data construction has increased. Although many studies have been conducted to register UAV (Unmanned Aerial Vehicle) imagery based on LiDAR (Light Detection and Ranging) data, which is capable of precise 3D data construction, studies using LiDAR data embedded in MMS (Mobile Mapping System) are insufficient. Therefore, this study compared and analyzed 9 matching algorithms based on feature points for registering reflectance image converted from LiDAR point cloud intensity data acquired from MMS with image data from UAV. Our results indicated that when the SIFT (Scale Invariant Feature Transform) algorithm was applied, it was able to stable secure a high matching accuracy, and it was confirmed that sufficient conjugate points were extracted even in various road environments. For the registration accuracy analysis, the SIFT algorithm was able to secure the accuracy at about 10 pixels except the case when the overlapping area is low and the same pattern is repeated. This is a reasonable result considering that the distortion of the UAV altitude is included at the time of UAV image capturing. Therefore, the results of this study are expected to be used as a basic research for 3D registration of LiDAR point cloud intensity data and UAV imagery.

• Korean Journal of Remote Sensing
• /
• v.34 no.6_1
• /
• pp.941-951
• /
• 2018

Utilization and demand of UAV (unmanned aerial vehicle) for the generation of 3D city model are increasing. In this study, we performed an experiment to adjustment position/orientation of UAV with incomplete attitude information and to extract point cloud data. In order to correct the attitude of the UAV, the rotation angle was calculated by using the continuous position information of UAV movements. Based on this, the corrected position/orientation information was obtained by applying IBA (Incremental Bundle Adjustment) based on photogrammetry. Each pair was transformed into an epipolar image, and the MDR (Multi-Dimensional Relaxation) technique was applied to obtain high precision DSM. Each extracted pair is aggregated and output in the form of a single point cloud or DSM. Using the DJI inspire1 and Phantom4 images, we can confirm that the point cloud can be extracted which expresses the railing of the building clearly. In the future, research will be conducted on improving the matching performance and establishing sensor models of oblique images. After that, we will continue the image processing technology for the generation of the 3D city model through the study of the extraction of 3D cloud It should be developed.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.44 no.2
• /
• pp.263-270
• /
• 2024

As unmanned aerial vehicles(UAVs) and sensors have been developed in a variety of ways, it has become possible to update information on the ground faster than existing aerial photography or remote sensing. However, acquisition and input of ground control points(GCPs) UAV photogrammetry takes a lot of time, and geometric distortion occurs if measurement and input of GCPs are incorrect. In this study, RGB-based orthophotos were generated to reduce GCPs measurment and input time, and comparison and evaluation were performed by applying feature point algorithms to target orthophotos from various sensors. Four feature point extraction algorithms were applied to the two study sites, and as a result, speeded up robust features(SURF) was the best in terms of the ratio of matching pairs to feature points. When compared overall, the accelerated-KAZE(AKAZE) method extracted the most feature points and matching pairs, and the binary robust invariant scalable keypoints(BRISK) method extracted the fewest feature points and matching pairs. Through these results, it was confirmed that the AKAZE method is superior when performing geometric correction of the objective orthophoto for each sensor.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1102-1107
• /
• 2004

Fingerprint Recognition System is made up of Off-line treatment and On-line treatment; the one is registering all the information of there trieving features which are retrieved in the digitalized fingerprint getting out of the analog fingerprint through the fingerprint acquisition device and the other is the treatment making the decision whether the users are approved to be accessed to the system or not with matching them with the fingerprint features which are retrieved and database from the input fingerprint when the users are approaching the system to use. In matching between On-line and Off-line treatment, the most important thing is which features we are going to use as the standard. Therefore, we have been using “Delta” and “Core” as this standard until now, but there might have been some deficits not to exist in every person when we set them up as the standards. In order to handle the users who do not have those features, we are still using the matching method which enables us to make up of the spanning tree or the triangulation with the relations of the spanned feature. However, there are some overheads of the time on these methods and it is not sure whether they make the correct matching or not. Therefore, I would like to represent the more correct matching algorism in this paper which has not only better matching rate but also lower mismatching rate compared to the present matching algorism by selecting the line segment connecting two minutiae on the same ridge and furrow structures as the reference point.

• Korean Journal of Remote Sensing
• /
• v.34 no.6_2
• /
• pp.1251-1260
• /
• 2018

High-quality sea-ice surface models generated from aerial images can be used effectively as field data for developing satellite-based remote sensing methods but also as analysis data for understanding geometric variations of Arctic sea-ice. However, the lack of texture information on sea-ice surfaces can reduce the accuracy of image matching. In this paper, we analyze the performance of matching cost functions for homogeneous sea-ice surfaces as a part of high-quality sea-ice surface model generation. The matching cost functions include sum of squared differences (SSD), normalized cross-correlation (NCC), and zero-mean normalized cross-correlation (ZNCC) in image domain and phase correlation (PC), orientation correlation (OC), and gradient correlation (GC) in frequency domain. In order to analyze the matching performance for texture changes clearly and objectively, a new evaluation methodology based on the principle of object-space matching technique was introduced. Experimental results showed that it is possible to secure reliability and accuracy of image matching only when optimal search windows are variably applied to each matching point in textureless regions such as sea-ice surfaces. Among the matching cost functions, NCC and ZNCC showed the best performance for texture changes.

• Korean Journal of Remote Sensing
• /
• v.38 no.6_1
• /
• pp.1057-1068
• /
• 2022

This paper compares the combination performance of feature point-based matching algorithms as a study to confirm the matching possibility between image taken by a user and a virtual texture image with the goal of developing mobile-based real-time image positioning technology. The feature based matching algorithm includes process of extracting features, calculating descriptors, matching features from both images, and finally eliminating mismatched features. At this time, for matching algorithm combination, we combined the process of extracting features and the process of calculating descriptors in the same or different matching algorithm respectively. V-World 3D desktop was used for the virtual indoor texture image. Currently, V-World 3D desktop is reinforced with details such as vertical and horizontal protrusions and dents. In addition, levels with real image textures. Using this, we constructed dataset with virtual indoor texture data as a reference image, and real image shooting at the same location as a target image. After constructing dataset, matching success rate and matching processing time were measured, and based on this, matching algorithm combination was determined for matching real image with virtual image. In this study, based on the characteristics of each matching technique, the matching algorithm was combined and applied to the constructed dataset to confirm the applicability, and performance comparison was also performed when the rotation was additionally considered. As a result of study, it was confirmed that the combination of Scale Invariant Feature Transform (SIFT)'s feature and descriptor detection had the highest matching success rate, but matching processing time was longest. And in the case of Features from Accelerated Segment Test (FAST)'s feature detector and Oriented FAST and Rotated BRIEF (ORB)'s descriptor calculation, the matching success rate was similar to that of SIFT-SIFT combination, while matching processing time was short. Furthermore, in case of FAST-ORB, it was confirmed that the matching performance was superior even when 10° rotation was applied to the dataset. Therefore, it was confirmed that the matching algorithm of FAST-ORB combination could be suitable for matching between virtual texture image and real image.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.1
• /
• pp.9-18
• /
• 2018

Recently, the use of image stitching technology has been increasing as the number of contents based on virtual reality increases. Image Stitching is a method for matching multiple images to produce a high resolution image and a wide field of view image. The image stitching is used in various fields beyond the limitation of images generated from one camera. Image Stitching detects feature points and corresponding points to match multiple images, and calculates the homography among images using the RANSAC algorithm. Generally, corresponding points are needed for calculating conversion relation. However, the corresponding points include various types of noise that can be caused by false assumptions or errors about the conversion relationship. This noise is an obstacle to accurately predict the conversion relation. Therefore, RANSAC algorithm is used to construct an accurate conversion relationship from the outliers that interfere with the prediction of the model parameters because matching methods can usually occur incorrect correspondence points. In this paper, we propose an algorithm that extracts more accurate inliers and computes accurate transformation relations by using correspondence point relation information used in RANSAC algorithm. The correspondence point relation information uses distance ratio between corresponding points used in image matching. This paper aims to reduce the processing time while maintaining the same performance as RANSAC.