• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.2
• /
• pp.68-78
• /
• 2000

This paper suggests a new map-matching algorithm for matching traveling trace of vehicle, which is measured by GPS receiver, to the road of a digital map This eventually brings the Improvement of positioning accuracy of the vehicle with GPS receiver After representing the travelling vehicle's motion by state equations using Singer's model, the proposed map-matching algorithm places the position of a vehicle right on the road and also improves the positioning accuracy of the vehicle using a Kalman filter In the crossroad, since it is difficult to determine precisely a current travelling road, we take linear regression to the estimated values from Kalman filtering This gives the direction angle of turning vehicle, then we can determine the correct route direction after comparing with each route-direction angle at the intersection.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.40-44
• /
• 2002

Precision correction is the process of geometrically aligning images to a reference coordinate system using GCPs(Ground Control Points). Many applications of remote sensing data, such as change detection, mapping and environmental monitoring, rely on the accuracy of precision correction. However it is a very time consuming and laborious process. It requires GCP collection, the identification of image points and their corresponding reference coordinates. At typical satellite ground stations, GCP collection requires most of man-powers in processing satellite images. A method of automatic registration of satellite images is demanding. In this paper, we propose a new algorithm for automatic precision correction by GCP chips and RANSAC(Random Sample Consensus). The algorithm is divided into two major steps. The first one is the automated generation of ground control points. An automated stereo matching based on normalized cross correlation will be used. We have improved the accuracy of stereo matching by determining the size and shape of match windows according to incidence angle and scene orientation from ancillary data. The second one is the robust estimation of mapping function from control points. We used the RANSAC algorithm for this step and effectively removed the outliers of matching results. We carried out experiments with SPOT images over three test sites which were taken at different time and look-angle with each other. Left image was used to select UP chipsets and right image to match against GCP chipsets and perform automatic registration. In result, we could show that our approach of automated matching and robust estimation worked well for automated registration.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.46-48
• /
• 2004

This paper presents a simple method of rotational and translational motion estimation for digital image stabilization. The scheme first computes the rotation center by taking least squares of selected local velocity vectors, and the rotational angle is found from special subset of motion vectors. And then translational motion can be estimated by the relation among movement of rotation center, rotation angle and translation movement. To show the effectiveness of our approach, the synthetic images are evaluated, resulting in better performance.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2012.10a
• /
• pp.565-566
• /
• 2012

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.129.1-129
• /
• 2001

In this paper, we present an approach for matching images from finding interesting points and applying new image interpolation algorithm. New algorithms are developed that automatically align the input images match them and reconstruct 3-D surfaces. The interpolation algorithm is designed to cope with simple shapes. The proposed image interpolation algorithm generate a rotation image about vertical axes by an any angle from 4 base images. Each base image that was obtained from CCD camera has an angle difference of 90$^{\circ}$ The proposed image interpolation algorithm use the geometric analysis of image and depth information.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.408-410
• /
• 2009

We present an efficient and robust measurement model for visual tracking. This approach builds on and extends work on subspace representations of measurement model. Subspace-based tracking algorithms have been introduced to visual tracking literature for a decade and show considerable tracking performance due to its robustness in matching. However the measures used in their measurement models are often restricted to few approaches. We propose a novel measure of object matching using Angle In Feature Space, which aims to improve the discriminability of matching in subspace. Therefore, our tracking algorithm can distinguish target from similar background clutters which often cause erroneous drift by conventional Distance From Feature Space measure. Experiments demonstrate the effectiveness of the proposed tracking algorithm under severe cluttered background.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.1
• /
• pp.54-59
• /
• 2004

We suggest a 3D vision inspection algorithm which is based on the external shape feature. Because many electronic parts have the regular shape, if we have the database of pattern and can recognize the object using the database of the object s pattern, we can inspect many types of electronic parts. Our proposed algorithm uses the geometrical pattern matching method and 3D database on the electronic parts. We applied our suggested algorithm fer inspecting several objects including typical IC and capacitor. Through the experiments, we could find that our suggested algorithm is more effective and more robust to the inspection environment(rotation angle, light source, etc.) than conventional 2D inspection methods. We also compared our suggested algorithm with the feature space trajectory method.

• The Korean Journal of Applied Statistics
• /
• v.25 no.6
• /
• pp.1027-1036
• /
• 2012

Among various biometrics recognition systems, statistical fingerprint recognition matching methods are considered using minutiae on fingerprints. We define similarity distance measures based on the coordinate and angle of the minutiae, and suggest a fingerprint recognition model following statistical distributions. We could obtain confidence intervals of similarity distance for the same and different persons, and optimal thresholds to minimize two kinds of error rates for distance distributions. It is found that the two confidence intervals of the same and different persons are not overlapped and that the optimal threshold locates between two confidence intervals. Hence an alternative statistical matching method can be suggested by using nonoverlapped confidence intervals and optimal thresholds obtained from the distributions of similarity distances.

• Journal of the Optical Society of Korea
• /
• v.12 no.3
• /
• pp.210-214
• /
• 2008

A critical angle method was used to measure the index of refraction of a solid medium when an air gap between the prism and the medium is present. The gap effect was analyzed both numerically and experimentally. Since the total internal reflection is severely disturbed by the large gap, determination of the critical angle and the resulting refractive index becomes ambiguous and inaccurate. By using an index matching fluid, we could determine the index of refraction with an uncertainty of ${\pm}2{\times}1^{-3}$ even when the gap is as large as 1 ${\mu}m$.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.4
• /
• pp.463-469
• /
• 2010

Since MOLA(Mars Orbiter Laser Altimeter) data, which provides altimetry data for Mars, does not cover the whole Mars area, image matching with MOC imagery should be implemented for the generation of DEM. However, automatic image matching is difficult because of insufficient features and low contrast. In this paper, we present the area based semi-automatic image matching algorithm with MOC-NA(Mars Orbiter Camera ? Narrow Angle) imagery. To accomplish this, seed points describing conjugate points are manually added for the stereo imagery, and interesting points are automatically produced by using such seed points. Produced interesting points being used as initial conjugate points, area based image matching is implemented. For the points which fail to match, the locations of initial conjugate points are recalculated by using matched six points and image matching process is re-implemented. The quality assessment by reversing the role of target and search image shows 97.5 % of points were laid within one pixel absolute difference.