loading...
AdaBoost.MRF: Boosted Markov Random Forests and Application to Multilevel Activity Recognition
New York, NY June 17-June 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CVPR.2006.492006 IEEE Computer Society Conference ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Tran The Truyen, Curtin University of Technology
Dinh Q. Phung, Curtin University of Technology
Svetha Venkatesh, Curtin University of Technology
Hung H. Bui, Artificial Intelligence Center, SRI International, Menlo Park, CA
Activity recognition is an important issue in building intelligent monitoring systems. We address the recognition of multilevel activities in this paper via a conditional Markov random field (MRF), known as the dynamic conditional random field (DCRF). Parameter estimation in general MRFs using maximum likelihood is known to be computationally challenging (except for extreme cases), and thus we propose an efficient boosting-based algorithm AdaBoost.MRF for this task. Distinct from most existing work, our algorithm can handle hidden variables (missing labels) and is particularly attractive for smarthouse domains where reliable labels are often sparsely observed. Furthermore, our method works exclusively on trees and thus is guaranteed to converge. We apply the AdaBoost.MRF algorithmto a home video surveillance application and demonstrate its efficacy.
Citation:
Tran The Truyen, Dinh Q. Phung, Svetha Venkatesh, Hung H. Bui, "AdaBoost.MRF: Boosted Markov Random Forests and Application to Multilevel Activity Recognition," cvpr, vol. 2, pp.1686-1693, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (CVPR'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions