A novel sequence representation for unsupervised analysis of human activities

被引:64
作者
Hamid, Raffay [1 ]
Maddi, Siddhartha [1 ]
Johnson, Amos [1 ]
Bobick, Aaron [1 ]
Essa, Irfan [1 ]
Isbell, Charles [1 ]
机构
[1] Georgia Inst Technol, Coll Comp, Atlanta, GA 30332 USA
关键词
Temporal reasoning; Scene analysis; Computer vision; PROBABILISTIC-AUTOMATA; TIME; SPACE;
D O I
10.1016/j.artint.2009.05.002
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Formalizing computational models for everyday human activities remains an open challenge. Many previous approaches towards this end assume prior knowledge about the structure of activities, using which explicitly defined models are learned in a completely supervised manner. For a majority of everyday environments however, the structure of the in situ activities is generally not known a priori. In this paper we investigate knowledge representations and manipulation techniques that facilitate learning of human activities in a minimally supervised manner. The key contribution of this work is the idea that global structural information of human activities can be encoded using a subset of their local event subsequences, and that this encoding is sufficient for activity-class discovery and classification. In particular, we investigate modeling activity sequences in terms of their constituent subsequences that we call event n-grams. Exploiting this representation, we propose a computational framework to automatically discover the various activity-classes taking place in an environment. We model these activity-classes as maximally similar activity-cliques in a completely connected graph of activities, and describe how to discover them efficiently. Moreover, we propose methods for finding characterizations of these discovered classes from a holistic as well as a by-parts perspective. Using such characterizations, we present a method to classify a new activity to one of the discovered activity-classes, and to automatically detect whether it is anomalous with respect to the general characteristics of its membership class. Our results show the efficacy of our approach in a variety of everyday environments. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:1221 / 1244
页数:24
相关论文
共 48 条
[1]  
[Anonymous], 1971, The SMART Retrieval System-Experiments in Automatic Document Processing
[2]  
[Anonymous], 1997, ACM SIGACT NEWS
[3]   Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space [J].
Apostolico, A ;
Bejerano, G .
JOURNAL OF COMPUTATIONAL BIOLOGY, 2000, 7 (3-4) :381-393
[4]   AN ANALYSIS OF SOME GRAPH THEORETICAL CLUSTER TECHNIQUES [J].
AUGUSTSO.JG ;
MINKER, J .
JOURNAL OF THE ACM, 1970, 17 (04) :571-&
[5]  
Bailey T L, 1994, Proc Int Conf Intell Syst Mol Biol, V2, P28
[6]  
BEJERANO G, 1999, P INT C RES COMP MOL
[7]  
BOBICK A., 1996, VISMOD
[8]  
BOBICK A., 1997, MOVEMENT ACTIVITY AC
[9]  
Brand M., 1997, IEEE C COMP VIS PATT
[10]  
CALDERARA S, 2007, IEEE INT C ADV VID S