On The Application of Hidden Markov Models for Enhancing Noisy Speech

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 37, Issue 12, 1989, Pages 1846-1856

  Ephraim, Yariv ^a   Malah, David ^a   Juang, Biing Hwang ^b  

^a Signal Processing Department AT&T Bell Laboratories ^*

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY; SIGNAL FILTERING AND PREDICTION;

AUTOREGRESSIVE PROCESSES; CLEAN SPEECH WAVEFORM; GAUSSIAN PROCESSES; HIDDEN MARKOV MODELS; SPEECH ENHANCEMENT;

SPEECH;

EID: 0024909863     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/29.45532     Document Type: Note

References (33)

1. Y. Ephraimand R. M. Gray, “A unified approach for encoding clean and noisy sources by means of waveform and autoregressive model vector quantization,” IEEE Trans. Inform. Theory, vol. IT-34, pp. 826-834, July 1988.
2. H. L. Van Trees, Detection, Estimation and Modulation Theory. New York: Wiley, 1968.
3. C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 379-423, 623-656, 1948.
4. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
5. A. B. Poritz, “Hidden Markov models: A guided tour,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing, Apr. 1988, pp. 7-13.
6. J. D. Ferguson, Ed., Proc. Symp. Appl. Hidden Markov Models to Text and Speech, IDA-CRD, Princeton, NJ, 1980.
7. L. R. Bahl, F. Jelinek, and R. L. Mercer, “A maximum likelihood approach to continuous speech recognition,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-5, pp. 179-190, Mar. 1983.
8. B.-H. Juang and L. R. Rabiner, “Mixture autoregressive hidden Markov models for speech signals,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-33, pp. 1404-1413, Dec. 1985.
9. L. E. Baum, T. Petrie, G. Soules, and N. Weiss, “A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains,” Ann. Math. Statist., vol. 41, pp. 164-171, 1970.
10. L. E. Baum, “An inequality and associated maximization technique in statistical estimation of probabilistic functions of Markov processes,” Inequalities, vol. 3, no. 1, pp. 1-8, 1972.
11. L. A. Liporace, “Maximum likelihood estimation for multivariate observations of Markov sources,” IEEE Trans. Inform. Theory, vol. 1T-28, pp. 729-734, Sept. 1982.
12. A. B. Poritz, “Linear predictive hidden Markov models and the speech signal,” in Proc. Symp. Appl. Hidden Markov Models to Text and Speech, J. D. Ferguson, Ed., IDA-CRD, Princeton, NJ, 1980, pp. 88-142, and summarized in
13. Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing, Apr. 1982. pp. 1291-1294.
14. A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likeli-hood from incomplete data via the EM algorithm,” J. Roy. Statist. Soc. B, vol. 39, pp. 1-38, 1977
15. R. E. Crochiere, “A weighted overlap-add method of shorttime Fourier analysis/synthesis,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-28, pp. 99-102, Feb. 1980.
16. L. L. Scharf, D. D. Cox, and J. Masreliez, “Modulo-2π phase sequence estimation,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 615-620, Sept. 1980.
17. J. M. Tribolet and R. E. Crochiere, “Frequency domain coding of speech,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-27, pp. 512-530, Oct. 1979.
18. Y. Ephraim, “Minimum mean square error speech enhancement based upon hidden Markov modeling,” submitted for publication.hood from incomplete data via the EM algorithm, J. Roy. Statist. Soc. B, vol. 39, pp. 1-38, 1977.
19. C. F. J. Wu, “On the convergence properties of the EM algorithm,” Ann Statist., vol. 11, no. 1, pp. 95-103, 1983.
20. L. R. Rabiner, J. G. Wilpon, and B.-H. Juang, “A segmental k-means training procedure for connected word recognition,” AT&T Tech. J., pp. 21-40, May-June 1986.
21. G. D. Forney, Jr., “The Viterbi algorithm,” Proc. IEEE, vol. 61, pp. 268-278, Mar. 1973.
22. B. R. Musicus, “An iterative technique for maximum likelihood parameter estimation on noisy data,” S.M. thesis, M.I.T., Cambridge, 1979.
23. J. S. Lim and A. V. Oppenheim, “All-pole modeling of degraded speech,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-26, pp. 197-209, June 1978.
24. A. Dembo, “The relation between maximum likelihood estimation of structured covariance matrices and periodograms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 1661-1662, Dec. 1986.
25. A. Q. Nguyen, “On the uniqueness of the maximum likelihood estimate of structured covariance matrices,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 1249-1251, Dec. 1984.
26. R. M. Gray, A. H. Gray, Jr., G. Rebolledo, and J. E. Shore, “Rate-distortion speech coding with a minimum discrimination information distortion measure,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 708-721, Nov. 1981.
27. J. D. Markel and A. H. Gray, Jr., Linear Prediction of Speech. New York: Springer-Verlag, 1976.
28. B.-H. Juang and L. R. Rabiner, “The segmental k-means algorithm for estimating parameters of hidden Markov models,” submitted for publication.
29. D. G. Luenberger, Linear and Nonlinear Programming. Reading, MA: Addison-Wesley, 1984.
30. M. J. Sabin and R. M. Gray, “Global convergence and empirical consistency of the generalized Lloyd algorithm,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 148-155, Mar. 1986.
31. R. M. Gray, “Toeplitz and circulant matrices: II,” Stanford Electron. Lab., Stanford, CA, Tech. Rep. 6504-1, Apr. 1977.
32. A. Buzo, A. H. Gray, Jr., R. M. Gray, and J. D. Markel, “Speech coding based upon vector quantization,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-28, pp. 562-574, Oct. 1980.
33. 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, pt. 1, pp. 1035-1074, Apr. 1983.