Abstract
A self-adaptive Hidden Markov Model (SA-HMM) based framework is proposed for behavior recognition in this paper. In this model, if an unknown sequence cannot be classified into any trained HMMs, a new HMM will be generated and trained, where online training is applied on SA-HMMs to dynamically generate the high-level description of behaviors. The SA-HMMs based framework consists of training and classification stages. During the training stage, the state transition and output probabilities of HMMs can be optimized through the Gaussian Mixture Models (GMMs) so the generated symbols can match the observed image features within a specific behavior class. On the classification stage, the probability with which a particular HMM generates the test symbol sequence will be calculated, which is proportional to the likelihood.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chan, M.T., Hoogs, A., Schmiederer, J., Perterson, M.: Detecting rare events in video using semantic primitives with HMM. In: Proc. of IEEE Conf. on ICPR (August 2004)
Stauffer, C., Eric, W., Grimson, L.: Learning patterns of activity using real-time tracking. IEEE Transactions on Pattern Analysis and Machine Intelligence, archive 22 (August 2000)
Zhong, H., Shi, J., Visontai, M.: Detecting unusual activity in video. In: Proc. of IEEE Conf. on Vision and Pattern Recognition (June 2004)
Boiman, O., Irani, M.: Detecting Irregularities in Images and in Video. In: Proc. 10th IEEE Int’l Conf. Computer Vision, pp. 462–469 (2005)
Xiang, T., Gong, S.: Video Behavior Profiling for Anomaly Detection. IEEE Trans. on Pattern Analysis and Machine Intelligence 30(5), 893–908 (2008)
Xiang, T., Gong, S.: Video Behavior Profiling and Abnormality Detection without Manual Labeling. In: Proc. 10th IEEE Int’l Conf. Computer Vision, pp. 1238–1245 (2005)
Dempster, A., Laird, N., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society 39(B), 1–38 (1977)
Baum, L.E., Petrie, T., Soules, G., Weiss, N.: A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Ann. Math. Statist. 41(1), 164–171 (1970)
Viterbi, A.J.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory 13, 260–269 (1967)
Olson, C.F.: A Probabilistic Formulation for Hausdorff Matching. In: Proc. of IEEE Conf. on Vision and Pattern Recognition (CVPR 1998), Santa Barbara, CA, pp. 150–156 (1998)
Rabiner, L.R.: A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. Proc. IEEE 77(2), 257–286 (1989)
Batu, T., Guha, S., Kannan, S.: Inferring Mixtures of Markov Chains. In: Shawe-Taylor, J., Singer, Y. (eds.) COLT 2004. LNCS, vol. 3120, pp. 186–199. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yin, J., Meng, Y. (2009). Abnormal Behavior Recognition Using Self-Adaptive Hidden Markov Models. In: Kamel, M., Campilho, A. (eds) Image Analysis and Recognition. ICIAR 2009. Lecture Notes in Computer Science, vol 5627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02611-9_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-02611-9_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02610-2
Online ISBN: 978-3-642-02611-9
eBook Packages: Computer ScienceComputer Science (R0)