• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.5
• /
• pp.603-608
• /
• 2009

In this paper, a similarity measure between interval-valued vague sets is proposed. In the interval-valued vague sets representation, the upper bound and the lower bound of a vague set are represented as intervals of interval-valued fuzzy set respectively. Proposed method combines the concept of geometric distance and the center-of-gravity point of interval-valued vague set to evaluate the degree of similarity between interval-valued vague sets. We also prove three properties of the proposed similarity measure. It provides a useful way to measure the degree of similarity between interval-valued vague sets.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.1-11
• /
• 2009

Recently there has arisen concern in both the database community and the graphics society about data retrieval from large motion databases because the high dimensionality of motion data implies high costs. In this circumstance, finding an effective distance measure and an efficient query processing method for such data is a challenging problem. This paper presents an elaborate motion query processing system, SMoFinder (Similar Motion Finder), which incorporates a novel kinematic distance measure and an efficient indexing strategy via adaptive frame segmentation. To this end, we regard human motions as multi-linkage kinematics and propose the weighted Minkowski distance metric. For efficient indexing, we devise a new adaptive segmentation method that chooses representative frames among similar frames and stores chosen frames instead of all frames. For efficient search, we propose a new search method that processes k-nearest neighbors queries over only representative frames. Our experimental results show that the size of motion databases is reduced greatly (${\times}1/25$) but the search capability of SMoFinder is equal to or superior to that of other systems.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.272-280
• /
• 2002

In this paper, we present a method to extract a moving object and to measure the distance to it by using the stereo vision system. The moving factor is to be extracted through a match of a pixel unit for the moving object where the adaptive threshold is effectively dealt with to remove changes in the brightness of the image. The distance to moving object is measured by using a stereo vision system which employs a parallel camera. The experimental results show that the proposed algorithm could be effectively applied to distance measurement to moving object because it has an average error of one percent.

• Phonetics and Speech Sciences
• /
• v.1 no.3
• /
• pp.109-115
• /
• 2009

Many isolated word recognition systems may generate non-similar words for recognition candidates because they use only acoustic information. In this paper, we investigate several techniques which can exclude non-similar words from N-best candidate words by applying Levenstein distance measure. At first, word distance method based on phone and syllable distances are considered. These methods use just Levenstein distance on phones or double Levenstein distance algorithm on syllables of candidates. Next, word similarity approaches are presented that they use characters' position information of word candidates. Each character's position is labeled to inserted, deleted, and correct position after alignment between source and target string. The word similarities are obtained from characters' positional probabilities which mean the frequency ratio of the same characters' observations on the position. From experimental results, we can find that the proposed methods are effective for removing non-similar words without loss of system performance from the N-best recognition candidates of the systems.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.4
• /
• pp.474-477
• /
• 1999

In this paper, a new method of measuring of distance between digital images, the 2D Integra-Normalizer, is proposed and compared with the grey block distance (GBD) to show its superiority of images. The 2D Integra-Normalizer removes a restriction that the image to be compared is {{{{ { 2}^{n } }}}} dimension where n is a positive integer, which means that any dimensional image can be applied to the 2D Integra-Normalizer for measuring distance of images. In addition, the 2D Integra-Normalizer measures the distance of images more in detail than the GBD with a better interpretation that is more close to human's intuitive understanding.

• Journal of the Korean Geosynthetics Society
• /
• v.13 no.1
• /
• pp.23-31
• /
• 2014

In this study, the method to measure effectively the ground surface displacement of slope was proposed using the Laser Distance Measurer (LDM). Applying the proposed technique is more simple and easier than the complicated and high-priced instrument to measure the ground surface displacement. LDM is an instrument that the red laser aimed at the target and then the reflected laser used for calculating the distance. The advantages of LDM are easy operating method, high measurement precision and lower in price. To check the feasibility, the proposed method applied to the real site that the ground surface displacement of slope was occurred continuously. The ground surface displacements were occurred in various points of the natural and cut slopes located at the lower part of coal mine waste heap due to the load of waste heap. To measure directly the ground surface displacement in this site, 6 measurement sections and 26 measurement points were selected. As the result of the displacement measured by the proposed technique within a certain period time, the accumulative ground surface displacement could be measured as well as the velocity of displacement could be estimated. Also, the progress direction of ground surface displacement can be confirmed and predicted through the analysis of all measured result.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.9
• /
• pp.363-372
• /
• 2019

