Hidden Markov models for spatio-temporal pattern recognition

Lovell, Brian C. and Caelli, Terry (2005). Hidden Markov models for spatio-temporal pattern recognition. In C. H. Chen and P. S. P. Wang (Ed.), Handbook of pattern recognition and computer vision 3rd ed. (pp. 1-16) Singapore: World Scientific Publications.

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
handbook.pdf handbook.pdf application/pdf 171.55KB 1196
Author Lovell, Brian C.
Caelli, Terry
Title of chapter Hidden Markov models for spatio-temporal pattern recognition
Title of book Handbook of pattern recognition and computer vision
Place of Publication Singapore
Publisher World Scientific Publications
Publication Year 2005
Sub-type Research book chapter (original research)
Edition 3rd
ISBN 9812561056
Editor C. H. Chen
P. S. P. Wang
Chapter number 1
Start page 1
End page 16
Total pages 16
Total chapters 33
Collection year 2005
Language eng
Subjects 280208 Computer Vision
280203 Image Processing
280104 Computer-Human Interaction
280207 Pattern Recognition
700199 Computer software and services not elsewhere classified
Abstract/Summary The success of many real-world applications demonstrates that hidden Markov models(HMMs) are highly effective in one-dimensional pattern recognition problems such as speech recognition. Research is now focussed on extending HMMs to 2-D and possibly 3-D applications which arise in gesture, face, and handwriting recognition. Although the HMM has become a major workhorse of the pattern recognition community, there are few analytical results which can explain its remarkably good pattern recognition performance. There are also only a few theoretical principles for guiding researchers in selecting topologies or understanding how the model parameters contribute to performance. In this chapter, we deal with these issues and use simulated data to evaluate the performance of a number of alternatives to the traditional Baum-Welch algorithm for learning HMM parameters. We then compare the best of these strategies to Baum-Welch on a real hand gesture recognition system in an attempt to develop insights into these fundamental aspects of learning.
Keyword Iris-research
Gesture recognition
Face recognition
Handwriting recognition
Pattern analysis
References 1. A A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society, 39(1):1-38, 1977. 2. R. Ash. Information Theory. Interscience Publishers, 1995. 3. V. Balasubramanian. Equivalence and reduction of hidden markov models. Technical Report A.I. Technical Report No. 1370, MIT Artificial Intelligence Laboratory, 1993. 4. L. Baum, T. Petrie, T. Soules, and N.Weiss. A maximization technique occurring in the statistical analysis of probabilistic functions of markov cahins. The Annals of Mathematical Statistics, 41:164-171, 1970. 5. G. R. Bradski. Computer video face tracking for use in a perceptual user interface. Intel Technology Journal, Q2, 1998. last visited May 2004. 6. M. Brand. An entropic estimator for structure discovery. Advances in Neural Info. Proc. Systems,11:723-729, 1999. 7. T. Caeli and B. McCane. Components analysis of hidden markov models in computer vision. In Proc. of 12th International Conference on Image Analysis and Processing, pages 510-515. 8. Terry Caelli, Andrew McCabe, and Garry Briscoe. Shape tracking and production using hidden markov models. International Journal of Pattern Recognition and Artificial Intelligence (IJPRAI), 15(1):197-221, February 2001. 9. R. I. A. Davis, B. C. Lovell, and T. Caelli. Improved estimation of hidden markov model parameters from multiple observation sequences. In Proceedings of the International Conference on Pattern Recognition (ICPR2002), volume 2, pages 168-171, Quebec City, August 2002. IEEE. 10. Richard I. A. Davis and Brian C. Lovell. Comparing and evaluating hmm ensemble training algorithms using train and test and condition number criteria. Pattern Analysis and Applications, 6(4):327-336, February 2003. 11. Richard Dawkins. The Blind Watchmaker: Why the Evidence of Evolution Reveals a Universe Without Design. W. W. Norton, New York, 1996. 12. G. D. Forney. The viterbi algorithm. Proc. IEEE, 61:268-278, March 1973. 13. G. Golub and C. Van Loan. Matrix Computations, chapter 2.7, pages 79-81. The Johns Hopkins University Press, 2nd edition, 1989. 14. H. Hartley. Maximum likelihood estimation from incomplete data. Biometrics, 14:174-194, 1958. 15. H.-K. Lee and J. H. Kim. An hmm-based threshold model approach for gesture recognition. IEEE Trans on Pattern Analysis and Machine Intelligence, 21(10):961-973, October 1999. 16. S. E. Levinson, L. R. Rabiner, and M. M. Sondhi. An introduction to the application of the theory of probabilistic functions of a markov process to automatic speech recognition. The Bell System Technical Journal, 62(4):1035-1074, 1983. 17. Nianjun Liu, R. I. A. Davis, B. C. Lovell, and P. J. Kootsookos. Effect of initial hmm choices in multiple sequence training for gesture recognition. In Proceedings of the International Conference on Information Technology, volume 1, pages 608-613, Las Vegas, Nevada USA, April 5-7 2004. 18. R.B. Lyngso, C.N. Pedersen, and H. Nielsen. Metrics and similarity measures for hidden markov models. In International Conference on Intelligent Systems for Molecular Biology, pages 178-186, 1999. 19. D. J. C. Mackay. Ensemble learning for hidden markov models. Technical report, University of Cambridge, 1997. 20. B. McCane and T. Caelli. Diagnostic tools for evaluating hmm components. Technical report, Department of Computer Science, University of Otago, 2001. 21. G. McLachlan and T. Krishnan. The EM algorithm and extensions. Wiley series in probability and statistics. John Wiley and Sons, 1997. 22. C. S. Myers and L. R. Rabiner. A comparative study of several dynamic time-warping algorithms for connected word recognition. The Bell System Technical Journal, 60(7):1389-1409, September 1981. 23. J. Norris. Markov Chains. Cambridge University Press, Cambridge, England, 1997. 24. L. R. Rabiner. A tutorial on hidden markov models and selected applications in speech recognition. Proceedings of the IEEE, 77(2):257-286, February 1989. 25. L.R. Rabiner and B.H. Juang. Fundamentals of Speech Recognition. Prentice Hall, New Jersey, 1993. 26. C. E. Shannon. A mathematical theory of communication. The Bell System Technical Journal, 27:379-423, July 1948. 27. T. Starner and A. Pentland. Real-time american sign language recognition. IEEE Trans, On Pattern Analysis and Machine Intelligence, 20:1371-1375, December 1998. 28. A. Stolke and S. M. Omohundro. Best-first model merging for hidden markov model induction. Technical report, International Computer Science Institute, April 1994. TR-94-003. 29. A. J. Viterbi. Error bounds for convolutional codes and an asymtotically optimal decoding algorithm. IEEE Transactions on Information Theory, IT-13:260-269, April 1967.
Q-Index Code B1
Q-Index Status Provisional Code
Institutional Status UQ

Version Filter Type
Citation counts: Google Scholar Search Google Scholar
Created: Tue, 11 Jan 2005, 10:00:00 EST by Brian C. Lovell on behalf of School of Information Technol and Elec Engineering