Proceedings chapter
Open access

Conception and limits of robust perceptual hashing: toward side information assisted hash functions

Presented at San Jose (USA), Jan. 18
  • SPIE Proceedings; 7254
Publication date2009

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.

  • Watermarking
  • Algorithms
  • Quantization
Citation (ISO format)
VOLOSHYNOVSKYY, Svyatoslav et al. Conception and limits of robust perceptual hashing: toward side information assisted hash functions. In: Proceedings of SPIE Photonics West, Electronic Imaging / Media Forensics and Security XI. San Jose (USA). [s.l.] : [s.n.], 2009. (SPIE Proceedings) doi: 10.1117/12.805919
Main files (1)
Proceedings chapter (Published version)

Technical informations

Creation03/06/2015 5:12:06 PM
First validation03/06/2015 5:12:06 PM
Update time03/14/2023 10:58:30 PM
Status update03/14/2023 10:58:30 PM
Last indexation08/29/2023 3:08:54 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack