Bayesian Adaptive Learning of the Parameters of Hidden Markov Model for Speech Recognition

IEEE Transactions on Speech and Audio Processing

Volumn 3, Issue 5, 1995, Pages 334-345

  Huo, Qiang ^a   Chan, Chorkin ^a   Lee, Chin Hui ^b  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MARKOV PROCESSES; MATHEMATICAL MODELS; MATRIX ALGEBRA; PARAMETER ESTIMATION; STATISTICAL METHODS; VECTORS;

BAYESIAN ADAPTIVE LEARNING; CONTINUOUS DENSITY HIDDEN MARKOV MODEL; DIAGONAL MULTIVARIATE GAUSSIAN DENSITY; DISCRETE HIDDEN MARKOV MODEL; SEMI-CONTINUES HIDDEN MARKOV MODEL; SPEAKER ADAPTATION;

SPEECH RECOGNITION;

EID: 0029377113     PISSN: 10636676     EISSN: None     Source Type: Journal    
DOI: 10.1109/89.466661     Document Type: Article

References (45)

1. J. Aitchison and S. M. Shen, “Logistic-normal distributions: Some properties and uses,” Biometrika, vol. 67, pp. 261-272, 1980.
2. L. E. Baum, “An inequality and associated maximization techniques in statistical estimation for probabilistic functions of Markov processes,” Inequalities, vol. 3, pp. 1-8, 1972.
3. L. E. Baum and J. A. Egon, “An inequality with applications to statistical estimation for probabilistic functions of a Markov process and to a model for ecology,” Bull. Amer. Math. Soc., vol. 73, pp. 360-363, 1967.
4. L. E. Baum, T. Petrie, G. Soules, and N. Weiss, “A maximization technique occurring in the statistical analysis of probabilistic function of Markov chains,” Annals Math. Statis., vol. 41, no. 1, pp. 164-171, 1970.
5. J. R. Bellegarda and D. Nahamoo, Tied mixture continuous parameter modeling for speech recognition,” IEEE Trans Acoust., Speech, Signal Processing, vol. 38, no. 12, pp. 2033-2045, 1990.
6. P. F. Brown, C.-H. Lee, and J. C. Spohrer, “Bayesian adaptation in speech recognition,” in Proc. ICASSP-83, Boston, May 1983, pp. 761-764.
7. M. H. DeGroot, Optimal Statistical Decisions. New York: McGraw-Hill. 1970.
8. A. P. Dempster. N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” Royal Statist. Soc., J., Ser. B. vol. 39, no. 1, pp. 1-38, 1977.
9. M. Ferretti and S. Scarci, “Large-vocabulary speech recognition with speaker-adapted codebook and HMM parameters,” in Proc. Eurospeech89, Paris, Sept. 1989, pp. 154-156.
10. G. D. Forney, “The Viterbi algorithm,” Proc. IEEE, vol. 61, pp. 268-278, 1973.
11. J.-L. Gauvain and C.-H. Lee, “Bayesian learning of Gaussian mixture densities for hidden Markov models,” in Proc. DARPA Speech Natural Language Workshop, Feb. 1991, pp. 272-277.
12. “Bayesian learning for hidden Markov model with Gaussian mixture state observation densities,” Speech Commun., vol. 11, pp. 205-213, 1992.
13. “MAP estimation of continuous density HMM: Theory and applications,” in Proc. DARPA Speech Natural Language Workshop, Feb. 1992, pp. 185-190.
14. “Maximum a posteriori estimation for multivariate Gaussian mixture observations of Markov chains,” IEEE Trans. Speech Audio Processing, vol. 2, no. 2, pp. 291-298, Apr. 1994.
15. X.-D. Huang and M. A. Jack, “Semicontinuous hidden Markov models for speech signals,” Comput. Speech Language, vol. 3, pp. 239-251, 1989.
16. Q. Huo, “A study on several statistical acoustic modeling problems in automatic speech recognition,” Ph. D. thesis, Department of Electronic Engineering Information Science, Univ. of Science and Technology of China, Mar. 1994.
17. Q. Huo and C. Chan, “Bayesian adaptive learning of the parameters of hidden Markov model for speech recognition,” Technical Report TR 92-08, Department of Computer Science, The Univ. of Hong Kong, Sept. 1992.
18. Q. Huo, C. Chan, and C.-H. Lee. “Bayesian learning of the parameters of discrete and tied mixture HMMs for speech recognition,” in Proc. Eurospeech-93, Berlin, Germany, 1993, pp. III-1567-1570.
19. “Bayesian learning of the SCHMM parameters for speech recognition,” in Proc. ICASSP-94, Adelaide, Australia, 1994, pp. I-221-224.
20. “Segmental quasi-Bayesian learning of the mixture coefficients in SCHMM for speech recognition,” in Proc. 1994 Int. Symp. Speech, Image Processing, Neural Networks, Hong Kong, 1994, pp. 678-681.
21. B.-H. Juang, “Maximum-likelihood estimation of mixture multivariate stochastic observations of Markov chains,” ATT Tech. J., vol. 64, no. 6. pp. 1235-1249, 1985.
22. B.-H. Juang, S. E. Levinson, and M. M. Sondhi, “Maximum likelihood estimation for multivariate mixture observations of Markov chains,” IEEE Trans. Inform. Theory, vol. IT-32, no. 2, pp. 307-309, Mar. 1986.
23. B.-H. Juang and L. R. Rabiner, “The segmental k-means algorithm for estimating parameters of hidden Markov models,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 38, no. 9, pp. 1639-1641, Sept. 1990.
24. H.-K. Kuo. “Speaker clustering with hidden Markov models,” Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 1992.
25. I. H. LaValle, An Introduction to Probability, Decision, and Inference. New York:, Holt, Rinehart and Winston, 1970.
26. C.-H. Lee and J.-L. Gauvain, “Speaker adaptation based on MAP estimation of HMM parameters,” in Proc. ICASSP-93, Apr. 1993, pp. 11-588-591.
27. C.-H. Lee. C.-H. Lin, and B.-H. Juang, “A study on speaker adaptation of the parameters of continuous density hidden Markov models,” IEEE Trans. Signal Processing, vol. 39, no. 4, pp. 806-814, Apr. 1991.
28. C.-H. Lee, L. R. Rabiner, R. Pieraccini, and J. G. Wilpon, “Acoustic modeling for large vocabulary speech recognition,” Comput. Speech Language, vol. 4, pp. 127-165, 1990.
29. S. E. Levinson, L. R. Rabiner, and M. M. Sondhi, “An introduction to the application of the theory of probabilistic functions of a Markov process to automatic speech recognition,” Bell Syst. Tech. J., vol. 62, no. 4, pp. 1035-1074, 1983.
30. Y. Linde, A. Buzo, and R.M. Gray, “An algorithm for vector quantizer design,” IEEE Trans. Commun., vol. COM-28, pp. 84-95, 1980.
31. L. R. Liporace. “Maximum likelihood estimation for multivariate observations of Markov sources,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 729-734, 1982.
32. U. E. Makov and A. F. M. Smith, “A quasi-Bayes unsupervised learning procedure for priors,” IEEE Trans. Inform. Theory, vol. IT-23, no. 6, pp. 761-764, 1977.
33. J. S. Maritz and T. Lwin, Empirical Bayes Methods, 2nd edition. London: Chapman and Hall, 1989.
34. J. J. Martin, Bayesian Decision Problems and Markov Chains. New York: Wiley, 1967.
35. L. Mathan and L. Miclet, “Speaker hierarchical clustering for improving speaker independent HMM word recognition,” in Proc. ICASSP-90, Albuquerque, NM, Apr. 1990, pp. 149-152.
36. S. Nakamura and T. Akabane, “A neural speaker model for speaker clustering,” in Proc. ICASSP-91 Toronto, 1991, pp. 853-856.
37. L. R. Rabiner, “A tutorial on hidden Markov models and selected applications in speech recognition,” Proc. IEEE, vol. 77, no. 2, pp. 257-286, Mar. 1989.
38. L. R. Rabiner, C.-H. Lee, B.-H. Juang, and J.-G. Wilpon, “HMM clustering for connected word recognition,” in Proc. ICASSP-89, Glasgow, Scotland, 1989, pp. 405-08.
39. L. R. Rabiner, J. G. Wilpon, and B.-H. Juang. “A segmental k-means training procedure for connected word recognition,” ATT Tech. J., vol. 65, no. 3, pp. 21-31, 1986.
40. H. Robbins, “An empirical Bayes approach to statistics,” in Proc. Third Berkeley Symp. Math. Statist. Prob., 1955, pp. 1-157-164.
41. H. Robbins, “The empirical Bayes approach to statistical decision problems,” Ann. Math. Statist., vol. 35, pp. 1-20, 1964.
42. A. E. Rosenberg and F.-K. a vector talker recognition system in text independent and text dependent modes,” Comput. Speech Language, vol. 22, pp. 143-157, 1987.
43. A. F. M. Smith and U. E. Makov, “A quasi-Bayes sequential procedure for mixtures.” Royal Statist. Soc. J., Series B, vol. 40. no. 1, pp. 106-112, 1978.
44. Robert L. Winkler, Introduction to Bayesian Inference and Decision. New York: Holt, Rinehart and Winston, 1972.
45. C. F. Jeff Wu. “On the convergence properties of the EM algorithm,” Annals Statist., vol. 11, no. 1, pp. 95-103, 1983.