The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Topology free hidden Markov models: application to background modeling
Abstract
Hidden Markov models (HMMs) are increasingly being used in computer vision for applications such as: gesture analysis, action recognition from video, and illumination modeling. Their use involves an off-line learning step that is used as a basis for on-line decision making (i.e. a stationarity assumption on the model parameters). But, real-world applications are often non-stationary in nature. This leads to the need for a dynamic mechanism to learn and update the model topology as well as its parameters. This paper presents a new framework for HMM topology and parameter estimation in an online, dynamic fashion. The topology and parameter estimation is posed as a model selection problem with an MDL prior. Online modifications to the topology are made possible by incorporating a state splitting criterion. To demonstrate the potential of the algorithm, the background modeling problem is considered. Theoretical validation and real experiments are presented.
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 New Approach to Linear Filtering and Prediction Problems
Kalman, R. E. (1960) · Journal of Basic Engineering · doi:10.1115/1.3662552 · Cited by 31,751
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
A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants
Neal, R. M., & Hinton, G. E. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_12 · Cited by 2,187
Model Selection Via Multifold Cross Validation
Zhang, P. (1993) · The Annals of Statistics · doi:10.1214/aos/1176349027 · Cited by 539
Cited by
Yilmaz, A., Javed, O., & Shah, M. (2006) · ACM Computing Surveys · doi:10.1145/1177352.1177355 · Cited by 4,792
Image change detection algorithms: a systematic survey
Radke, R. J., Andra, S., Al-Kofahi, O., & Roysam, B. (2005) · IEEE Transactions on Image Processing · doi:10.1109/tip.2004.838698 · Cited by 1,869
Efficient adaptive density estimation per image pixel for the task of background subtraction
Zivkovic, Z., & van der Heijden, F. (2006) · Pattern Recognition Letters · doi:10.1016/j.patrec.2005.11.005 · Cited by 1,557
Elgammal, A., Duraiswami, R., Harwood, D., & Davis, L. S. (2002) · Proceedings of the IEEE · doi:10.1109/jproc.2002.801448 · Cited by 1,508
Bayesian modeling of dynamic scenes for object detection
Sheikh, Y., & Shah, M. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.213 · Cited by 637
Metadata
- Authors
- Stenger, B., Ramesh, V., Paragios, N., Coetzee, F., & Buhmann, J. M.
- Venue
- Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-13
- Volume
- 1
- Pages
- 294-301
- OpenAlex
- W2110110767
- Cited by
- 208
- References
- 4
- FWCI
- 7.24
- 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: Topology free hidden Markov models: application to background modeling. https://app.cochat.ai/papers/10.1109/iccv.2001.937532
- The paper
- Stenger, B., Ramesh, V., Paragios, N., Coetzee, F., & Buhmann, J. M. (2002). Topology free hidden Markov models: application to background modeling. Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001. https://doi.org/10.1109/iccv.2001.937532
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.