Group action induced distances for averaging and clustering Linear Dynamical Systems with applications to the analysis of dynamic scenes

We introduce a framework for defining a distance on the (non-Euclidean) space of Linear Dynamical Systems (LDSs). The proposed distance is induced by the action of the group of orthogonal matrices on the space of statespace realizations of LDSs. This distance can be efficiently computed for large-sc...

Full description

Saved in:
Bibliographic Details
Main Authors: Afsari, B., Chaudhry, R., Ravichandran, A., Vidal, R.
Format: Conference Proceeding
Language:English
Subjects:
Computational modeling
Manifolds
Measurement
Observability
Stochastic processes
Training data
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We introduce a framework for defining a distance on the (non-Euclidean) space of Linear Dynamical Systems (LDSs). The proposed distance is induced by the action of the group of orthogonal matrices on the space of statespace realizations of LDSs. This distance can be efficiently computed for large-scale problems, hence it is suitable for applications in the analysis of dynamic visual scenes and other high dimensional time series. Based on this distance we devise a simple LDS averaging algorithm, which can be used for classification and clustering of time-series data. We test the validity as well as the performance of our group-action based distance on synthetic as well as real data and provide comparison with state-of-the-art methods.
ISSN:1063-6919
DOI:10.1109/CVPR.2012.6247929