• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11c
• /
• pp.1827-1830
• /
• 2002

단백질 모티프(motif)란 유사한 기능을 가진 여러 단백질 서열에서 공통적으로 발견되는 패턴으로서 단백질의 기능을 예측하는 단서로 활용된다. 현재 Prosite, Pfam 등의 데이터베이스에서 정규식(regular expression), 가중치 행렬(weighted matrix), 은닉 마코프 모델(hidden Markov model)의 형태로 4천여종 이상의 모티프가 등록되어 있다. 본 논문에서는 연관성 탐사 기법을 적용하여 Hits 데이터로부터 상당히 높은 연관성을 갖는 모티프 집단을 밝히고, 실제 자연현상에서 자주 나타나는 연관성을 교차타당성 (cross-validation) 기법을 통해 입증하였다. 이렇게 밝혀진 단백질 모티프간 연관성을 트라이 탐색 기법을 통해 웹으로 제공함으로써 단백질의 기능유추에 쉽게 접근하고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04a
• /
• pp.47-50
• /
• 2002

단백질 모티프(motif)란 유사한 기능을 가진 여러 단백질 서열에서 공통적으로 발견되는 패턴으로서 단백질의 기능을 예측하는 단서로 활용된다. 현재 Prosite, Pfam 등의 데이터베이스에서 정규식(regular expression), 가중치 행렬(weighted matrix). 은닉 마코프 모델(hidden Markov model)의 형태로 4천여종 이상의 모티프가 등록되어 있다. 하지만, 이러한 데이터베이스는 모티프와 단백질간의 일대일 관계만을 저장하고 있기 때문에, 모티프 간의 연관성을 파악하기는 어렵다. 본 논문에서는 모티프 간의 연관 관계를 연관 규칙의 형태로 발견하는 데이터 마이닝 기법을 제시한다. 아울러 HITS 데이터베이스로부터 입수한 단백질-모티프 데이터베이스에 본 기법을 적용함으로써 상당히 높은 연관성을 갖는 모티프 집단이 실제로 존재한다는 것을 밝힌다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.800-803
• /
• 2006

In this paper, we propose a method for improving the performance of the face recognition using a hybrid neural network. The propose method focused on improving face recognition technique using SOM and LVQ. In order to verify the effectiveness of the proposed method, we performed simulations on face database supplied ORL. The results show that the proposed method considerably improves on the performance of the eigenface, hidden markov model, multilayer neural network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.10
• /
• pp.2137-2142
• /
• 2012

Many studies in detection and classification of the targets in the underwater environments have been conducted for military purposes, as well as for non-military purpose. Due to the complicated characteristics of underwater acoustic signal reflecting multipath environments and spatio-temporal varying characteristics, active sonar target classification technique has been considered as a difficult technique. And it has a difficult in collecting actual underwater data. In this paper, we implemented the simulator to synthesize the active target signal, to extract feature and to classify the target in the underwater environment. In target signal synthesis, highlight and three-dimensional model are used and multi-aspect based hidden markov model is used for target classification.

• Journal of Korea Water Resources Association
• /
• v.52 no.8
• /
• pp.545-554
• /
• 2019

The most drought assessments are based on a drought index, which depends on univariate variables such as precipitation and soil moisture. However, there is a limitation in representing the drought conditions with single variables due to their complexity. It has been acknowledged that a multivariate drought index can more effectively describe the complex drought state. In this context, this study propose a Copula-based drought index that can jointly consider precipitation and soil moisture. Unlike precipitation data, long-term soil moisture data is not readily available so that this study utilized a Gaussian Mixture Non-Homogeneous Hidden Markov chain Model (GM-NHMM) model to simulate the soil moisture using the observed precipitation and temperature ranging from 1973 to 2014. The GM-NHMM model showed a better performance in terms of reproducing key statistics of soil moisture, compared to a multiple regression model. Finally, a bivariate frequency analysis was performed for the drought duration and severity, and it was confirmed that the recent droughts over Jeollabuk-do in 2015 have a 20-year return period.

