Which stochastic models allow baum-welch training?

IEEE Transactions on Signal Processing

Volumn 44, Issue 11, 1996, Pages 2746-2756

  Lücke, Helmut ^a  

^a PHILIPS RESEARCH LABORATORIES   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; MARKOV PROCESSES; MATHEMATICAL MODELS; PARAMETER ESTIMATION;

BAUM WELCH ALGORITHM; HIDDEN MARKOV MODELS (HMM);

SPEECH RECOGNITION;

EID: 0030290243     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/78.542181     Document Type: Article

References (17)

1. L. K. Bahl, F. Jeünek, and R. L. Mercer, A maximum likelihood approach to continuous speech recognition, IEEE Trans, Patt. Anal. Machine Intell., vol. PAMI-5, pp. 179-190, 1983.
2. F. Brugnara. R. DeMori. D. Giuliani, and M. Omologo, A family of parallel hidden Markov models, in Proc. Int. Conf. Acoust., Speech, Signal Processing, Mar. 1992.
3. P. Buneman, A characterization of rigid circuit graphs, Discrete Math., pp. 205-212, 1974.
4. A. P. Dawid, Conditional independence in statistical theory,//?. Statist. Soc., vol. B41, no. 1-31, 1979.
5. A. P. Dempster, N. M. Laird, and D. B. Rubin, Maximum likelihood from incomplete data via the EM algorithm. Royal Statist. Soc. Ser. R, vol. 39, pp. 1-38, 1977.
6. F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, J. Cmnhin. Theory Ser. B, vol. 16. pp. 47-56, 1974.
7. C. W. Ho and R. C. T. Lee, Counting clique trees and computing perfect elimination schemes in parallel. Inform. Processing Lett., vol. 31. pp. 61-68. 1989.
8. M. Limdquist, Zero patterns, chordal graphs and matrix completions. Ph.D. thesis, Clemson Univ., Clemson, SC, Uept. of Math. Sei., 1990.
9. T. Nishimura and H. Lücke. A Markov model which models the frame dependencies, Tech. Rep. TR-IT-0044, ATR Interpreting Telecommun. Res. Labs., 1994 (in Japanese).
10. K. K. Paliwal. Use of temporal correlation between successive frames in a idden arkov model based speech recognizer, in Pmc. Int. Conf. Acoust., Speech, Signal Processing, Apr. 1993, pp. 11-215-218.
11. (11] J. Pearl, Probabilistic Reasoning in Intelligent Systems-Networks of Plausible Inference. San Mateo, CAMorgan Kaufmann, 1987.
12. L. R. Rabiner and B. H. Juang, An introduction to hidden Markov models, IEEE Acoust., Speech, Signal Processing Mag., pp. 4-16, Jan. 1986.
13. J. Q. Smith. Influence diagrams for statistical modeling, Ann. Statist., vol. 17, no. 2, pp. 654-672, 1989.
14. Statistical principals on graphs, in Influence Diagrams, Belief Nets and Decision Analysis. New York: Wiley, 1990, pp. 89-120, ch. 5.
15. S. Takahashi, T. Matsuoka, Y. Minami, and K. Shikano, Phoneme HMM's constraned by frame correlations, in Pmc. Int. Conf. Acousl., Speech. Signal Processing, Apr. 1993, pp. II 219-222.
16. J. Walter, Representations of rigid cycle graphs, Ph.D. thesis, Wayne State Univ., Detroit, MI, 1972.
17. C. J. Wellekens, Explicit time correlation in hidden Markov models fur speech recognition, in Five. Int. Conf. Acoust., Speech, Signal Pmces-smg, 1987. pp. 384-386