The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Discovering clusters in motion time-series data
Abstract
An approach is proposed for clustering time-series data. The approach can be used to discover groupings of similar object motions that were observed in a video collection. A finite mixture of hidden Markov models (HMMs) is fitted to the motion data using the expectation maximization (EM) framework. Previous approaches for HMM-based clustering employ a k-means formulation, where each sequence is assigned to only a single HMM. In contrast, the formulation presented in this paper allows each sequence to belong to more than a single HMM with some probability, and the hard decision about the sequence class membership can be deferred until a later time when such a decision is required. Experiments with simulated data demonstrate the benefit of using this EM-based approach when there is more "overlap" in the processes generating the data. Experiments with real data show the promising potential of HMM-based motion clustering in a number of applications.
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
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Cited by
Time-series clustering – A decade review
Aghabozorgi, S., Seyed Shirkhorshidi, A., & Ying Wah, T. (2015) · Information Systems · doi:10.1016/j.is.2015.04.007 · Cited by 1,826
A survey of temporal data mining
Laxman, S., & Sastry, P. S. (2006) · Sadhana · doi:10.1007/bf02719780 · Cited by 314
A PCA-based similarity measure for multivariate time series
Yang, K., & Shahabi, C. (2004) · Proceedings of the 2nd ACM international workshop on Multimedia databases · doi:10.1145/1032604.1032616 · Cited by 276
Clustering of Vehicle Trajectories
Atev, S., Miller, G., & Papanikolopoulos, N. P. (2010) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2010.2048101 · Cited by 257
Metadata
- Authors
- Alon, J., Sclaroff, S., Kollios, G., & Pavlovic, V.
- Venue
- 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings.
- Publisher
- IEEE Comput. Soc
- Published
- 2003-11-21
- Pages
- I-375-I-381
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2109328551
- Cited by
- 185
- References
- 1
- FWCI
- 9.08
- 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: Discovering clusters in motion time-series data. https://app.cochat.ai/papers/10.1109/cvpr.2003.1211378
- The paper
- Alon, J., Sclaroff, S., Kollios, G., & Pavlovic, V. (2003). Discovering clusters in motion time-series data. 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. https://doi.org/10.1109/cvpr.2003.1211378
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.