A sequence refers to data in which the order exists on the two items, and purchase transaction data in which the products purchased by one customer are listed is one of the representative sequence data. In general, all goods have a product taxonomy, such as category/ sub-category/ sub-sub category, and if they are similar to each other, they are classified into the same category according to their characteristics. Therefore, in this paper, we not only consider the purchase order of products to compare two purchase transaction sequences, but also calculate their similarity by giving a higher score if they are in the same category in spite of their difference. Especially, in order to choose the best similarity measure that directly affects the calculation performance of the purchase transaction sequences, we have compared the performance of three representative similarity measures, the Levenshtein distance, dynamic time warping distance, and the Needleman-Wunsch similarity. We have extended the existing methods to take into account the product taxonomy. For conventional similarity measures, the comparison of goods in two sequences is calculated by simply assigning a value of 0 or 1 according to whether or not the product is matched. However, the proposed method is subdivided to have a value between 0 and 1 using the product taxonomy tree to give a different degree of relevance between the two products, even if they are different products. Through experiments, we have confirmed that the proposed method was measured the similarity more accurately than the previous method. Furthermore, we have confirmed that dynamic time warping distance was the most suitable measure because it considered the degree of association of the product in the sequence and showed good performance for two sequences with different lengths.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.2
• /
• pp.40-45
• /
• 2000

In speech corpus generation and speech recognition, it is sometimes needed to segment the input speech data without any prior knowledge. A method to accomplish this kind of segmentation, often called as blind segmentation, or acoustic segmentation, is to find boundaries which minimize the Euclidean distances among the feature vectors of each segments. However, the use of this metric alone is prone to errors because of the fluctuations or variations of the feature vectors within a segment. In this paper, we introduce the principal component analysis method to take the trend of feature vectors into consideration, so that the proposed distance measure be the distance between feature vectors and their projected points on the principal components. The proposed distance measure is applied in the LBDP(level building dynamic programming) algorithm for an experimentation of continuous speech segmentation. The result was rather promising, resulting in 3-6% reduction in deletion rate compared to the pure Euclidean measure.

• Journal of Digital Contents Society
• /
• v.10 no.3
• /
• pp.423-431
• /
• 2009

There are various image retrieval methods using shape, color and texture features. One of the most active area is using shape and color information. A number of shape representations have been suggested to recognize shapes even under affine transformation. There are many kinds of method for shape recognition, the well-known method is Fourier descriptors and moment invariant. The other method is CSS(Curvature Scale Space). The maxima of curvature scale space image have already been used to represent 2-D shapes in different applications. Because preexistence CSS exists several problems, in this paper we use improved CSS method for retrieval image. There are two kinds of method, One is using RGB color information feature and the other is using HSI color information feature. In this paper we used HSI color model to represent color histogram before, then use it as comparison measure. The similarity is measured by using Euclidean distance and for reduce search time and accuracy, We use DTW for measure similarity. Compare with the result of using Euclidean distance, we can find efficiency elevated.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.6
• /
• pp.527-532
• /
• 2013

Depth estimation is an essential factor for robot vision, 3D scene modeling, and motion control. The depth estimation method is based on focusing values calculated in a series of images by a single camera at different distance between lens and object. In this paper, we proposed a relative depth estimation method using focus measure. The proposed method is implemented by focus value calculated for each image obtained at different lens position and then depth is finally estimated by considering relative distance of two patterns. We performed various experiments on the effective focus measures for depth estimation by using various patterns and their usefulness.