Recognizing multitasked activities from video using stochastic context-free grammar
Eighteenth national conference on Artificial intelligence
Extraction of social context and application to personal multimedia exploration
MULTIMEDIA '06 Proceedings of the 14th annual ACM international conference on Multimedia
Learning and inferring transportation routines
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
High-level goal recognition in a wireless LAN
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Policy recognition in the abstract hidden Markov model
Journal of Artificial Intelligence Research
Location-based activity recognition using relational Markov networks
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Propagation networks for recognition of partially ordered sequential action
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Simultaneous tracking and activity recognition (STAR) using many anonymous, binary sensors
PERVASIVE'05 Proceedings of the Third international conference on Pervasive Computing
Human activity encoding and recognition using low-level visual features
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A top-level ontology for smart environments
Pervasive and Mobile Computing
Hi-index | 0.00 |
Permutation modeling is challenging because of the combinatorial nature of the problem. However, such modeling is often required in many real-world applications, including activity recognition where subactivities are often permuted and partially ordered. This paper introduces a novel Hidden Permutation Model (HPM) that can learn the partial ordering constraints in permuted state sequences. The HPM is parameterized as an exponential family distribution and is flexible so that it can encode constraints via different feature functions. A chain-flipping Metropolis-Hastings Markov chain Monte Carlo (MCMC) is employed for inference to overcome the O(n!) complexity. Gradient-based maximum likelihood parameter learning is presented for two cases when the permutation is known and when it is hidden. The HPM is evaluated using both simulated and real data from a location-based activity recognition domain. Experimental results indicate that the HPM performs far better than other baseline models, including the naive Bayes classifier, the HMM classifier, and Kirshner's multinomial permutation model. Our presented HPM is generic and can potentially be utilized in any problem where the modeling of permuted states from noisy data is needed.