• Speech Sciences
• /
• v.15 no.4
• /
• pp.97-105
• /
• 2008

Nowadays an HMM-based text-to-speech system (HTS) has been very widely studied because it needs less memory and low computation complexity and is suitable for embedded systems in comparison with a corpus-based unit concatenation text-to-speech one. It also has the advantage that voice characteristics and the speaking rate of the synthetic speech can be converted easily by modifying HMM parameters appropriately. We implemented an HMM-based Korean text-to-speech system using a small size Korean speech DB and proposes a method to increase the naturalness of the synthetic speech by controlling duration model parameters in the HMM-based Korean text-to speech system. We performed a paired comparison test to verify that theses techniques are effective. The test result with the preference scores of 73.8% has shown the improvement of the naturalness of the synthetic speech through controlling the duration model parameters.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.1E
• /
• pp.11-19
• /
• 1994

Hidden Markov Models (HMM's) with explicit state duration density (HMM/SD) can represent the time-varying characteristics of speech signals more accurately. However, such an advantage is reduced in relatively smooth state duration densities or ling bounded duration. To solve this problem, we propose HMM's with global path constraint (HMM/GPC) where the transition between states occur only within prescribed time slots. HMM/GPC explicitly limits state durations and accurately describes the temproal structure of speech simply and efficiently. HMM's formed by combining HMM/GPC with HMM/SD are also presented (HMM/SD+GPC) and performances are compared. HMM/GPC can be implemented with slight modifications to the conventional Viterbi algorithm. HMM/GPC and HMM/SD_GPC not only show superior performance than the conventional HMM and HMM/SD but also require much less computation. In the speaket independent isolated word recognition experiments, the minimum recognition eror rate of HMM/GPC(1.6%) is 1.1% lower than the conventional HMM's and the required computation decreased about 57%.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.6
• /
• pp.26-33
• /
• 2001

Though speaker recognition based on conventional AR HMM shows good performance, its lack of modeling the environmental noise makes its performance degraded in case of practical noisy environment. In this paper, a robust speaker recognition system based on AR HMM is proposed, where noise is considered in the observation signal model for practical noisy environment and duration-term is considered to increase performance. Experimental results, using the digits database from 100 speakers (77 males and 23 females) under white noise and car noise, show improved performance.

• Phonetics and Speech Sciences
• /
• v.4 no.3
• /
• pp.111-117
• /
• 2012

In this paper, we compare the performance of several speaker adaptation methods for a HMM-based Korean speech synthesis system with small amounts of adaptation data. According to objective and subjective evaluations, a hybrid method of constrained structural maximum a posteriori linear regression (CSMAPLR) and maximum a posteriori (MAP) adaptation shows better performance than other methods, when only five minutes of adaptation data are available for the target speaker. During the objective evaluation, we find that the duration models are insufficiently adapted to the target speaker as the spectral envelope and pitch models. To alleviate the problem, we propose the duration rectification method and the duration interpolation method. Both the objective and subjective evaluations reveal that the incorporation of the proposed two methods into the conventional speaker adaptation method is effective in improving the performance of the duration model adaptation.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.5
• /
• pp.756-764
• /
• 1995

In this paper, we proposed MLP(MultiLayer Perceptron) based HMM's(Hidden Markov Models) with bounded state duration for isolated word recognition. The minimum and maximum state duration for each state of a HMM are estimated during the training phase and used as parameters of constraining state transition in a recognition phase. The procedure for estimating these parameters and the recognition algorithm using the proposed HMM's are also described. Speaker independent isolated word recognition experiments using a vocabulary of 10 city names and 11 digits indicate that recognition rate can be improved by adjusting the minimum state durations.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.517-521
• /
• 2008

HMM의 약점인 상태 지속 분포를 개선하는 새로운 개념의 확률적 전역+지역 시간 지속 분포 segment 모델(GL-STDM)을 제안한다. 즉, 시계열 신호의 전역적 시간 정보를 표현하고, 각 상태 별 duration 모델과 각 상태의 duration 정보 사이의 상관관계를 표현하는 global pattern (shape 또는 long-term dependency)을 제안한다. 그러나 제안 모델은, Markov 가정을 깨뜨리기 때문에 dynamic programming이 자랑하는 단순함, 효율성을 유지하지는 못한다. 하지만 최근 부각되는 방법인 Monte Carlo 표본 기법을 이용하여 효과적으로 문제를 해결하는 방법을 제시하였다. 본 논문에서는 제안 모델 GL-STDM의 개념과 정의, 그리고 추론 방법과 모델 평가 방법을 기술하였다.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.1
• /
• pp.81-89
• /
• 1995

In this paper, we report the continuous speech recognition system using the continuous HMM with discrete duration control and the regression coefficients. Also, we do recognition experiment using One Pass DP method(for 25 sentences of robot control commands) with finite state automata context control. In the experiment for 4 connected spoken digits, the recognition rates are $93.8\%$ when the discrete duration control and the regression coefficients are included, and $80.7\%$ when they are not included. In the experiment for 25 sentences of the robot control commands, the recognition rate are $90.9\%$ when FSN is not included and $98.4\%$ when FSN is included.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2003.10a
• /
• pp.200-209
• /
• 2003

주어진 염기서열에서 유전자 영역을 예측하는 유전자 구조 예측은 유전체 프로젝트의 중요한 과정 중 하나이며 유전체 프로젝트 전체에 큰 영향을 준다. 진핵생물의 유전체가 원핵생물의 유전체에 비해 더 복잡한 구조를 가지기 때문에 진핵생물의 유전자 구조 예측 모델 역시원핵생물에 비해 다양한 모델이 제안되었다. 본 연구팀은 duration hidden markov model을 기본형태로 하여 EGSP(Eukaryotic Gene Structure Prediction)프로그램을 개발하였다. 현재 개발된 진핵생물의 유전자 구조 예측 알고리즘 중에서 GenScan이 가장 정교한 젓으로 보고 되고 있는데, EGSP의 결과분석을 위해 Genscan과 함께 GeneID, Morgan의 예측결과를 여러 가지 기준에서 비교하였다. EGSP는 정교한 예측모델을 가지고 있음에도 각 구성모듈에 대한 파라메터의 정교함에서 부족한 면이 나타나므로, 모델의 개선과 각 모듈의 조율을 통해 더욱 개선된 결과를 가지게 될 것이다.

• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1026-1033
• /
• 2017

In this paper a Bayesian modeling and duration-based prediction method is proposed for health clinic time series data using the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM). HDP-HMM is a Bayesian extension of HMM which can find the optimal number of health states, a number which is highly uncertain and even difficult to estimate under the context of health dynamics. Test results of HDP-HMM using simulated data and real health clinic data have shown interesting modeling behaviors and promising prediction performance over the span of up to five years. The future of health change is uncertain and its prediction is inherently difficult, but experimental results on health clinic data suggests that practical long-term prediction is possible and can be made useful if we present multiple hypotheses given dynamic contexts as defined by HMM states.

• KIISE Transactions on Computing Practices
• /
• v.21 no.1
• /
• pp.94-99
• /
• 2015

With the recent machine learning paradigm of using nonparametric Bayesian statistics and statistical inference based on random sampling, the Dirichlet distribution finds many uses in a variety of graphical models. It is a multivariate generalization of the gamma distribution and is defined on a continuous (K-1)-simplex. This paper presents a sampling method for a Dirichlet distribution for the problem of dividing an integer X into a sequence of K integers which sum to X. The target samples in our problem are all positive integer vectors when multiplied by a given X. They must be sampled from the correspondingly gridded simplex. In this paper we develop a Markov Chain Monte Carlo (MCMC) proposal distribution for the neighborhood grid points on the simplex and then present the complete algorithm based on the Metropolis-Hastings algorithm. The proposed algorithm can be used for the Markov model, HMM, and Semi-Markov model for accurate state-duration modeling. It can also be used for the Gamma-Dirichlet HMM to model q the global-local duration distributions.