Robust video hashing based on radial projections of key frames
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Robust signal hashing defines a feature vector that characterizes the signal, independently of "nonsignificant" distortions of its content. When dealing with images, the considered distortions are typically due to compression or small geometrical manipulations. In other words, robustness means that images that are visually indistinguishable should produce equal or similar hash values. To discriminate image contents, a hash function should produce distinct outputs for different images. Our paper first proposes a robust hashing algorithm for still images. It is based on radial projection of the image pixels and is denoted the Radial hASHing (RASH) algorithm. Experimental results provided on the USC-SIPI dataset reveal that the proposed RASH feature vector is more robust and provides much stronger discrimination than a conventional histogram-based feature vector. The RASH vector appears to be a good candidate to build indexing algorithms, copy-detection systems, or content-based authentication mechanisms. To take benefit from the RASH vector capabilities, video content is summarized into key frames, each of them characterizing a video shot and described by its RASH vector. The resulting video hashing system works in real time and supports most distortions due to common spatial and temporal video distortions.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Robust hash functions for digital watermarking
Fridrich, J., & Goljan, M. (2002) · Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540) · doi:10.1109/itcc.2000.844203 · Cited by 336 · cited 1×
“When defining a projected vector, our objective is to get an easy way to decide whether two images are equivalent or not, independently of nonsignificant distortion of the content.”
Background
Cited by
Robust Image Hashing With Ring Partition and Invariant Vector Distance
Tang, Z., Zhang, X., Li, X., & Zhang, S. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2485163 · Cited by 247
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
Robust image hashing using non-uniform sampling in discrete Fourier domain
Qin, C., Chang, C.-C., & Tsou, P.-L. (2013) · Digital Signal Processing · doi:10.1016/j.dsp.2012.11.002 · Cited by 81
“the proposed method is lower than that of RASH method [4] and approximates that of Fridrich’s method [1].”
MethodInfluentialPerceptual 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
Robust and Secure Image Fingerprinting Learned by Neural Network
Li, Y., Wang, D., & Tang, L. (2020) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2019.2890966 · Cited by 52
Metadata
- Authors
- De Roover, C., De Vleeschouwer, C., Lefebvre, F., & Macq, B.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2005-10
- Volume
- 53
- Issue
- 10
- Pages
- 4020-4037
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2153866672
- Cited by
- 177
- References
- 2
- FWCI
- 3.99
- 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
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.