Abstract
This paper addresses the clustering problem of hidden dynamical systems behind observed multivariate sequences by assuming an interval-based temporal structure in the sequences. Hybrid dynamical systems that have transition mechanisms between multiple linear dynamical systems have become common models to generate and analyze complex time-varying event. Although the system is a flexible model for human motion and behaviors, the parameter estimation problem of the system has a paradoxical nature: temporal segmentation and system identification should be solved simultaneously. The EM algorithm is a well-known method that solves this kind of paradoxical problem; however the method strongly depends on initial values and often converges to a local optimum. To overcome the problem, we propose a hierarchical clustering method of linear dynamical systems by constraining eigenvalues of the systems. Due to the constraints, the method enables parameter estimation of dynamical systems from a small amount of training data, and provides well-behaved initial parameters for the EM algorithm. Experimental results on simulated and real data show the method can organize hidden dynamical systems successfully.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anderson, B.D.O., Moor, J.B.: Optimal Filtering. Prentice-Hall, Englewood Cliffs (1979)
Blake, B.N.A., Isard, M., Rittscher, J.: Learning and classification of complex dynamics. IEEE Trans. on Pattern Analysis and Machine Intelligence 22(9), 1016–1034 (2000)
Bregler, C.: Learning and recognizing human dynamics in video sequences. In: Proc. of Intl. Conference on CVPR, pp. 568–574 (1997)
Cootes, T.F., Edwards, G.J., Taylor, C.J.: Active appearance model. In: Burkhardt, H., Neumann, B. (eds.) ECCV 1998. LNCS, vol. 1407, pp. 484–498. Springer, Heidelberg (1998)
Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the em algorithm. J. R. Statist. Soc. B 39, 1–38 (1977)
Ghahramani, Z., Hinton, G.E.: Switching state-space models. Technical Report CRG-TR-96-3, Dept. of Computer Science, University of Toronto (1996)
Juang, B.H., Rabiner, L.R.: A probabilistic distance measure for hidden markov models. AT & T Technical Journal 64(2), 391–408 (1985)
Langan, D.A., Modestino, J.W., Zhang, J.: Cluster validation for unsupervised stochastic model-based image segmentation. IEEE Trans. on Image Processing 7(2), 180–195 (1998)
Li, Y., Wang, T., Shum, H.Y.: Motion texture: A two-level statistical model for character motion synthesis. In: SIGGRAPH, pp. 465–472 (2002)
Ostendorf, M., Digalakis, V., Kimball, O.A.: From hmms to segment models: A unified view of stochastic modeling for speech recognition. IEEE Trans. Speech and Audio Process 4(5), 360–378 (1996)
Panjwani, D.K., Healey, G.: Markove random field models for unsupervised segmentation of textured color images. IEEE Trans. on Pattern Analysis and Machine Intelligence 17(10), 939–954 (1995)
Pavlovic, V., Rehg, J.M., MacCormick, J.: Learning switching linear models of human motion. In: Proc. of Neural Information Processing Systems (2000)
Stegmann, M.B., Ersboll, B.K., Larsen, R.: FAME - a flexible appearance modeling environment. Informatics and Mathematical Modelling, Technical University of Denmark (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kawashima, H., Matsuyama, T. (2005). Hierarchical Clustering of Dynamical Systems Based on Eigenvalue Constraints. In: Singh, S., Singh, M., Apte, C., Perner, P. (eds) Pattern Recognition and Data Mining. ICAPR 2005. Lecture Notes in Computer Science, vol 3686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11551188_25
Download citation
DOI: https://doi.org/10.1007/11551188_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28757-5
Online ISBN: 978-3-540-28758-2
eBook Packages: Computer ScienceComputer Science (R0)