Million-scale near-duplicate video retrieval system
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
In this paper, we present a novel near-duplicate video retrieval system serving one million web videos. To achieve both the effectiveness and efficiency, a visual word based approach is proposed, which quantizes each video frame into a word and represents the whole video as a bag of words. The system can respond to a query in 41ms with 78.4% MAP on average.
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
Cites
FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION
(2009) · Proceedings of the Fourth International Conference on Computer Vision Theory and Applications · doi:10.5220/0001787803310340 · Cited by 2,640 · cited 1×
“In this demo, a scalable Kmeans clustering algorithm [2] and the Kmeans tree search algorithm [3] are used to speed up the codebook construction and quantization.”
MethodMultiple feature hashing for real-time large scale near-duplicate video retrieval
Song, J., Yang, Y., Huang, Z., Shen, H. T., & Hong, R. (2011) · Proceedings of the 19th ACM international conference on Multimedia · doi:10.1145/2072298.2072354 · Cited by 334 · cited 8×
“Figure 2: The performance comparison of ST lbp [4] and ours in terms of precision-recall.”
BackgroundMethodInfluential
Cited by
Near-Duplicate Video Retrieval by Aggregating Intermediate CNN Layers
Kordopatis-Zilos, G., Papadopoulos, S., Patras, I., & Kompatsiaris, Y. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-51811-4_21 · Cited by 83
“[2] used uniform sampling to extract one frame per second for the input video.”
MethodFIVR: Fine-Grained Incident Video Retrieval
Kordopatis-Zilos, G., Papadopoulos, S., Patras, I., & Kompatsiaris, I. (2019) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2019.2905741 · Cited by 79
“• Hand-crafted Features: We experiment with four widely used hand-crafted features in the literature: HSV histograms, LBP [51], ACC [18] and VLAD-SURF [19].”
BackgroundMethodInfluentialAttention-Based Deep Metric Learning for Near-Duplicate Video Retrieval
Wang, K.-H., Cheng, C.-C., Chen, Y.-L., Song, Y., & Lai, S.-H. (2021) · 2020 25th International Conference on Pattern Recognition (ICPR) · doi:10.1109/icpr48806.2021.9412710 · Cited by 19
“We compare with five feature aggregation baselines to compute the similarity: Global Vectors (GV) [11], Bag-of-Words (BoW) [20], Layered Bag-of-Words (LBoW) [4], Deep Metric Learning (DML) [24] and Hashing Codes (HC) [6].”
MethodInfluential
Metadata
- Authors
- Cai, Y., Yang, L., Ping, W., Wang, F., Mei, T., Hua, X.-S., & Li, S.
- Venue
- Proceedings of the 19th ACM international conference on Multimedia
- Publisher
- ACM
- Published
- 2011-11-28
- Pages
- 837-838
- OpenAlex
- W2119062120
- Cited by
- 53
- References
- 2
- FWCI
- 1.43
- 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: Million-scale near-duplicate video retrieval system. https://app.cochat.ai/papers/10.1145/2072298.2072484
- The paper
- Cai, Y., Yang, L., Ping, W., Wang, F., Mei, T., Hua, X.-S., & Li, S. (2011). Million-scale near-duplicate video retrieval system. Proceedings of the 19th ACM international conference on Multimedia. https://doi.org/10.1145/2072298.2072484
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.