Multiple feature hashing for real-time large scale near-duplicate video retrieval
Abstract
Near-duplicate video retrieval (NDVR) has recently attracted lots of research attention due to the exponential growth of online videos. It helps in many areas, such as copyright protection, video tagging, online video usage monitoring, etc. Most of existing approaches use only a single feature to represent a video for NDVR. However, a single feature is often insufficient to characterize the video content. Besides, while the accuracy is the main concern in previous literatures, the scalability of NDVR algorithms for large scale video datasets has been rarely addressed. In this paper, we present a novel approach - Multiple Feature Hashing (MFH) to tackle both the accuracy and the scalability issues of NDVR. MFH preserves the local structure information of each individual feature and also globally consider the local structures for all the features to learn a group of hash functions which map the video keyframes into the Hamming space and generate a series of binary codes to represent the video dataset. We evaluate our approach on a public video dataset and a large scale video dataset consisting of 132,647 videos, which was collected from YouTube by ourselves. The experiment results show that the proposed method outperforms the state-of-the-art techniques in both accuracy and efficiency.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The labels in CC Web and UQ Video are only available on video-level, without timestamps of the copied segments.
“the labels in the datasets are only available on video-level, indicating whether or not two videos are copies of each other without the timestamps of the copied segments”
From VCDB: A Large-Scale Database for Partial Copy Detection in Videos (2014) · cites this paper as [4]
Many copies in the CC Web and UQ Video datasets are easy to be detected as the transformations among them are very limited.
“Many copies in the two datasets are easy to be detected as the transformations among them are very limited.”
From VCDB: A Large-Scale Database for Partial Copy Detection in Videos (2014) · cites this paper as [4]
The citation lists haven’t been fetched yet
References 35 · Cited by 334
- Authors
- Song, J., Yang, Y., Huang, Z., Shen, H. T., & Hong, R.
- Affiliations
- The University of Queensland (AU)
- Carnegie Mellon University (US)
- Hefei University of Technology (CN)
- Venue
- Proceedings of the 19th ACM international conference on Multimedia
- Publisher
- ACM
- Published
- 2011-11-28
- Pages
- 423-432
- OpenAlex
- W2067766814
- Cited by
- 334
- References
- 35
- Citations by year
- 2026: 1 · 2025: 12 · 2024: 11 · 2023: 19 · 2022: 14 · 2021: 26 · 2020: 15 · 2019: 29 · 2018: 20 · 2017: 35 · 2016: 36 · 2015: 35 · 2014: 31 · 2013: 29 · 2012: 18
- FWCI
- 19.34
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM International Conference on Multimedia (ACM MM) (publishedVersion)
- UTS ePRESS (University of Technology Sydney) (submittedVersion)
- Funders
- National Science Foundation
- Australian Research Council
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image and Video Retrieval Techniques
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Video Analysis and Summarization
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Image Retrieval and Classification Techniques
- Keywords
- near-duplicate video retrieval, binary codes, hash functions, key frames, Hamming space, scalability, local structure preservation, large-scale video datasets, YouTube videos
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