A sequential pruning strategy for the selection of the number of states in hidden Markov models

Pattern Recognition Letters

Volumn 24, Issue 9-10, 2003, Pages 1395-1407

  Bicego, Manuele ^a   Murino, Vittorio ^a   Figueiredo, Mário A T ^b  

^a UNIVERSITY OF VERONA   (Italy)

^b INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

Bayesian inference criterion; Hidden markov models; Minimum description length; Model selection; State pruning

Indexed keywords

COMPUTATIONAL METHODS; DATA REDUCTION; MATHEMATICAL MODELS; SENSITIVITY ANALYSIS;

BAYESIAN INFERENCE;

PATTERN RECOGNITION;

NUMERICAL MODEL;

EID: 0037410744     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(02)00380-X     Document Type: Article

References (29)

1. Achermann, B., Bunke, H., 1996. Combination of face classifiers for person identification. In: Internat. Conf. on Pattern Recognition, pp. C416-C420.
2. Baum, L. (1970). An inequality and associated maximization technique in statistical estimation for probabilistic functions of Markov processes. Inequality 3, 1-8.
3. Baum, L., Petrie, T., Soules, G., Weiss, N. (1970). A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Annals Math. Statist. 41(1), 164-171.
4. Bicego, M., Murino, V., submitted for publication. Investigating Hidden Markov Models capabilities in 2D shape classification. IEEE Trans. Pattern Anal. Machine Intell.
5. Bicego, M., Dovier, A., Murino, V. (2001). Designing the minimal structure of hidden Markov models by bisimulation. In M. Figueiredo, J. Zerubia, A. Jain (Eds.), Energy Minimization Methods in Computer Vision and Pattern Recognition, Springer 75-90.
6. Bishop, C. M. (1995). Neural Network for Pattern Recognition. Clarendon Press.
7. Brand, M. (1999). An entropic estimator for structure discovery. In M. Kearns, S. Solla, D. Cohn (Eds.), Advances in Neural Information Processing Systems, vol. 11. MIT Press Cambridge, MA
8. Brémaud, P. (1999). Markov Chains. Springer-Verlag.
9. Dempster, A., Laird, N., Rubin, D. (1977). Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statist. Soc. B 39, 1-38.
10. Eickeler, S., Kosmala, A., Rigoll, G. 1998. Hidden Markov Model based continuous online gesture recognition. In: IEEE Proc. Internat. Conf. on Pattern Recognition. vol. 2, pp. 1206-1208.
11. Eickeler, S., Müller, S., Rigoll, G. (2000). Recognition of JPEG compressed face images based on statistical methods. Image Vision Comput., 18 279-287.
12. Figueiredo, M., Leitao, J., Jain, A. (1999). On fitting mixture models. In: E. Hancock, & M. Pellilo (Eds.), Energy Minimization Methods in Computer Vision and Pattern Recognition, Springer Verlag, 54-69.
13. Forney, G. (1973). The Viterbi algorithm. Proc. IEEE 61, 268-278.
14. Hu, J., Brown, M., Turin, W. (1996). HMM based online handwriting recognition. IEEE Trans. Pattern Anal. Machine Intell. 18(10), 1039-1045.
15. Hughey, R., Krogh, A. (1996). Hidden Markov Model for sequence analysis: Extension and analysis of the basic method. Comput. Appl. Biosci. 12, 95-107.
16. Jebara, T., Pentland, A., 1999. Action reaction learning: Automatic visual analysis and synthesis of interactive behavior. In: Proc. Internat. Conf. on Comput. Vision Systems.
17. Juang, B., Levinson, S., Sondhi, M. (1986). Maximum likelihood estimation for multivariate mixture observations of Markov chain. IEEE Trans. Inform. Theory 32(2), 307-309.
18. Kohir, V.V., Desai, U.B., 1998. Face recognition using dct-hmm approach. In: Workshop on Advances in Facial Image Analysis and Recognition Technology (AFIART), Freiburg, Germany
19. Li, D., Biem, A., Subrahmonia, J., 2001. HMM topology optimization for handwriting recognition. In: Proc. of IEEE Interna. Conf. on Acoust., Speech, and Signal Process, vol. 3. pp. 1521-1524.
20. Nefian, A.V., Hayes, M.H., 1998. Hidden Markov models for face recognition. In: Proc. IEEE Internat. Conf. on Acoust., Speech and Signal Process. (ICASSP), Seattle, pp. 2721-2724.
21. Oliver, J., Baxter, R., Wallace, C. (1996). Unsupervised learning using MML in machine learning. Proc. of 13th Internat. Conf. (ICML 96) Morgan Kaufmann Publishers, pp. 364-372.
22. Rabiner, L. (1989). A tutorial on hidden Markov models and selected applications in speech recognition. Proc. of IEEE, 77(2), 257-286.
23. Raftery, A. (1995). Bayesian model selection in social research. Sociol. Methodol., 111-196.
24. Rissanen, J. (1986). Stochastic complexity and modeling. The Annals Statist., 14.
25. Samaria, F., 1994. Face recognition using hidden markov models. Technical report, Ph.D. thesis, Engineering Department, Cambridge University.
26. Schwarz, G. (1978). Estimating the dimension of a model. Ann. Statist. 6(2), 461-464.
27. Stolcke, A., & Omohundro, S. (1993). Hidden Markov model induction by Bayesian model merging. In S. Hanson, J. Cowan, & C. Giles (Eds.), Advances in Neural Information Processing Systems, Morgan Kaufmann, San Mateo, CA, pp. 11-18.
28. Stone, M. (1974). Cross-validatory choice and assessment of statistical predictions. J. Roy. Statist. Soc. B 36, 111-147.
29. Zimmermann, M., Bunke, H., 2001. Hidden Markov model length optimization for handwriting recognition systems. TR IAM-01-003 University of Bern.