• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.392-397
• /
• 2006

In this paper, we have proposed a revised GBD algorithm to make a relative identification more easily between 2-Dimensional images being compared with the well-known GBD(Grey Block Distance) algorithm. The method proposed here can measure the information about both the whole images and partial image. Also it can improve the performance of the existing GBD algorithm to do not loose the information of the partial image which has been changed rapidly in the 2-D image application. From the results of the experimental simulation we can say that the proposed method can be identified 2-D images more easily than that of the existing GBD algorithm.

• Journal of Korea Multimedia Society
• /
• v.16 no.10
• /
• pp.1156-1162
• /
• 2013

Face verification has been widely studied during the past two decades. One of the challenges is the rising concern about the security and privacy of the template database. In this paper, we propose a secure face verification system which generates a unique secure cryptographic key from a face template. The face images are processed to produce face templates or codes to be utilized for the encryption and decryption tasks. The result identity data is encrypted using Advanced Encryption Standard (AES). Distance metric naming hamming distance and Euclidean distance are used for template matching identification process, where template matching is a process used in pattern recognition. The proposed system is tested on the ORL, YALEs, and PKNU face databases, which contain 360, 135, and 54 training images respectively. We employ Principle Component Analysis (PCA) to determine the most discriminating features among face images. The experimental results showed that the proposed distance measure was one the promising best measures with respect to different characteristics of the biometric systems. Using the proposed method we needed to extract fewer images in order to achieve 100% cumulative recognition than using any other tested distance measure.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.3
• /
• pp.615-625
• /
• 2012

To measure the athletic information of exercisers, the applications of smartphone are programmed based on the sensing data from GPS device. These applications provide exercisers for running or walking distance, exercising time, calorie consumption, average speed, and so on. Among them, the exercising distance should measure accurately because it directly affects the other athletic information for exercisers. However, the existing methods for measuring the exercising distance makes errors because they are worked on the simple sphere or ellipse earth models. Actually, the surface of real earth is composed of inclined ground like hills and valleys. In this paper, a new exercising distance measuring algorithm is proposed to compensate the errors of existing method. It considers the altitude of slopes in exercising routes. To evaluate exercising distance measuring algorithms, we implement the athletic life-guide system based on the smartphone platform. In experiments, the proposed method shows that it provides more accurate distance measurement.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.1
• /
• pp.57-62
• /
• 2004

We have proposed an efficient method of word separation in a handwritten legal amount on bank check based on the spatial gaps between the connected components. The previous gap measures all suffer from the inherent problem of underestimation or overestimation that causes a deterioration in separation performance. In order to alleviate such burden, we have developed a modified version of each distance measure. Also, 4 class clustering based method of integrating three different types of distance measures has been proposed to compensate effectively the errors in each measure, whereby further improvement in performance of word separation is expected. Through a series of word separation experiments, we found that the modified distance measures show a better performance with over 2 - 3% of the word separation rate than their corresponding original distance measures. In addition, the proposed combining method based on 4-class clustering achieved further improvement by effectively reducing the errors common to two of three distance measures as well as the individual errors.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1996.11a
• /
• pp.415-420
• /
• 1996

The main objective of the present study is to propose a new measure of uncertainty importance based on distributional sensitivity analysis. The new measure is developed to utilize a metric distance obtained from cumulative distribution functions (cdfs). The measure is evaluated for two cases: one is a cdf given by a known analytical distribution and the other given by an empirical distribution generated by a crude Monte Carlo simulation. To study its applicability, the present measure has been applied to two different cases. The results are compared with those of existing three methods. The present approach is a useful measure of uncertainty importance which is based on cdfs. This method is simple and easy to calculate uncertainty importance without any complex process. On the basis of the results obtained in the present work, the present method is recommended to be used as a tool for the analysis of uncertainty importance.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.1
• /
• pp.129-137
• /
• 2000

