The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Efficient hierarchical graph-based video segmentation
Abstract
We present an efficient and scalable technique for spatiotemporal segmentation of long video sequences using a hierarchical graph-based algorithm. We begin by over-segmenting a volumetric video graph into space-time regions grouped by appearance. We then construct a “region graph” over the obtained segmentation and iteratively repeat this process over multiple levels to create a tree of spatio-temporal segmentations. This hierarchical approach generates high quality segmentations, which are temporally coherent with stable region boundaries, and allows subsequent applications to choose from varying levels of granularity. We further improve segmentation quality by using dense optical flow to guide temporal connections in the initial graph. We also propose two novel approaches to improve the scalability of our technique: (a) a parallel out-of-core algorithm that can process volumes much larger than an in-core algorithm, and (b) a clip-based processing algorithm that divides the video into overlapping clips in time, and segments them successively while enforcing consistency. We demonstrate hierarchical segmentations on video shots as long as 40 seconds, and even support a streaming mode for arbitrarily long videos, albeit without the ability to process them hierarchically.
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
Mean shift: a robust approach toward feature space analysis
Comaniciu, D., & Meer, P. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.1000236 · Cited by 11,305
Efficient Graph-Based Image Segmentation
Felzenszwalb, P. F., & Huttenlocher, D. P. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000022288.19776.77 · Cited by 6,176
Graph Cuts and Efficient N-D Image Segmentation
Boykov, Y., & Funka-Lea, G. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-7934-5 · Cited by 1,910
Representing moving images with layers
Wang, J. Y. A., & Adelson, E. H. (1994) · IEEE Transactions on Image Processing · doi:10.1109/83.334981 · Cited by 1,090
Winnemöller, H., Olsen, S. C., & Gooch, B. (2006) · ACM Transactions on Graphics · doi:10.1145/1141911.1142018 · Cited by 533
Real-time edge-aware image processing with the bilateral grid
Chen, J., Paris, S., & Durand, F. (2007) · ACM SIGGRAPH 2007 papers · doi:10.1145/1275808.1276506 · Cited by 394
Video SnapCut: robust video object cutout using localized classifiers
Bai, X., Wang, J., Simons, D., & Sapiro, G. (2009) · ACM Transactions on Graphics · doi:10.1145/1531326.1531376 · Cited by 367
Anisotropic Huber-L1 Optical Flow
Werlberger, M., Trobin, W., Pock, T., Wedel, A., Cremers, D., & Bischof, H. (2009) · Procedings of the British Machine Vision Conference 2009 · doi:10.5244/c.23.108 · Cited by 354
Li, Y., Sun, J., & Shum, H.-Y. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073234 · Cited by 286
Fast multiscale image segmentation
Sharon, E., Brandt, A., & Basri, R. (2002) · Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662) · doi:10.1109/cvpr.2000.855801 · Cited by 253
Wang, J., Xu, Y., Shum, H.-Y., & Cohen, M. F. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015763 · Cited by 214
]Video object segmentation by hypergraph cut
Huang, Y., Liu, Q., & Metaxas, D. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206795 · Cited by 209
LIVEcut: Learning-based interactive video segmentation by evaluation of multiple propagated cues
Price, B. L., Morse, B. S., & Cohen, S. D. (2009) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2009.5459293 · Cited by 158
Consistent segmentation for optical flow estimation
Zitnick, C. W., Jojić, N., & Kang, S. B. (2005) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2005.61 · Cited by 130
Edge-Preserving Smoothing and Mean-Shift Segmentation of Video Streams
Paris, S. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88688-4_34 · Cited by 98
Li, Y., Sun, J. Z., & Shum, H. (2005) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/1186822.1073234 · Cited by 84
Fast Mean Shift by compact density representation
Freedman, D., & Kisilev, P. (2009) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2009.5206716 · Cited by 48
]Video object segmentation by hypergraph cut
Huang, Y., Liu, Q., & Metaxas, D. (2009) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvprw.2009.5206795 · Cited by 42
Cited by
A Benchmark Dataset and Evaluation Methodology for Video Object Segmentation
Perazzi, F., Pont-Tuset, J., McWilliams, B., Van Gool, L., Gross, M., & Sorkine-Hornung, A. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.85 · Cited by 1,989
Advances in Computer Vision-Based Civil Infrastructure Inspection and Monitoring
Spencer, B. F., Hoskere, V., & Narazaki, Y. (2019) · Engineering · doi:10.1016/j.eng.2018.11.030 · Cited by 1,282
One-Shot Video Object Segmentation
Caelles, S., Maninis, K.-K., Pont-Tuset, J., Leal-Taixe, L., Cremers, D., & Van Gool, L. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.565 · Cited by 927
Adversarial Attacks and Defenses in Deep Learning
Ren, K., Zheng, T., Qin, Z., & Liu, X. (2020) · Engineering · doi:10.1016/j.eng.2019.12.012 · Cited by 678
Segmentation of Moving Objects by Long Term Video Analysis
Ochs, P., Malik, J., & Brox, T. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.242 · Cited by 585
Metadata
- Authors
- Grundmann, M., Kwatra, V., Han, M., & Essa, I.
- Venue
- 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2010-06
- Pages
- 2141-2148
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2030346542
- Cited by
- 628
- References
- 18
- FWCI
- 30.51
- 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.