• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.6 no.3
• /
• pp.77-86
• /
• 2007

Recently, systems based on speech recognition interface such as telematics terminals are being developed. However, many errors still exist in speech recognition and then studies about error correction are actively conducting. This paper proposes an error correction in post-processing of the speech recognition based on features of Korean phoneme. To support this algorithm, we used the phoneme similarity considering features of Korean phoneme. The phoneme similarity, which is utilized in this paper, rams data by mono-phoneme, and uses MFCC and LPC to extract feature in each Korean phoneme. In addition, the phoneme similarity uses a Bhattacharrya distance measure to get the similarity between one phoneme and the other. By using the phoneme similarity, the error of eo-jeol that may not be morphologically analyzed could be corrected. Also, the syllable recovery and morphological analysis are performed again. The results of the experiment show the improvement of 7.5% and 5.3% for each of MFCC and LPC.

• International Journal of Contents
• /
• v.6 no.3
• /
• pp.5-9
• /
• 2010

To manage large database system with video, effective video indexing and retrieval are required. A large number of video retrieval algorithms have been presented for frame-wise user query or video content query, whereas a few video identification algorithms have been proposed for video sequence query. In this paper, we propose an effective video identification algorithm for video sequence query that employs the Cauchy function of histograms between successive frames and the modified Hausdorff distance. To effectively match the video sequences with a low computational load, we make use of the key frames extracted by the cumulative Cauchy function and compare the set of key frames using the modified Hausdorff distance. Experimental results with several color video sequences show that the proposed algorithm for video identification yields remarkably higher performance than conventional algorithms such as Euclidean metric, and directed divergence methods.

• The Journal of the Acoustical Society of Korea
• /
• v.30 no.8
• /
• pp.428-435
• /
• 2011

Many isolated word recognition systems may generate irrelevant words for recognition results because they use only acoustic information or small amount of language information. In this paper, I propose word similarity that is used for selecting (or removing) less common words from candidates by applying Levenshtein distance. Word similarity is obtained by using positional accuracy that reflects the frequency information along to character's alignment information. This paper also discusses various improving techniques of selection of disparate words. The methods include different loss values, phone accuracy based on confusion information, weights of candidates by ranking order and partial comparisons. Through experiments, I found that the proposed methods are effective for removing heterogeneous words without loss of performance.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.5
• /
• pp.701-709
• /
• 2010

This paper presents an efficient signature recognition method by using the hybrid similarity criterion, which is in inverse proportion to distance and in proportion to correlation between the images. The distance is applied to express the spacial property of image, and the correlation is also applied to express the statistical property. The proposed criterion provides the robust recognition to both the geometrical variations such as position, size, and rotation and the shape variation. The normalized cross-correlation(NCC), which is calculated by considering 4 directions based on the histogram of binary image, is applied to express rapidly and accurately the similarity between the images. The proposed method has been applied to the problem for recognizing the 20 truck images of 288*288 pixels and the 105(3 persons * 35 images) signature images of 256*256 pixels, respectively. The experimental results show that the proposed method has a superior recognition performance that appears the image characters well. Especially, the hybrid criterion of NCC and ordinal distance has a superior recognition performance to the hybrid criterion using city-block or Euclidean distance.

• Journal of Information Processing Systems
• /
• v.15 no.6
• /
• pp.1503-1516
• /
• 2019

In this paper, to improve the accuracy of long sentence similarity calculation, we proposed a sentence similarity calculation method based on a system similarity function. The algorithm uses word2vector as the system elements to calculate the sentence similarity. The higher accuracy of our algorithm is derived from two characteristics: one is the negative effect of penalty item, and the other is that sentence similar function (SSF) based on word2vector similar elements doesn't satisfy the exchange rule. In later studies, we found the time complexity of our algorithm depends on the process of calculating similar elements, so we build an index of potentially similar elements when training the word vector process. Finally, the experimental results show that our algorithm has higher accuracy than the word mover's distance (WMD), and has the least query time of three calculation methods of SSF.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.10
• /
• pp.1746-1754
• /
• 2016

