Activity group localization by modeling the relations among participants

4Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Beyond recognizing the actions of individuals, activity group localization aims to determine ''who participates in each group'' and ''what activity the group performs''. In this paper, we propose a latent graphical model to group participants while inferring each group's activity by exploring the relations among them, thus simultaneously addressing the problems of group localization and activity recognition. Our key insight is to exploit the relational graph among the participants. Specifically, each group is represented as a tree with an activity label while relations among groups are modeled as a fully connected graph. Inference of such a graph is reduced into an extended minimum spanning forest problem, which is casted into a max-margin framework. It therefore avoids the limitation of high-ordered hierarchical model and can be solved efficiently. Our model is able to provide strong and discriminative contextual cues for activity recognition and to better interpret scene information for localization. Experiments on three datasets demonstrate that our model achieves significant improvements in activity group. localization and state-of-the-arts performance on activity recognition. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Sun, L., Ai, H., & Lao, S. (2014). Activity group localization by modeling the relations among participants. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8689 LNCS, pp. 741–755). Springer Verlag. https://doi.org/10.1007/978-3-319-10590-1_48

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