Title :
Minimum-entropy models of scene activity
Author :
Kettnaker, Vera ; Brand, Matthew
Author_Institution :
Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
Abstract :
We show how to learn a concise, interpretable model of scene activity directly from optical flow. The model represents the principal routes and modes of movement in complex scenes such as pedestrian plazas and traffic intersections, and supports a variety of inferences about the observed activities, including annotation, prediction, and anomaly detection. The model takes the form of a novel hidden Markov model generalization that observes a variable number of datapoints per frame (time step). A monotonic entropy-optimizing algorithm determines the parameters and structure of this model, exploiting the duality between learning and compression to produce highly predictive and interpretable models. This approach discovers minimal models of coherent motions and their switching dynamics-without tracking or prior knowledge about the spatial or temporal structure of the scene
Keywords :
hidden Markov models; image sequences; minimum entropy methods; annotation; complex scenes; datapoints; duality; hidden Markov model generalization; interpretable model; minimum-entropy models; monotonic entropy-optimizing algorithm; optical flow; pedestrian plazas; scene activity; switching dynamics; traffic intersections; Computer science; Computerized monitoring; Hidden Markov models; Inference algorithms; Layout; Machine vision; Predictive models; Rhythm; Surveillance; Tracking;
Conference_Titel :
Computer Vision and Pattern Recognition, 1999. IEEE Computer Society Conference on.
Conference_Location :
Fort Collins, CO
Print_ISBN :
0-7695-0149-4
DOI :
10.1109/CVPR.1999.786952