ACM Home Page
Please provide us with feedback. Feedback
Conditional random fields for activity recognition
Full text PdfPdf (331 KB)
Source
International Conference on Autonomous Agents archive
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems table of contents
Honolulu, Hawaii
SESSION: Agent learning, evolution, and adaptation: full papers table of contents
Article No. 235  
Year of Publication: 2007
ISBN:978-81-904262-7-5
Authors
Douglas L. Vail  Carnegie Mellon University, Pittsburgh, Pennsylvania
Manuela M. Veloso  Carnegie Mellon University, Pittsburgh, Pennsylvania
John D. Lafferty  Carnegie Mellon University, Pittsburgh, Pennsylvania
Sponsor
: IFAAMAS
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 149,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1329125.1329409
What is a DOI?

ABSTRACT

Activity recognition is a key component for creating intelligent, multi-agent systems. Intrinsically, activity recognition is a temporal classification problem. In this paper, we compare two models for temporal classification: hidden Markov models (HMMs), which have long been applied to the activity recognition problem, and conditional random fields (CRFs). CRFs are discriminative models for labeling sequences. They condition on the entire observation sequence, which avoids the need for independence assumptions between observations. Conditioning on the observations vastly expands the set of features that can be incorporated into the model without violating its assumptions. Using data from a simulated robot tag domain, chosen because it is multi-agent and produces complex interactions between observations, we explore the differences in performance between the discriminatively trained CRF and the generative HMM. Additionally, we examine the effect of incorporating features which violate independence assumptions between observations; such features are typically necessary for high classification accuracy. We find that the discriminatively trained CRF performs as well as or better than an HMM even when the model features do not violate the independence assumptions of the HMM. In cases where features depend on observations from many time steps, we confirm that CRFs are robust against any degradation in performance.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. Hammersley and P. Clifford. Markov fields on finite graphs and lattices, 1971.
 
2
K. Han and M. Veloso. Automated robot behavior recognition applied to robotic soccer. In J. Hollerbach and D. Koditschek, editors, Robotics Research: the Ninth International Symposium, pages 199--204. Springer-Verlag, London, 2000.
 
3
 
4
 
5
 
6
L. Liao, D. Fox, and H. Kautz. Hierarchical Conditional Random Fields for GPS-based activity recognition. In Proc. of the International Symposium of Robotis Research (ISRR 2005). Springer Verlag, 2005.
 
7
 
8
A. Y. Ng and M. I. Jordan. On discriminative vs. generative classifiers: A comparison of logistic regression and naive bayes. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, pages 841--848, Cambridge, MA, 2002. MIT Press.
 
9
L. Rabiner. A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE, 77(2):257--286, February 1989.
10
 
11
P. Rybski and M. Veloso. Using sparse visual data to model human activities in meetings. In Modeling Other Agents from Observations Workshop (MOO 2004), 2004.
 
12
 
13
14
 
15
C. Sutton and A. McCallum. An introduction to conditional random fields for relational learning. In L. Getoor and B. Taskar, editors, Introduction to Statistical Relational Learning. MIT Press, 2006. To appear.
 
16
H. Wallach. Efficient training of conditional random fields. Master's thesis, University of Edinburgh, 2002.


Collaborative Colleagues:
Douglas L. Vail: colleagues
Manuela M. Veloso: colleagues
John D. Lafferty: colleagues