Image hashing resilient to geometric and filtering operations

Image hash functions provide compact representations of images, which is useful for search and authentication applications. In this work, we have identified a general three step framework and proposed a new image hashing scheme that achieves a better overall performance than the existing approaches under various kinds of image processing distortions. By exploiting the properties of discrete polar Fourier transform and incorporating cryptographic keys, the proposed image hash is resilient to geometric and filtering operations, and is secure against guessing and forgery attacks.

[1]  Jean-Didier Legat,et al.  RASH: RAdon soft hash algorithm , 2002, 2002 11th European Signal Processing Conference.

[2]  Ramarathnam Venkatesan,et al.  A Perceptual Audio Hashing Algorithm: A Tool for Robust Audio Identification and Information Hiding , 2001, Information Hiding.

[3]  Ingemar J. Cox,et al.  Rotation, scale, and translation resilient watermarking for images , 2001, IEEE Trans. Image Process..

[4]  Ramarathnam Venkatesan,et al.  Robust image hashing , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).

[5]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[6]  Ming-Kuei Hu,et al.  Visual pattern recognition by moment invariants , 1962, IRE Trans. Inf. Theory.

[7]  Ramarathnam Venkatesan,et al.  New Iterative Geometric Methods for Robust Perceptual Image Hashing , 2001, Digital Rights Management Workshop.

[8]  Jiri Fridrich,et al.  Robust hash functions for digital watermarking , 2000, Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540).

[9]  Thierry Pun,et al.  Rotation, scale and translation invariant spread spectrum digital image watermarking , 1998, Signal Process..

[10]  Kannan Ramchandran,et al.  Dither-based secure image hashing using distributed coding , 2003, Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429).