The Recognition of Human Movement Using Temporal Templates
IEEE Transactions on Pattern Analysis and Machine Intelligence
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Recognizing Human Actions: A Local SVM Approach
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03
One-Shot Learning of Object Categories
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hidden Conditional Random Fields
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Unsupervised Learning of Human Action Categories Using Spatial-Temporal Words
International Journal of Computer Vision
Expert Systems with Applications: An International Journal
Action categorization with modified hidden conditional random field
Pattern Recognition
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on human computing
Learning atomic human actions using variable-length Markov models
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on human computing
One video is sufficient? Human activity recognition using active video composition
WACV '11 Proceedings of the 2011 IEEE Workshop on Applications of Computer Vision (WACV)
Action Recognition from One Example
IEEE Transactions on Pattern Analysis and Machine Intelligence
Human behavior understanding for inducing behavioral change: application perspectives
HBU'11 Proceedings of the Second international conference on Human Behavior Unterstanding
Hi-index | 0.00 |
In this paper we address the problem of human action recognition from a single training sequence per class using a modified version of the Hidden Markov Model. Inspired by codebook approaches in object and scene categorization, we first construct a codebook of possible discrete observations by applying a clustering algorithm to all samples from all classes. The number of clusters defines the size of the codebook. Given a new observation, we assign to it a probability to belong to every cluster, i.e., to correspond to a discrete value of the codebook. In this sense, we change the ‘winner takes all' rule in the discrete-observation HMM for a distributed probability of membership. It implies the modification of the Baum-Welch algorithm for training discrete HMM to be able to deal with fuzzy observations. We compare our approach with other models such as, dynamic time warping (DTW), continuous-observation HMM, Conditional Random Fields (CRF) and Hidden Conditional Random Fields (HCRF) for human action recognition.