loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04) - Volume 2
Propagation Networks for Recognition of Partially Ordered Sequential Action
Washington, D.C., USA
June 27-July 02
ISBN: 0-7695-2158-4
Yifan Shi, Georgia Institute of Technology
Yan Huang, Georgia Institute of Technology
David Minnen, Georgia Institute of Technology
Aaron Bobick, Georgia Institute of Technology
Irfan Essa, Georgia Institute of Technology
We present Propagation Networks (P-Nets), a novel approach for representing and recognizing sequential activities that include parallel streams of action. We represent each activity using partially ordered intervals. Each interval is restricted by both temporal and logical constraints, including information about its duration and its temporal relationship with other intervals. P-Nets associate one node with each temporal interval. Each node is triggered according to a probability density function that depends on the state of its parent nodes. Each node also has an associated observation function that characterizes supporting perceptual evidence. To facilitate realtime analysis, we introduce a particle filter framework to explore the conditional state space. We modify the original Condensation algorithm to more efficiently sample a discrete state space (D-Condensation). Experiments in the domain of blood glucose monitor calibration demonstrate both the representational power of P-Nets and the effectiveness of the D-Condensation algorithm.
Citation:
Yifan Shi, Yan Huang, David Minnen, Aaron Bobick, Irfan Essa, "Propagation Networks for Recognition of Partially Ordered Sequential Action," cvpr, vol. 2, pp.862-869, 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04) - Volume 2, 2004
Usage of this product signifies your acceptance of the Terms of Use.