• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.5
• /
• pp.1861-1870
• /
• 2013

A climate change-driven increased hydrological variability has been widely acknowledged over the past decades. In this regards, rainfall simulation techniques are being applied in many countries to consider the increased variability. This study proposed a Homogeneous Hidden Markov Chain(HMM) designed to recognize rather complex patterns of rainfall with discrete hidden states and underlying distribution characteristics via mixture probability density function. The proposed approach was applied to Seoul and Jeonju station to verify model's performance. Statistical moments(e.g. mean, variance, skewness and kurtosis) derived by daily and seasonal rainfall were compared with observation. It was found that the proposed HMM showed better performance in terms of reproducing underlying distribution characteristics. Especially, the HMM was much better than the existing Markov Chain model in reproducing extremes. In this regard, the proposed HMM could be used to evaluate a long-term runoff and design flood as inputs.

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.29-32
• /
• 2000

HMM(Hidden Markov Model)은 시간적인 정보를 토대로 하는 수학적인 방법으로서 문자인식에 많이 사용되어지고 있다. 그런데 HMM이 적용되고자 하는 문제에서 사용되어지는 상태 수와 HMM에서 사용되어지는 parameter들은 처음에 결정되는 값들에 의해서 상당히 많은 영향을 받게 된다. 따라서 한글의 특성을 이용한 HMM의 상태 수를 결정한 후 결정되어진 각각의 HMM parameter들을 Genetic Algorithm을 이용하였다. Genetic Algorithm은 매개변수 최적화 문제에 대하여 자연의 진화 원리를 마땅한 알고리즘으로 선택, 교배, 돌연변이 연산을 이용하여 최적의 개체를 구하게 된다. 여기서는 HMM에서의 Viterbi Algorithm을 적합도 검사에 사용하였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.243-250
• /
• 2008

This paper proposes a system which extracts necessary information from call-for-paper (CFP) documents using a hidden Markov model (HMM). Even though a CFP does not follow a strict form, there is, in general, a relatively-fixed sequence of information within most CFPs. Therefore, a hiden Markov model is adopted to analyze CFPs which has an advantage of processing consecutive data. However, when CFPs are intuitively modeled with a hidden Markov model, a problem arises that the boundaries of the information are not recognized accurately. In order to solve this problem, this paper proposes a two-phrase hidden Markov model. In the first step, the P-HMM (Phrase hidden Markov model) which models a document with phrases recognizes CFP documents locally. Then, the D-HMM (Document hidden Markov model) grasps the overall structure and information flow of the document. The experiments over 400 CFP documents grathered on Web result in 0.49 of F-score. This performance implies 0.15 of F-measure improvement over the HMM which is intuitively modeled.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.13 no.1
• /
• pp.48-55
• /
• 2003

Hidden Markov Model(HMM) has a doubly embedded stochastic process with an underlying stochastic process that can be observed through another set of stochastic processes. This structure of HMM is useful for modeling vector sequence that doesn't look like a stochastic process but has a hidden stochastic process. So, HMM approach has become popular in various areas in last decade. The increasing popularity of HMM is based on two facts : rich mathematical structure and proven accuracy on critical application. In this paper, we applied continuous HMM (CHMM) approach with AR coefficient to detect and predict the chatter of lathe bite and to diagnose the wear of oil Journal bearing using rotor shaft displacement. Our examples show that CHMM approach is very efficient method for machine health monitoring and prediction.

• Journal of Digital Contents Society
• /
• v.10 no.2
• /
• pp.291-298
• /
• 2009

In this paper we proposed a vision based realtime hand gesture recognition method. To extract skin color, we translate RGB color space into YCbCr color space and use CbCr color for the final extraction. To find the center of extracted hand region we apply practical center point extraction algorithm. We use Kalman filter to tracking hand region and use HMM(Hidden Markov Model) algorithm (learning 6 type of hand gesture image) to recognize it. We demonstrated the effectiveness of our algorithm by some experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.11
• /
• pp.1199-1205
• /
• 1992

In this paper, a Korean word recognition method which usese Neural Network and Hidden Markov Models(HMM) is proposed to improve a recognition rate with a small amount of learning data. The method reduces the fluctuation due to personal differences which is a problem to a HMM recognition system. In this method, effective recognizer is designed by the complement of each recognition result of the Hidden Markov Models(HMM) and Neural Network. In order to evaluate this model, word recognition experiment is carried out for 28 cities which is DDD area names uttered by two male and a female in twenties. As a result of testing HMM with 8 state, codeword is 64, the recognition rate 91[%], as a result of testing Neural network(NN) with 64 codeword the recognition rate is 89[%]. Finally, as a result of testing NN-HMM with 64 codeword which the best condition in former tests, the recognition rate is 95[%].

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09b
• /
• pp.162-165
• /
• 2003

본 논문에서는 웨이블렛 계수와 Hidden Markov Model(HMM)이용한 얼굴인식 알고리즘을 제안한다. 입력 영상은 이산웨이블렛을 기반으로 한 다해상도 분석기법을 사용하여 데이터 수를 압축한 후, 각각의 해상도에서 얻어진 웨이블렛 계수를 특징벡터로 사용하여 HMM의 모델을 생성한다. 인식단계 에서는 웨이블렛 변환에 의해 생성된 개별대역의 인식값을 더하여 상호 보완함으로써 인식률을 높일 수 있었다. 제안된 알고리즘의 타당성을 검증하기 위하여 기본적 알고리즘인 벡터 양자화(VQ) 기법을 적용한 경우와 기존 얼굴인식에 제안된 DCT-HMM을 이용한 기법과의 인식률 비교를 한 결과, 제안된 방법이 우수한 성능을 보임을 알 수 있었다.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.772-779
• /
• 2006

The new model proposed in this paper is the hidden Markov mesh model or the 2D HMM with the causality of top-down and left-right direction. With the addition of the causality constraint, two algorithms for the evaluation of a model and the maximum likelihood estimation of model parameters have been developed theoretically which are based on the forward-backward algorithm. It is a more natural extension of the 1D HMM than other 2D models. The proposed method will provide a useful way of modeling highly variable image patterns such as offline cursive characters.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.1
• /
• pp.3-8
• /
• 2011

The work presented in this paper describes a Hidden Markov Model(HMM)-based framework for face recognition and face detection. The observation vectors used to characterize the statics of the HMM are obtained using the coefficients of the Karhuman-Loves Transform(KLT). The face recognition method presented in this paper reduces significantly the computational complexity of previous HMM-based face recognition systems, while slightly improving the recognition rate. In addition, the suggested method is more effective than the exiting ones in face extraction in terms of accuracy and others even under complex changes to the surroundings such as lighting.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.673-678
• /
• 2003

In this paper, we proposes a method for face recognition using HMM(hidden Markov model) and wavelet coefficients First, input images are compressed by using the multi-resolution analysis based on the discrete wavelet transform. And then, the wavelet coefficients obtained from each subband are used as feature vectors to construct the HMMs. In the recognition stage, we obtained higher recognition rate by summing of each recognition rate of wavelet subband. The usefulness of the proposed method was shown by comparing with conventional VQ and DCT-HMM ones. The experimental results show that the proposed method is more satisfactory than previous ones.