Hierarchical Clustering of Dynamical Systems Based on Eigenvalue Constraints

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.

[1]  Harry Shum,et al.  Motion texture: a two-level statistical model for character motion synthesis , 2002, ACM Trans. Graph..

[2]  Timothy F. Cootes,et al.  Active Appearance Models , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Michael Isard,et al.  Learning and Classification of Complex Dynamics , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Mari Ostendorf,et al.  From HMM's to segment models: a unified view of stochastic modeling for speech recognition , 1996, IEEE Trans. Speech Audio Process..

[5]  Christoph Bregler,et al.  Learning and recognizing human dynamics in video sequences , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[6]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[7]  Glenn Healey,et al.  Markov Random Field Models for Unsupervised Segmentation of Textured Color Images , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  L. R. Rabiner,et al.  A probabilistic distance measure for hidden Markov models , 1985, AT&T Technical Journal.

[9]  Timothy F. Cootes,et al.  Active Appearance Models , 1998, ECCV.

[10]  Petros G. Voulgaris,et al.  On optimal ℓ∞ to ℓ∞ filtering , 1995, Autom..

[11]  Geoffrey E. Hinton,et al.  Switching State-Space Models , 1996 .

[12]  Jun Zhang,et al.  Cluster validation for unsupervised stochastic model-based image segmentation , 1998, IEEE Trans. Image Process..

[13]  Bjarne K. Ersbøll,et al.  FAME-a flexible appearance modeling environment , 2003, IEEE Transactions on Medical Imaging.

[14]  Bernd Neumann,et al.  Computer Vision — ECCV’98 , 1998, Lecture Notes in Computer Science.

[15]  Vladimir Pavlovic,et al.  Learning Switching Linear Models of Human Motion , 2000, NIPS.