Dynamic programming inference of Markov networks from finite sets of sample strings
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Step Towards Unification of Syntactic and Statistical Pattern Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special memorial issue for Professor King-Sun Fu
Speech Communication - Eurospeech '91
A new class of fenonic Markov word models for large vocabulary continuous speech recognition
ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
On the phonetic structure of a large hidden Markov model
ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
ICASSP'92 Proceedings of the 1992 IEEE international conference on Acoustics, speech and signal processing - Volume 1
High performance connected digit recognition using codebook exponents
ICASSP'92 Proceedings of the 1992 IEEE international conference on Acoustics, speech and signal processing - Volume 1
Hi-index | 0.00 |
The DIHMM algorithm performs a robust estimation of the HMM topology and parameters. It allows a better control of the speech variability within each state of the HMM, yielding enhanced estimates. The DIHMM parameters (number of states, structure of the Gaussian mixture density functions (modes), transition matrix) are obtained from the training data via probabilistic grammatical inference techniques, welded in a Viterbi-like training framework. Experimental results on various databases indicate a global improvement of the recognition rates in adverse environments: the results averaged on three databases show an increase of 12.8% on raw data and 2.4% when using NSS [11].