• The Journal of the Acoustical Society of Korea
• /
• v.39 no.1
• /
• pp.64-68
• /
• 2020

In a conventional speech recognition system using Gaussian Mixture Model-Hidden Markov Model (GMM-HMM), the cepstral feature normalization method based on pole filtering was effective in improving the performance of recognition of short utterances in noisy environments. In this paper, the usefulness of this method for the state-of-the-art speech recognition system using Deep Neural Network (DNN) is examined. Experimental results on AURORA 2 DB show that the cepstral mean and variance normalization based on pole filtering improves the recognition performance of very short utterances compared to that without pole filtering, especially when there is a large mismatch between the training and test conditions.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.1
• /
• pp.42-47
• /
• 2003

This paper proposes the method to generate new test data using the sample shift of the start frame for SPRT(sequential probability ratio test) in speaker verification. The SPRT method is a effective algorithm that can reduce the test computational complexity. However, in making the decision procedure, SPRT can be executed on the assumption that the input samples are usually to be i.i.d. (Independent and Identically Distributed) samples from a probability density function (pdf), also it's not suitable method to apply for the short utterance. The proposed method can achieve SPRT regardless of the utterance length of the test data because it is method to generate the new test data through the sample shift of start frame. Also, the correlation property of data to be considered in the SPRT method can be effectively removed by employing the principal component analysis. Experimental results show that the proposed method increased the computational complexity of data for sample shift a little, but it has a good performance result more than a conventional method above the average 0.7% in EER (equal error rate).

• Journal of the Institute of Convergence Signal Processing
• /
• v.10 no.3
• /
• pp.170-175
• /
• 2009

In this paper, we propose real time automatic speaker verification (ASV) system to protect personal information on personal digital assistant (PDA) device. Recently, the capacity of PDA has extended and been popular, especially for mobile environment such as mobile commerce (M-commerce). However, there still exist lots of difficulties for practical application of ASV utility to PDA device because it requires too much computational complexity. To solve this problem, we apply the method to relieve the computational burden by performing the preprocessing such as spectral subtraction and speech detection during the speech utterance. Also by applying the hidden Markov model (HMM) optimal state alignment and the sequential probability ratio test (SPRT), we can get much faster processing results. The whole system implementation is simple and compact enough to fit well with PDA device's limited memory and low CPU speed.

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

Vision-based Human computer interaction is an emerging field of science and industry to provide natural way to communicate with human and computer. In that sense, inferring the emotional state of the person based on the facial expression recognition is an important issue. In this paper, we present a novel approach to recognize facial expression from a sequence of input images using emotional specific HMM (Hidden Markov Model) and facial motion tracking based on optical flow. Conventionally, in the HMM which consists of basic emotional states, it is considered natural that transitions between emotions are imposed to pass through neutral state. However, in this work we propose an enhanced transition framework model which consists of transitions between each emotional state without passing through neutral state in addition to a traditional transition model. For the localization of facial features from video sequence we exploit template matching and optical flow. The facial feature displacements traced by the optical flow are used for input parameters to HMM for facial expression recognition. From the experiment, we can prove that the proposed framework can effectively recognize the facial expression in real time.

• Journal of Broadcast Engineering
• /
• v.19 no.5
• /
• pp.656-664
• /
• 2014

In the case of a haze image, transferring the information of the original image is difficult as the contrast leans toward bright regions. Thus, dehazing algorithms have become an important area of study. Normally, since it is hard to obtain a haze-free image, the output image is qualitatively analyzed to test the performance of an algorithm. However, this paper proposes a quantitative error comparison based on reproducing the haze image using a disparity map. In addition, a Hidden Random Markov Model and EM algorithm are used to remove any block artifacts. The performance of the proposed algorithm is confirmed using a variety of synthetic and natural images.