The DOI matches its Crossref record.
A unified mixture framework for motion segmentation: incorporating spatial coherence and estimating the number of models
Abstract
Describing a video sequence in terms of a small number of coherently moving segments is useful for tasks ranging from video compression to event perception. A promising approach is to view the motion segmentation problem in a mixture estimation framework. However, existing formulations generally use only the motion, data and thus fail to make use of static cues when segmenting the sequence. Furthermore, the number of models is either specified in advance or estimated outside the mixture model framework. In this work we address both of these issues. We show how to add spatial constraints to the mixture formulations and present a variant of the EM algorithm that males use of both the form and the motion constraints. Moreover this algorithm estimates the number of segments given knowledge about the level of model failure expected in the sequence. The algorithm's performance is illustrated on synthetic and real image sequences.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
Fast Feature Pyramids for Object Detection
Dollar, P., Appel, R., Belongie, S., & Perona, P. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2300479 · Cited by 1,955
Blobworld: image segmentation using expectation-maximization and its application to image querying
Carson, C., Belongie, S., Greenspan, H., & Malik, J. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1023800 · Cited by 1,410
Spectral grouping using the nystrom method
Fowlkes, C., Belongie, S., Chung, F., & Malik, J. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262185 · Cited by 1,328
Image Segmentation in Video Sequences: A Probabilistic Approach
Friedman, N., & Russell, S. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.1539 · Cited by 833
Learning and recognizing human dynamics in video sequences
Bregler, C. (2002) · Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1997.609382 · Cited by 621
Belongie, S., Carson, C., Greenspan, H., & Malik, J. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710790 · Cited by 474
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.791245 · Cited by 470
Fleet, D., & Weiss, Y. (2005) · Handbook of Mathematical Models in Computer Vision · doi:10.1007/0-387-28831-7_15 · Cited by 372
Self-citationExtraction of 2D motion trajectories and its application to hand gesture recognition
Yang, M.-H., Ahuja, N., & Tabb, M. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1023803 · Cited by 353
Motion segmentation and tracking using normalized cuts
Shi, J., & Malik, J. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710861 · Cited by 336
Object tracking with Bayesian estimation of dynamic layer representations
Tao, H., Sawhney, H. S., & Kumar, R. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.982885 · Cited by 295
On the Binding Problem in Artificial Neural Networks
Greff, K., van Steenkiste, S., & Schmidhuber, J. (2020) · arXiv · doi:10.48550/arxiv.2012.05208 · Cited by 102
Metadata
- Authors
- Weiss, Y., & Adelson, E. H.
- Venue
- Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 1996
- Pages
- 321-326
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2099330788
- Cited by
- 230
- References
- 0
- FWCI
- 9.96
- 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
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.