On the Application of Mixture AR Hidden Markov Models to Text Independent Speaker Recognition

IEEE Transactions on Signal Processing

Volumn 39, Issue 3, 1991, Pages 563-570

  Tishby, Naftali Z ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY--RANDOM PROCESSES; STATISTICAL METHODS--APPLICATIONS;

MARKOV MODELS;

SPEECH;

EID: 0026117640     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.80876     Document Type: Article

References (16)

1. F. K. Soong, A. E. Rosenberg, L. R. Rabiner, and B. H. Juang, “A vector quantization approach to speaker recognition,” in Proc. ICASSP 85, IEEE Int. Conf. Acoust., Speech, Signal Processing, 1985, pp. 387-390; also AT&T Tech. J., vol. 66, no. 2, pp. 14–26, 1987.
2. A. E. Rosenberg and F. K. Soong, in Proc. ICASSP 86, IEEE Int. Conf. Acoust., Speech, Signal Processing, 1986, pp. 873–876.
3. Alan B. Poritz, “Linear predictive hidden Markov models and the speech signal,” in Proc. ICASSP 82 (Paris, France), May 1982, pp. 1291–1294.
4. L. R. Rabiner, “A tutorial on hidden Markov models and selected applications in speech recognition,” Proc. IEEE, vol. 77, no. 2, pp. 257–-286 1989.
5. B.-H. Juang and L. R. Rabiner, IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-33, no. 6, 1404, 1985.
6. B. H. Juang, S. E. Levinson, and M. Sondhi, “Maximum likelihood estimation for multivariate mixture observation of Markov chains,” IEEE Trans. Inform. Theory, vol. IT-32, no. 2, pp. 307–309, 1986.
7. B.-H. Juang, AT&T Tech. J., vol. 63, no. 7, pp. 1213–1243, 1984.
8. L. E. Baum, T. Petrie, G. Soules, and N. Weiss, “A maximization technique in the statistical analysis of probabilistic functions of Markov chains,” Ann. Math. Stat., vol. 41, no. 1, pp. 164–171, 1970.
9. A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” J. Roy. Stat. Soc., vol. 39, no. 1, pp. 1–38, 1977.
10. R. M. Gray, “Vector quantization,” IEEE ASSP Mag, pp. 4–29, 1984.
11. J. A. Hartigan, Clustering Algorithms. New York: Wiley, 1975.
12. L. R. Rabiner, J. G. Wilpon, and B. H. Juang, “A segmental k-means training procedure for connected word recognition,” AT&T Tech. J., vol. 65, no. 3, 21–31, 1986.
13. G. D. Forney, “The Viterbi algorithm,” Proc. IEEE, vol. 16, pp. 268–-278 1973.
14. S. E. Levinson, “Continuously variable duration hidden Markov models for automatic speech recognition,” Comput. Speech, Language, vol. 1, pp. 29–45, 1986.
15. Y. Ephraim, A. Dembo, and L. R. Rabiner, “A minimum discrimination information approach for hidden Markov modeling,” in ICASSP 87, IEEE Int. Conf Acoust., Speech, Signal Processing, 1987, pp. 25–28.
16. N. Tishby, “Speech modeling with prior information and its application to speaker recognition,” in ICASSP 1988, IEEE Int. Conf Acoust., Speech, Signal Processing, 1988, pp. 87–90.