• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.2
• /
• pp.97-103
• /
• 2005

Most car navigation systems(CNS) estimate the vehicle's location using global positioning system(GPS) or dead reckoning(DR) system. However, the estimated location has undesirable errors because of various noise sources such as unpredictable GPS noises. As a result, the measured position is not lying on the road, although the vehicle is known to be restricted on the road network. The purpose of map matching is to locate the vehicle's position on the road network where the vehicle is most likely to be positioned. In this paper, we analyze some general map matching algorithms first. Then, we propose a map matching method using compensation vectors to improve the performance of map matching. The proposed method calculates a compensation vector from the discrepancy between a measured position and an estimated position. The compensation vector and a newly measured position are to be used to determine the next estimation. To show the performance improvement of the map matching using compensation vectors, the real time map matching experiments are performed. The real road experiments demonstrate the effectiveness and applicability of the proposed map matching.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.1
• /
• pp.51-59
• /
• 2013

This paper researches location estimating method in CDMA system. Previously proposed positioning algorithms are difficult to estimate accurate position in indoor environments, and possible to limited position. This paper proposes enhanced algorithm using received PN pilot signals from base stations to enhance previous algorithms. For estimating position, we set the threshold value and use over the threshold value in received signals. After selecting signals, we estimate position using TDOA algorithm. And the cases which TDOA algorithm cannot use to estimate position, we use Pattern Matching algorithm. The proposed method system showed the improved performance in estimating parameters and locating positions by computer simulations.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.12
• /
• pp.70-80
• /
• 1997

This paper proposes a hierarchical Hausdorff distance (HD) matching algorithm baased on coarse-to-fine approach. It reduces the computational complexity greatly by using the pyramidal structures consisting of distance transform (DT) and edge pyramids. Also, inthe proposed hierarchical HD matching, a thresholding method is presented to find an optimal matching position with small error, in which the threshold values are determined by using the property between adjacent level of a DT map pyramid. By computer simulation, the performance of the conventional and proposed hierarchical HD matching algorithms is compared in therms of the matching position for binary images containing uniform noise.

• Korean Journal of Geomatics
• /
• v.1 no.1
• /
• pp.43-49
• /
• 2001

Although many kinds of stereo matching method have been developed in the field of computer vision and photogrammetry, wrong matches are not easy to avoid. This paper presents a new method to reduce wrong matches after matching, and experimental results are reported. The main idea is to analyze the histogram of the image attribute differences between each pair of image patches matched. Typical image attributes of image patch are the mean and the standard deviation of gray value for each image patch, but there could be other kinds of image attributes. Another idea is to check relative position among potential matches. This paper proposes to use Gaussian blunder filter to detect the suspicious pair of candidate match in relative position among neighboring candidate matches. If the suspicious candidate matches in image attribute difference or relative position are suppressed, then many wrong matches are removed, but minimizing the suppression of good matches. The proposed method is easy to implement, and also has potential to be applied as post processing after image matching for many kinds of matching methods such as area based matching, feature matching, relaxation matching, dynamic programming, and multi-channel image matching. Results show that the proposed method produces fewer wrong matches than before.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.12
• /
• pp.76-84
• /
• 1999

This paper presents an integrated method for aircraft position estimation using sequential aerial images. The proposed integrated system for position estimation is composed of two parts: relative position estimation and absolute position estimation. Relative position estimation recursively computes the current position of an aircraft by accumulating relative displacement estimates extracted from two successive aerial images. Simple accumulation of parameter values decreases reliability of the extracted parameter estimates as an aircraft goes on navigating, resulting in large position error. Therefore absolute position estimation is required to compensate for the position error generated in relative position estimation. Absolute position estimation algorithms by image matching or digital elevation model (DEM) matching are presented. In image matching, a robust oriented Hausdorff measure (ROHM) is employed whereas in DEM matching an algorithm using multiple image pairs is used. Computer simulation with four real aerial image sequences shows the effectiveness of the proposed integrated position estimation algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.328-333
• /
• 1996

In this paper, we propose a new method to estimate robot position without landmark. At first, it is studied to estimate robot state using Markov decision rule. And, a matching method is discussed for estimating current position more accurately under the estimated current state. At second, we combine or fuse the matching method with the POMDP method in order to estimate the position under a dynamically changing environment. Finally we will show that our method can estimate the position precisely and robustly of which error are not cumulated through simulation results.

• Fire Science and Engineering
• /
• v.19 no.4 s.60
• /
• pp.64-68
• /
• 2005

In this paper, we studied fire position recognition and alarm system when we acquired CCDcamera image of fire region and position. We proposed effectively extraction system of boundary of fire region using RED Filtering, and applied 2-graylevel image method to fire boundary extraction. Finally we can make system of fire position and region using mask extraction and matching for fire recognition. For the purpose of experiment result, we effectively recognized that the tire occurrence position and region have steadily spread.

• The Journal of Korea Robotics Society
• /
• v.7 no.1
• /
• pp.45-56
• /
• 2012

This paper proposes how to improve the performance of CSS-based indoor localization system. CSS based localization utilizes signal flight time between anchors and tag to estimate distance. From the distances, the 3-dimensional position is calculated through trilateration. However the error in distance caused from multi-path effect transfers to the position error especially in indoor environment. This paper handles a problem of reducing error in raw distance information. And, we propose the new localization method by pattern matching instead of the conventional localization method based on trilateration that is affected heavily on multi-path error. The pattern matching method estimates the position by using the fact that the measured data of near positions possesses a high similarity. In order to gain better performance of localization, we use EKF(Extended Kalman Filter) to fuse the result of CSS based localization and robot model.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.11
• /
• pp.2711-2722
• /
• 1993

Most of the current 2-D object recognition systems are model-based. In such systems, the representation of each of a known set of objects are precompiled and stored in a database of models. Later, they are used to recognize the image of an object in each instance. In this thesis, the approach method for the 2-D object recognition is treating an object boundary as a string of structral units and utilizing string matching to analyze the scenes. To reduce string matching time, models are rebuilt by means of fuzzy c-means clustering algorithm. In this experiments, the image of objects were taken at initial position of a robot from the CCD camera, and the models are consturcted by the proposed algorithm. After that the image of an unknown object is taken by the camera at a random position, and then the unknown object is identified by a comparison between the unknown object and models. Finally, the amount of translation and rotation of object from the initial position is computed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.6
• /
• pp.1238-1244
• /
• 2011

This paper presents the matching method of reflectors for localization of laser navigation. The laser navigation is a device that measures distance and angle of reflector. The conventional major matching using the laser navigation is method that moves position of measured reflectors to position of installed reflectors and than rotate moved reflectors. However, it is difficult to use the industry because it has high computational complexity and high errors. To solve those problem, The proposed matching is method that create position of measured reflectors to assume that the position of installed reflectors is position of AGV and than rotate the position of installed reflectors. For experiment, we used AGV which was designed by ourselves, and compared positioning accuracy when AGV moves according to varying steering angle and driving speed.