• Journal of the Korean Society for information Management
• /
• v.26 no.2
• /
• pp.127-147
• /
• 2009

The synonym issue is an inherent barrier in human-computer communication, and it is more challenging in a Web 2.0 application, especially in social tagging applications. In an effort to resolve the issue, the goal of this study is to test the feasibility of a Web 2.0 application as a potential source for synonyms. This study investigates a way of identifying similar tags from a popular collaborative tagging application, Delicious. Specifically, we propose an algorithm (FolkSim) for measuring the similarity of social tags from Delicious. We compared FolkSim to a cosine-based similarity method and observed that the top-ranked tags on the similar list generated by FolkSim tend to be among the best possible similar tags in given choices. Also, the lists appear to be relatively better than the ones created by CosSim. We also observed that tag folksonomy and similar list resemble each other to a certain degree so that it possibly serves as an alternative outcome, especially in case the FolkSim-based list is unavailable or infeasible.

• Journal of Korea Multimedia Society
• /
• v.13 no.2
• /
• pp.185-195
• /
• 2010

In this paper, we propose an efficient inter and intra prediction algorithms for fast encoding of H.264/AVC. First, inter prediction mode decision method decides early using temporal/spatial correlation information and pixel direction information. Second, intra prediction mode decision method selects block size judging smoothness degree with inner/outer pixel value variation and decides prediction mode using representative pixel and reference pixel. Lastly, adaptive motion search region restriction sets search region using mode information of neighboring block and predicted motion vector. The experimental results show that proposed method can achieve about 18~53% reduction compared with the existing JM 14.1 in the encoding time. In RD performance, the proposed method does not cause significant PSNR value losses while increasing bitrates slightly.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.4
• /
• pp.707-714
• /
• 2016

Active driving safety systems for vehicle, such as the front collision avoidance, lane departure warning, and lane change assistance, have been popular to be adopted to the compact car. For improving performance and competitive cost, FMCW radar has been researched to adopt a phased array or a multi-beam antenna, and to integrate the front and the side radar. In this paper we propose several efficient methods to implement the signal processing module of FMCW radar system using low cost DSP. The pulse width modulation (PWM) based analog conversion, the approximation of time-eating functions, and the adoption of vector-based computation, etc, are proposed and implemented. The implemented signal processing board shows the real-time performance of 1.4ms pulse repetition interval (PRI) with 1024pt-FFT. In real road we verify the radar performance under real-time constraints of 10Hz update time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.471-476
• /
• 2016

This paper presents our study on speech recognition performance prediction. Our initial study shows that a combination of speech quality measures effectively improves correlation with Word Error Rate (WER) compared to each speech measure alone. In this paper we demonstrate a new combination of various types of speech quality measures shows more significantly improves correlation with WER compared to the speech measure combination of our initial study. In our study, SNR, PESQ, acoustic model score, and MFCC distance are used as the speech quality measures. This paper also presents our speech database verification system for speech recognition employing the speech measures. We develop a WER prediction system using Gaussian mixture model and the speech quality measures as a feature vector. The experimental results show the proposed system is highly effective at predicting WER in a low SNR condition of speech babble and car noise environments.

• Journal of the Korean Society for information Management
• /
• v.24 no.4
• /
• pp.267-283
• /
• 2007

In this study, measures of distributional similarity such as KL-divergence are applied to cluster documents instead of traditional cosine measure, which is the most prevalent vector similarity measure for document clustering. Three variations of KL-divergence are investigated; Jansen-Shannon divergence, symmetric skew divergence, and minimum skew divergence. In order to verify the contribution of distributional similarities to document clustering, two experiments are designed and carried out on three test collections. In the first experiment the clustering performances of the three divergence measures are compared to that of cosine measure. The result showed that minimum skew divergence outperformed the other divergence measures as well as cosine measure. In the second experiment second-order distributional similarities are calculated with Pearson correlation coefficient from the first-order similarity matrixes. From the result of the second experiment, secondorder distributional similarities were found to improve the overall performance of document clustering. These results suggest that minimum skew divergence must be selected as document vector similarity measure when considering both time and accuracy, and second-order similarity is a good choice for considering clustering accuracy only.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.3
• /
• pp.72-77
• /
• 2017

