Designing the Minimal Structure of Hidden Markov Model by Bisimulation-Reference-Cited by-同舟云学术

Designing the Minimal Structure of Hidden Markov Model by Bisimulation

Published:2001 Issue: Volume: Page:75-90
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bicego Manuele,Dovier Agostino,Murino Vittorio

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44745-8_6

Reference26 articles.

1. Rabiner, L.R.: A tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. Proc. of IEEE 77(2) (1989) 257–286.

2. Baum, L.E., Petrie, T.E, Soules, G., Weiss, N.: A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Annals of Math. Statistics. 41(1) (1970) 164–171.

3. Baum, L.E.: An inequality and associated maximization technique in statistical estimation for probabilistic functions of Markov processes. Inequality 3 (1970) 1–8.

4. Veltman, S.R., Prasad, R.: Hidden Markov Models applied to on-line handwritten isolated character recognition. IEEE Trans. Image Proc., 3(3) (1994) 314–318.

5. Churchill, G.A.: Hidden Markov Chains and the analysis of genome structure. Computers & Chemistry 16 (1992) 107–115.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Belief Bisimulation for Hidden Markov Models;Lecture Notes in Computer Science;2012

2. Taxonomy-driven lumping for sequence mining;Data Mining and Knowledge Discovery;2009-07-21

3. Unsupervised scene analysis: A hidden Markov model approach;Computer Vision and Image Understanding;2006-04