Paper
4 February 2009 Conception and limits of robust perceptual hashing: towards side information assisted hash functions
Sviatoslav Voloshynovskiy, Oleksiy Koval, Fokko Beekhof, Thierry Pun
Author Affiliations +
Proceedings Volume 7254, Media Forensics and Security; 72540D (2009) https://doi.org/10.1117/12.805919
Event: IS&T/SPIE Electronic Imaging, 2009, San Jose, California, United States
Abstract
In this paper, we consider some basic concepts behind the design of existing robust perceptual hashing techniques for content identification. We show the limits of robust hashing from the communication perspectives as well as propose an approach that is able to overcome these shortcomings in certain setups. The consideration is based on both achievable rate and probability of error. We use the fact that most robust hashing algorithms are based on dimensionality reduction using random projections and quantization. Therefore, we demonstrate the corresponding achievable rate and probability of error based on random projections and compare with the results for the direct domain. The effect of dimensionality reduction is studied and the corresponding approximations are provided based on the Johnson-Lindenstrauss lemma. Side-information assisted robust perceptual hashing is proposed as a solution to the above shortcomings.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sviatoslav Voloshynovskiy, Oleksiy Koval, Fokko Beekhof, and Thierry Pun "Conception and limits of robust perceptual hashing: towards side information assisted hash functions", Proc. SPIE 7254, Media Forensics and Security, 72540D (4 February 2009); https://doi.org/10.1117/12.805919
Lens.org Logo
CITATIONS
Cited by 29 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Error analysis

Feature extraction

Optical spheres

Lead

Signal to noise ratio

Computer simulations

Back to Top