Perceptual video hashing using 3D-radial projection technique
Abstract
A function that outputs a feature vector from the perceptual contents of the input video is called a perceptual video hashing function and the output feature vector that characterizes the perceptual contents of the input video is called the perceptual video hash. This hash must be robust to the manipulations that preserves the perceptual contents of the video and fragile to the modifications that vary the perceptual contents of the video. The wide scale applications of perceptual hash in the world of multimedia, such as video authentication, video copyright protection, and video retrieval, emphasize the importance of this area of research. This work generates a perceptual hash from the video using the 3D-radial projection of the pixels and assesses the differentiating capabilities and the perceptual robustness of the hash generated. This method is the 3D extension of the 2D radial projection based image hashing. In this work, the variance of the luminance values of the projected pixels is calculated for each randomly generated sub-tensor. The variance of all the sub-tensors are averaged along the second dimension and projected onto the discrete cosine transform (DCT) basis. The performance measure of the proposed work is assessed using the receiver operating characteristic (ROC) curves. Simulation results indicate that the performance of the proposed method is satisfactory for both the content-preserving and the content changing attacks.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Cited by
Sorted by citations
Perceptual Robust Hashing for Video Copy Detection with Unsupervised Learning
Zhao, G., Qin, C., Luo, X., Zhang, X., & Chang, C.-C. (2023) · Proceedings of the 2023 ACM Workshop on Information Hiding and Multimedia Security · doi:10.1145/3577163.3595110 · Cited by 1 · see citing works
“Sandeep et al. [13] extended the two-dimensional radial projection technique (RPT) for image hashing to three dimensions by calculating the variance of the luminance values of the projected pixels for each sub-tensor, and then applied DCT to generate a video hash sequence.”
Method
- Authors
- Sandeep, R., Sharma, S., & Bora, P. K.
- Affiliations
- Indian Institute of Technology Guwahati (IN)
- University of California San Diego (US)
- Venue
- 2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN)
- Publisher
- IEEE
- Published
- 2017-03
- Pages
- 1-6
- OpenAlex
- W2765111509
- Cited by
- 12
- References
- 0
- Citations by year
- 2025: 1 · 2023: 3 · 2022: 1 · 2021: 2 · 2020: 2 · 2019: 1 · 2018: 2
- FWCI
- 0.40
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- International Conference on Signal Processing, Communication and Networking (ICSCN) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Digital Media Forensic Detection
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Keywords
- video authentication, copyright protection, video retrieval, perceptual robustness, discrete cosine transform
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