Triangulating of Dynamic Bayesian Networks for Isolated Digit Recognition

被引:0
作者
Khanteymoori, A. R. [1 ]
Homayounpour, M. M. [1 ]
Menhaj, M. B. [2 ]
机构
[1] AmirKabir Univ, Dept Comp Engn, Tehran, Iran
[2] Amirkabir Univ, Dept Elect Engn, Tehran, Iran
来源
2008 INTERNATIONAL SYMPOSIUM ON TELECOMMUNICATIONS, VOLS 1 AND 2 | 2008年
关键词
Speech processing; Isolated digit recognition; Graphical Models; Dynamic Bayesian Networks; Inference; Graph triangulation;
D O I
10.1109/ISTEL.2008.4651374
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper describes the theory and implementation of Dynamic Bayesian networks in the context of isolated digit recognition. The common statistical model used in isolated digit recognition is the Hidden Markov Model. Bayesian networks provide an expressive graphical language for factoring joint probability distributions. The principle of this approach is to build a speech model using the formalism of dynamic Bayesian networks. In this paper we will show that how triangulation methods affect inference algorithms. We present illustrative experiments and our experiments show that this new approach is very promising in the field of isolated digit recognition.
引用
收藏
页码:614 / +
页数:2
相关论文
共 10 条
[1]  
[Anonymous], 1988, PROBABILISTIC REASON, DOI DOI 10.1016/C2009-0-27609-4
[2]  
[Anonymous], SPEECH RECOGNITION D
[3]  
BARTELS C, 2004, UWEETR20040010
[4]  
BILMES J, 2003, 19 C UNC ART INT AC, P47
[5]  
FRANKEL J, 2004, ARTICULATORY FEATURE
[6]  
Heckerman D., 1996, Technical report, MSR-TR-95-06
[7]  
Kjaerulff U., 1990, R9009 AALB U
[8]  
LAURITZEN SL, 1991, TR9105 AALB U DEP ST
[9]   SIMPLE LINEAR-TIME ALGORITHMS TO TEST CHORDALITY OF GRAPHS, TEST ACYCLICITY OF HYPERGRAPHS, AND SELECTIVELY REDUCE ACYCLIC HYPERGRAPHS [J].
TARJAN, RE ;
YANNAKAKIS, M .
SIAM JOURNAL ON COMPUTING, 1984, 13 (03) :566-579
[10]  
[No title captured]