• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.04a
• /
• pp.470-473
• /
• 2004

In this paper, the comparison of speech feature parameters for emotion recognition is studied for emotion recognition using speech signal. For this purpose, a corpus of emotional speech data recorded and classified according to the emotion using the subjective evaluation were used to make statical feature vectors such as average, standard deviation and maximum value of pitch and energy. MFCC parameters and their derivatives with or without cepstral mean subfraction are also used to evaluate the performance of the conventional pattern matching algorithms. Pitch and energy Parameters were used as a Prosodic information and MFCC Parameters were used as phonetic information. In this paper, In the Experiments, the vector quantization based emotion recognition system is used for speaker and context independent emotion recognition. Experimental results showed that vector quantization based emotion recognizer using MFCC parameters showed better performance than that using the Pitch and energy parameters. The vector quantization based emotion recognizer achieved recognition rates of 73.3％ for the speaker and context independent classification.

• Journal of Information Management
• /
• v.42 no.2
• /
• pp.193-210
• /
• 2011

The study was applied to context window sizes and weighting method to obtain the best performance of word sense disambiguation using support vector machine. The context window sizes were used to a 3-word, sentence, 50-bytes, and document window around the targeted word. The weighting methods were used to Binary, Term Frequency(TF), TF ${\times}$ Inverse Document Frequency(IDF), and Log TF ${\times}$ IDF. As a result, the performance of 50-bytes in the context window size was best. The Binary weighting method showed the best performance.

• 한국경영정보학회:학술대회논문집
• /
• 2007.11a
• /
• pp.591-596
• /
• 2007

본 연구에서는 상황 추론의 기능을 추천 시스템에 접목하였다. 연구의 대상 영역은 음악 추천 분야인데, 본 연구에서 제안하는 시스템은 세 개의 모듈, 즉 Intention Module, Mood Module 그리고 Recommendation Module로 구성되어 있다. Intention Module은 사용자가 음악을 청취할 의향이 있는지 없는지를 외부 환경의 상황 데이터를 이용하여 추론한다. Mood Module은 사용자의 상황에 적합한 음악의 장르를 추론한다. 마지막으로 Recommendation Module은 사용자에게 선정된 장르의 음악을 추천한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.464-471
• /
• 2010

The demand for high quality of multimedia applications, which far surpasses the rapid evolution of transmission and storage technologies, makes better compression coding capabilities ever increasingly more important. In order to provide enhanced video coding performance, this paper proposes an efficient competition-based motion vector coding scheme. The proposed algorithm adaptively forms the motion vector predictors based on the contexts of scene characteristics such as camera motion and nearby motion vectors, providing more efficient candidate predictors than the previous competition-based motion vector coding schemes which resort to the fixed candidates optimized by extensive simulations. Up to 200% of compression gain was observed in the experimental results for the proposed scheme applied to the motion vector selection for skip mode processing.

• Journal of Internet Computing and Services
• /
• v.15 no.6
• /
• pp.117-124
• /
• 2014

Cluttered background is a major obstacle in developing salient object detection and tracking system for mobile device captured natural scene video frames. In this paper we propose a context aware feature vector selection model to provide an efficient noise filtering by machine learning based classifiers. Since the context awareness for feature selection is achieved by searching nearest neighborhoods, known as NP hard problem, we apply a fast approximation method with complexity analysis in details. Separability enhancement in feature vector space by adding the context aware feature subsets is studied rigorously using principal component analysis (PCA). Overall performance enhancement is quantified by the statistical measures in terms of the various machine learning models including MLP, SVM, Naïve Bayesian, CART. Summary of computational costs and performance enhancement is also presented.

• The Journal of the Acoustical Society of Korea
• /
• v.33 no.4
• /
• pp.268-272
• /
• 2014

This paper presents a method for speech recognition using multi-section vector-quantization (MSVQ) and time-delay recurrent neural network (TDTNN). The MSVQ generates the codebook with normalized uniform sections of voice signal, and the TDRNN performs the speech recognition using the MSVQ codebook. The TDRNN is a time-delay recurrent neural network classifier with two different representations of dynamic context: the time-delayed input nodes represent local dynamic context, while the recursive nodes are able to represent long-term dynamic context of voice signal. The cepstral PLP coefficients were used as speech features. In the speech recognition experiments, the MSVQ/TDRNN speech recognizer shows 97.9 % word recognition rate for speaker independent recognition.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.5
• /
• pp.618-623
• /
• 2011

This paper proposes a novel method to discriminate meaningful tables from decorative one using a composite kernel for handling structural information of tables. In this paper, structural information of a table is extracted with two types of parse trees: context tree and table tree. A context tree contains structural information around a table, while a table tree presents structural information within a table. A composite kernel is proposed to efficiently handle these two types of trees based on a parse tree kernel. The support vector machines with the proposed kernel dised kuish meaningful tables from the decorative ones with rich structural information.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.5
• /
• pp.213-222
• /
• 2019

Determining the meaning of a keyword in a speech dialogue system is an important technology for the future implementation of an intelligent speech dialogue interface. After extracting keywords to grasp intention from user's utterance, the intention of utterance is determined by using the semantic mark of keyword. One keyword can have several semantic marks, and we regard the task of attaching the correct semantic mark to the user's intentions on these keyword as a problem of word sense disambiguation. In this study, about 23% of all keywords in the corpus is manually tagged to build a semantic mark dictionary, a synonym dictionary, and a context vector dictionary, and then the remaining 77% of all keywords is automatically tagged. The semantic mark of a keyword is determined by calculating the context vector similarity from the context vector dictionary. For an unregistered keyword, the semantic mark of the most similar keyword is attached using a synonym dictionary. We compare the performance of the system with manually constructed training set and semi-automatically expanded training set by selecting 3 high-frequency keywords and 3 low-frequency keywords in the corpus. In experiments, we obtained accuracy of 54.4% with manually constructed training set and 50.0% with semi-automatically expanded training set.

• Journal of the Chungcheong Mathematical Society
• /
• v.17 no.1
• /
• pp.47-56
• /
• 2004

The nonlinearity of a Boolean function f on $GF(2)^n$ is the minimum hamming distance between f and all affine functions on $GF(2)^n$ and it measures the ability of a cryptographic system using the functions to resist against being expressed as a set of linear equations. Finding out the exact value of the nonlinearity of given Boolean functions is not an easy problem therefore one wants to estimate the nonlinearity using extra information on given functions, or wants to find a lower bound or an upper bound on the nonlinearity. In this paper we extend the notion of auto-correlations of Boolean functions to vector Boolean functions and obtain upper bounds and a lower bound on the nonlinearity of vector Boolean functions in the context of their auto-correlations. Also we can describe avalanche characteristics of vector Boolean functions by examining the extended notion of auto-correlations.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.57-60
• /
• 2001

This paper reports on speaker-Recognition of context independence-speaker recognition in the field of the speech recognition. It is important to select the parameter reflecting the characteristic of each single person because speaker-recognition is to identify who speaks in the database. We used Mel Frequency Cesptrum Coefficient and Vector Quantization to identify in this paper. Specially, it considered to find characteristic-vector of the speaker in different from known method; this paper used the characteristic-vector which is selected in MFCC Parameter Space. Also, this paper compared the recognition rate according to size of codebook from this database and the time needed for operation with the existing one. The results is more improved $3\sim4\%$ for recognition rate than established Vector Quantization Algorithm.