In this paper, a new method of noncontact measurement has been developed for a 3 dimensional topography in semiconductor wafer, implementing a new optical probe based on the precision defocus measurement. The developed technique consists of the new optical probe, precision stages, and the measurement/control system. The basic principle of the technique is to use the reflected slit beam from the specimen surface, and to measure the deviation of the specimen surface. The defocusing distance can be measured by the reflected slit beam, where the defocused image is measured by the proposed optical probe, giving very high resolution. The distance measuring formula has been proposed for the developed probe, using the laws of geometric optics. The precision calibration technique has been applied, giving about 10 nanometer resolution and 72 nanometer of four sigma uncertainty. In order to quantitize the micro pattern in the specimen surface, some efficient analysis algorithms have been developed to analyse the 3D topography pattern and some parameters of the surface. The developed system has been successfully applied to measure the wafer surface, demonstrating the line scanning feature and excellent 3 dimensional measurement capability.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.9
• /
• pp.916-921
• /
• 2011

Mobile robot localization is the task of estimating the robot pose in a given environment. This research deals with outdoor localization based on an elevation map. Since outdoor environments are large and contain many complex objects, it is difficult to robustly estimate the robot pose. This paper proposes a Hausdorff distance-based map matching method. The Hausdorff distance is exploited to measure the similarity between extracted features obtained from the robot and elevation map. The experiments and simulations show that the proposed Hausdorff distance-based map matching is useful for robust outdoor localization using an elevation map. Also, it can be easily applied to other probabilistic approaches such as a Markov localization method.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.12
• /
• pp.57-64
• /
• 2018

In this paper, a method to measure similarity between two graphs is proposed, which is based on centralities of the graphs. The similarity between two graphs $G_1$ and $G_2$ is defined by the difference of distance($G_1$, $G_{R_1}$) and distance($G_2$, $G_{R_2}$), where $G_{R_1}$ and $G_{R_2}$ are set of random graphs that have the same number of nodes and edges as $G_1$ and $G_2$, respectively. Each distance ($G_*$, $G_{R_*}$) is obtained by comparing centralities of $G_*$ and $G_{R_*}$. Through the computational experiments, we show that it is possible to compare graphs regardless of the number of vertices or edges of the graphs. Also, it is possible to identify and classify the properties of the graphs by measuring and comparing similarities between two graphs.

• KIISE Transactions on Computing Practices
• /
• v.22 no.4
• /
• pp.189-194
• /
• 2016

A trajectory is the motion path of a moving object. The advances in IT have made it possible to collect an immeasurable amount of various type of trajectory data from a moving object using location detection devices like GPS. The trajectories of moving objects are widely used in many different fields of research, including the geographic information system (GIS) field. In the GIS field, several attempts have been made to automatically generate digital maps of roads by using the vehicle trajectory data. To achieve this goal, the method to cluster the trajectories on the same road is needed. Usually, the $Fr{\acute{e}}chet$ distance measure is used to calculate the distance between a pair of trajectories. However, the $Fr{\acute{e}}chet$ distance measure requires prolonged calculation time for a large amount of trajectories. In this paper, we presented a fast heuristic algorithm to distinguish whether the trajectories are in close distance or not using the discrete $Fr{\acute{e}}chet$ distance measure. This algorithm trades the accuracy of the resulting distance with decreased calculation time. By experiments, we showed that the algorithm could distinguish between the trajectory within 10 meters and the distant trajectory with 95% accuracy and, at worst, 65% of calculation reduction, as compared with the discrete $Fr{\acute{e}}chet$ distance.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.119-122
• /
• 2000

In this paper, we implement an elementary system to correct accent, pronunciation, and intonation in English spoken by non-native English speakers. In case of the accent evaluation, energy and pitch information are used to find stressed syllables, and then we extract the segment information of input patterns using a dynamic time warping method to discriminate and evaluate accent position. For the pronunciation evaluation. we utilize the segment information using the same algorithm as in accent evaluation and calculate the spectral distance measure for each phoneme between input and reference. For the intonation evaluation. we propose nine pattern of slope to estimate pitch contour, then we grade test sentences by accumulated error obtained by the distance measure and estimated slope. Our result shows that 98 percent of accent and 71 percent of pronunciation evaluation agree with perceptual measure. As the result of the intonation evaluation. system represent the similar order of grade for the four sentences having different intonation patterns compared with perceptual evaluation.