In this paper, we provide a development and evaluation method for an archery posture analyzing system, using an inertial sensor. The system was developed using LabVIEW2014 by National Instruments and evaluated using the DTW algorithm. To convert the voltage value of the inertial sensor into a physical value, a coordinate transformation matrix bias was applied. To evaluate the similarity of movement in archery shooting, the DTW distance was calculated and similarity was confirmed based on simple mechanical movement, the same person's shooting movement, shooting movement with another person, and the noise signal. The average similarity comparison results were as follows: simple mechanical movement was 17.05%, the same person's shooting movement was 26.48%, shooting movement with another person was 62.8%, and the noise signal was 328.5%; a smaller value indicates a higher level of similarity. We confirmed the possibility of analyzing the archery posture using 3-axis acceleration of the inertial sensor. We inferred that the proposed method might be important means for assessing shooting skills, evaluation of archer's progress, and finding talented archers in advance.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.1
• /
• pp.59-77
• /
• 2007

Advances in mobile techknowledges and supporting techniques require an effective representation and analysis of moving objects. Similarity search of moving object trajectories is an active research area in data mining. In this paper, we propose a trajectory search algorithm for spatio-temporal similarity of moving objects on road network. For this, we define spatio-temporal distance between two trajectories of moving objects on road networks, and propose a new method to measure spatio-temporal similarity based on the real road network distance. In addition, we propose a similar trajectory search algorithm that retrieves spatio-temporal similar trajectories in the road network. The algorithm uses a signature file in order to retrieve candidate trajectories efficiently. Finally, we provide performance analysis to show the efficiency of the proposed algorithm.

• Nuclear Engineering and Technology
• /
• v.53 no.6
• /
• pp.1947-1954
• /
• 2021

In the nuclear medicine imaging, quality control (QC) process using quadrant bar phantom is fundamental aspect of evaluating the spatial resolution. In addition, QC process of gamma camera is performed by daily or weekly. Recently, Monte Carlo simulation using the Geant4 application for tomographic emission (GATE) is widely applied in the pre-clinical nuclear medicine field for modeling gamma cameras with pixelated cadmium telluride (CdTe) semiconductor detector. In this study, we modeled a pixelated CdTe semiconductor detector and quadrant bar phantom (0.5, 1.0, 1.5, and 2.0 mm bar thicknesses) using the GATE tool. Similarity analysis based on correlation coefficients and peak signal-to-noise ratios was performed to compare image qualities for various source to collimator distances (0, 2, 4, 6, and 8 cm) and collimator lengths (0.2, 0.4, 0.6, 0.8, and 1.0 cm). To this end, we selected reference images based on collimator length and source to collimator distance settings. The results demonstrate that as the collimator length increases and the source to collimator distance decreases, the similarity to reference images improves. Therefore, our simulation results represent valuable information for the modeling of CdTe-based semiconductor gamma imaging systems and QC phantoms in the field of nuclear medicine.

• Journal of Korean Society for Geospatial Information Science
• /
• v.14 no.4 s.38
• /
• pp.71-77
• /
• 2006

Support Vector Machine (SVM) which has roots in a statistical learning theory is a training algorithm based on structural risk minimization. Generally, SVM algorithm uses the kernel for determining a linearly non-separable boundary and classifying the data. But, classical kernels can not apply to effectively the hyperspectral image classification because it measures similarity using vector's dot-product or euclidian distance. So, This paper proposes the spectral similarity kernel to solve this problem. The spectral similariy kernel that calculate both vector's euclidian and angle distance is a local kernel, it can effectively consider a reflectance property of hyperspectral image. For validating our algorithm, SVM which used polynomial kernel, RBF kernel and proposed kernel was applied to land cover classification in Hyperion image. It appears that SVM classifier using spectral similarity kernel has the most outstanding result in qualitative and spatial estimation.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2006.04a
• /
• pp.243-248
• /
• 2006

In this paper, we propose the unsupervised change detection algorithm that apply the similarity measure techniques to the hyperspectral image. The general similarity measures including euclidean distance and spectral angle were compared. The spectral similarity scale algorithm for reducing the problems of those techniques was studied and tested with Hyperion data. The thresholds for detecting the change area were estimated through EM(Expectation-Maximization) algorithm. The experimental result shows that the similarity measure techniques and EM algorithm can be applied effectively for the unsupervised change detection of the hyperspectral data.