Event detection based on a pedestrian interaction graph using hidden Markov models

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we present a new approach for event detection of pedestrian interaction in crowded and cluttered scenes. Existing work is focused on the detection of an abnormal event in general or on the detection of specific simple events incorporating only up to two trajectories. In our approach, event detection in large groups of pedestrians is performed by exploiting motion interaction between pairs of pedestrians in a graph-based framework. Event detection is done by analyzing the temporal behaviour of the motion interaction with Hidden Markov Models (HMM). In addition, temporarily unsteady edges in the graph can be compensated by a HMM buffer which internally continues the HMM analysis even if the representing pedestrians depart from each other awhile. Experimental results show the capability of our graph-based approach for event detection by means of an image sequence in which pedestrians approach a soccer stadium. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Burkert, F., & Butenuth, M. (2011). Event detection based on a pedestrian interaction graph using hidden Markov models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6952 LNCS, pp. 271–283). https://doi.org/10.1007/978-3-642-24393-6_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free