The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Learning and Detecting Activities from Movement Trajectories Using the Hierarchical Hidden Markov Models
Abstract
Directly modeling the inherent hierarchy and shared structures of human behaviors, we present an application of the hierarchical hidden Markov model (HHMM) for the problem of activity recognition. We argue that to robustly model and recognize complex human activities, it is crucial to exploit both the natural hierarchical decomposition and shared semantics embedded in the movement trajectories. To this end, we propose the use of the HHMM, a rich stochastic model that has been recently extended to handle shared structures, for representing and recognizing a set of complex indoor activities. Furthermore, in the need of real-time recognition, we propose a Rao-Blackwellised particle filter (RBPF) that efficiently computes the filtering distribution at a constant time complexity for each new observation arrival. The main contributions of this paper lie in the application of the shared-structure HHMM, the estimation of the model's parameters at all levels simultaneously, and a construction of an RBPF approximate inference scheme. The experimental results in a real-world environment have confirmed our belief that directly modeling shared structures not only reduces computational cost, but also improves recognition accuracy when compared with the tree HHMM and the flat HMM.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The hierarchical hidden Markov model: Analysis and applications
Fine, S., Singer, Y., & Tishby, N. (1998) · Machine Learning · doi:10.1023/a:1007469218079 · Cited by 906
Policy Recognition in the Abstract Hidden Markov Model
Bui, H. H., Venkatesh, S., & West, G. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.839 · Cited by 123
Self-citation
Research works printed but not linked: 17
- 10.1080/01621459.1990.10474930 · DOI · Paper page
- 10.1109/34.655650 · DOI
- 10.1109/5.18626 · DOI · Paper page
- 10.1109/34.868684 · DOI · Paper page
- 10.1109/IROS.2004.1389465 · DOI
- nguyen, 2003, Recognising and monitoring high-level behaviours in complex spatial environments, IEEE Conference on Computer Vision and Pattern Recognition
- 10.1109/ICMI.2002.1166960 · DOI · Paper page
- 10.1109/34.868686 · DOI · Paper page
- 10.1016/j.artint.2007.01.006 · DOI · Paper page
- bui, 2004, Hierarchical hidden Markov models with general state hierarchy, Proceedings of The Nineteenth National Conference on Artificial Intelligence, 324
- bui, 2003, A general model for online probabilistic plan recognition, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI-03)
- 10.1016/S0262-8856(01)00047-6 · DOI
- grimson, 1998, VSAM
- doucet, 2000, Rao-Blackwellised particle filtering for dynamic Bayesian networks, Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence
- collins, 2000, A system for video surveillance and monitoring
- cielniak, 2003, Where is ...? Learning and utilizing motion patterns of persons with mobile robots, The Eighteenth International Joint Conference on Artificial Intelligence, 909
- 10.1006/cviu.2000.0894 · DOI · Paper page
Cited by
Qiu, S., Zhao, H., Jiang, N., Wang, Z., Liu, L., An, Y., Zhao, H., Miao, X., Liu, R., & Fortino, G. (2022) · Information Fusion · doi:10.1016/j.inffus.2021.11.006 · Cited by 671
Conditional random fields for activity recognition
Vail, D. L., Veloso, M. M., & Lafferty, J. D. (2007) · Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems · doi:10.1145/1329125.1329409 · Cited by 357
Hoey, J., Poupart, P., Bertoldi, A. V., Craig, T., Boutilier, C., & Mihailidis, A. (2010) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2009.06.008 · Cited by 229
Understanding human intentions via hidden markov models in autonomous mobile robots
Kelley, R., Tavakkoli, A., King, C., Nicolescu, M., Nicolescu, M., & Bebis, G. (2008) · Proceedings of the 3rd ACM/IEEE international conference on Human robot interaction · doi:10.1145/1349822.1349870 · Cited by 181
A daily behavior enabled hidden Markov model for human behavior understanding
Chung, P.-C., & Liu, C.-D. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2007.10.022 · Cited by 130
Metadata
- Authors
- Nguyen, N. T., Phung, D. Q., Venkatesh, S., & Bui, H.
- Venue
- 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05)
- Publisher
- IEEE
- Published
- 2005-07-27
- Volume
- 2
- Pages
- 955-960
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2161874168
- Cited by
- 303
- References
- 2
- FWCI
- 10.16
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Learning and Detecting Activities from Movement Trajectories Using the Hierarchical Hidden Markov Models. https://app.cochat.ai/papers/10.1109/cvpr.2005.203
- The paper
- Nguyen, N. T., Phung, D. Q., Venkatesh, S., & Bui, H. (2005). Learning and Detecting Activities from Movement Trajectories Using the Hierarchical Hidden Markov Models. 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05). https://doi.org/10.1109/cvpr.2005.203
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.