Share Email Print
cover

Proceedings Paper

Conception and limits of robust perceptual hashing: towards side information assisted hash functions
Author(s): Sviatoslav Voloshynovskiy; Oleksiy Koval; Fokko Beekhof; Thierry Pun
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 4 February 2009
PDF: 12 pages
Proc. SPIE 7254, Media Forensics and Security, 72540D (4 February 2009); doi: 10.1117/12.805919
Show Author Affiliations
Sviatoslav Voloshynovskiy, Univ. of Geneva (Switzerland)
Oleksiy Koval, Univ. of Geneva (Switzerland)
Fokko Beekhof, Univ. of Geneva (Switzerland)
Thierry Pun, Univ. of Geneva (Switzerland)


Published in SPIE Proceedings Vol. 7254:
Media Forensics and Security
Edward J. Delp; Jana Dittmann; Nasir D. Memon; Ping Wah Wong, Editor(s)

© SPIE. Terms of Use
Back to Top