Robust Video Hashing via Multilinear Subspace Projections
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
The goal of video hashing is to design hash functions that summarize videos by short fingerprints or hashes. While traditional applications of video hashing lie in database searches and content authentication, the emergence of websites such as YouTube and DailyMotion poses a challenging problem of anti-piracy video search. That is, hashes or fingerprints of an original video (provided to YouTube by the content owner) must be matched against those uploaded to YouTube by users to identify instances of "illegal" or undesirable uploads. Because the uploaded videos invariably differ from the original in their digital representation (owing to incidental or malicious distortions), robust video hashes are desired. We model videos as order-3 tensors and use multilinear subspace projections, such as a reduced rank parallel factor analysis (PARAFAC) to construct video hashes. We observe that, unlike most standard descriptors of video content, tensor-based subspace projections can offer excellent robustness while effectively capturing the spatio-temporal essence of the video for discriminability. We introduce randomization in the hash function by dividing the video into (secret key based) pseudo-randomly selected overlapping sub-cubes to prevent against intentional guessing and forgery. Detection theoretic analysis of the proposed hash-based video identification is presented, where we derive analytical approximations for error probabilities. Remarkably, these theoretic error estimates closely mimic empirically observed error probability for our hash algorithm. Furthermore, experimental receiver operating characteristic (ROC) curves reveal that the proposed tensor-based video hash exhibits enhanced robustness against both spatial and temporal video distortions over state-of-the-art video hashing techniques.
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
$I$-Divergence Geometry of Probability Distributions and Minimization Problems
Csiszar, I. (1975) · The Annals of Probability · doi:10.1214/aop/1176996454 · Cited by 1,645
Robust and secure image hashing
Swaminathan, A., Mao, Y., & Wu, M. (2006) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2006.873601 · Cited by 552
Robust video fingerprinting for content-based video identification
Lee, S., & Yoo, C. D. (2008) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2008.920739 · Cited by 183
Coskun, B., & Sankur, B. (2004) · Zenodo · doi:10.5281/zenodo.38458 · Cited by 16
Cited by
Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval
Wu, G., Han, J., Guo, Y., Liu, L., Ding, G., Ni, Q., & Shao, L. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2018.2882155 · Cited by 148
Perceptual Video Hashing for Content Identification and Authentication
Khelifi, F., & Bouridane, A. (2019) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2017.2776159 · Cited by 56
Emergence of deepfakes and video tampering detection approaches: A survey
Kingra, S., Aggarwal, N., & Kaur, N. (2023) · Multimedia Tools and Applications · doi:10.1007/s11042-022-13100-x · Cited by 33
“Hashing using multilinear subspace projection [106] Youtube videos Average hash deviation: 0.”
MethodPerceptual video hashing using 3D-radial projection technique
Sandeep, R., Sharma, S., & Bora, P. K. (2017) · 2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN) · doi:10.1109/icscn.2017.8085727 · Cited by 12
Detection of Malicious Video Modifications using Perceptual Video Hashing
Sandeep, R., & Bora, P. K. (2020) · 2020 5th International Conference on Computing, Communication and Security (ICCCS) · doi:10.1109/icccs49678.2020.9277177 · Cited by 7
Metadata
- Authors
- Li, M., & Monga, V.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2012-10
- Volume
- 21
- Issue
- 10
- Pages
- 4397-4409
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2021226554
- Cited by
- 48
- References
- 4
- FWCI
- 2.62
- Type
- journal article
- 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: Robust Video Hashing via Multilinear Subspace Projections. https://app.cochat.ai/papers/10.1109/tip.2012.2206036
- The paper
- Li, M., & Monga, V. (2012). Robust Video Hashing via Multilinear Subspace Projections. IEEE Transactions on Image Processing. https://doi.org/10.1109/tip.2012.2206036
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.