This paper focuses on the development of a supporting S/W tool for the automated design of an automotive press trim die. To define the die design process based on automation, we analyze the press die design process of the current industry and group repetitive works in the 3D modeling process. The proposed system consists of two modules, namely the template models of the trim steel parts and UI function for their auto-positioning. Four kinds of template models are developed to adapt to various situations and the rules of the interaction formula which are used for checking and correcting the directions of the datum point, datum curve, datum plane are implemented to eliminate errors. The system was developed using CATIA Knowledgeware, CAA(CATIA SDK) and Visual C++, in order for it to function as a plug-in module of CATIA V5, which is one of the major 3D CAD systems in the manufacturing industry. The developed system was tested by applying it to various panels of current automobiles and the results showed that it reduces the time-cost by 74% compared to the traditional method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.1
• /
• pp.1-7
• /
• 2005

Cluster analysis of microarray data has been often used to find biologically relevant Broups of genes based on their expression levels. Since many functionally related genes tend to be co-expressed, by identifying groups of genes with similar expression profiles, the functionalities of unknown genes can be inferred from those of known genes in the same group. In this Paper we address a novel clustering approach, called seed clustering, and investigate its applicability for microarray data analysis. In the seed clustering method, seed genes are first extracted by computational analysis of their expression profiles and then clusters are generated by taking the seed genes as prototype vectors for target clusters. Since it has strong mathematical foundations, the seed clustering method produces the stable and consistent results in a systematic way. Also, our empirical results indicate that the automatically extracted seed genes are well representative of potential clusters hidden in the data, and that its performance is favorable compared to current approaches.

• The Journal of the Acoustical Society of Korea
• /
• v.10 no.4
• /
• pp.38-47
• /
• 1991

The frequency variation among speakers is one of problems in the speech recognition. This paper applies fuzzy theory to solve the variation problem of frequency features. Reference patterns are expressed by fuzzified patterns which are produced by the peak frequency and the peak energy extracted from codebooks which are generated from training words uttered by several speakers, as they should include common features of speech signals. Words are recognized by fuzzy inference which uses the certainty factor between the reference patterns and the test fuzzified patterns which are produced by the peak frequency and the peak energy extracted from the power spectrum of input speech signals. Practically, in computing the certainty factor, to reduce memory capacity and computation requirements we propose a new equation which calculates the improved certainty factor using only the difference between two fuzzy values. As a result of experiments to test this word recognition method by fuzzy interence with Korean digits, it is shown that this word recognition method using the new equation presented in this paper, can solve the variation problem of frequency features and that the memory capacity and computation requirements are reduced.

• Journal of the Korea Convergence Society
• /
• v.10 no.12
• /
• pp.29-34
• /
• 2019

If it takes much time to calculate the fitness of the solution in genetic algorithms, it is essential to create a metamodel. Much research has been completed to improve the performance of metamodels. In this study, we tried to get a better performance of metamotel using discrete Walsh transform in discrete domain. We transforms the basis of the solution and creates a metamodel using the transformed solution. We experimented with NK-landscape, a representative function of the pseudo-boolean function, and provided empirical evidence on the performance of the proposed model. When we performed the genetic algorithm using the proposed model, we confirmed that the genetic algorithm found a better solution. In particular, our metamodel showed better performance than that using the radial basis function network that modified the similarity function for the discrete domain.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.1 s.307
• /
• pp.75-84
• /
• 2006

With considering center-biased characteristic, NTSS(New Three-Step Search Algorithm) can improve the performance of TSS(Three-Step Search Algorithm) which is one of the most popular fast block matching algorithms(BMA) to search a motion vector in a video sequence. Although NTSS has generally better Quality than TSS for a small motion sequence, it is hard to say that NTSS can provide better quality than TSS for a large motion sequence. It even deteriorates the quality to increase a search window size using NTSS. In order to address this drawback, this paper aims to develop a new adaptive window size-based three step search scheme, called AWTSS, which can improve quality at various window sizes in both the small and the large motion video sequences. In this scheme, the search window size is dynamically changed to improve coding efficiency according to the characteristic of motion vectors. AWTSS can improve the video quality more than 0.5dB in case of large motion with keeping the same quality in case of small motion.