Robust image hashing using non-uniform sampling in discrete Fourier domain

Authors:
Chuan Qin;Chin-Chen Chang;Pei-Ling Tsou
Affiliations:
School of Optical-Electrical and Computer Engineering, University of Shanghai for Science and Technology, Shanghai 200093, China and Department of Information Engineering and Computer Science, Fen ...;Department of Information Engineering and Computer Science, Feng Chia University, Taichung 40724, Taiwan and Department of Computer Science and Information Engineering, Asia University, Taichung 4 ...;Department of Information Engineering and Computer Science, Feng Chia University, Taichung 40724, Taiwan
Venue:
Digital Signal Processing
Year:
2013

Citing 7
Cited 0

Robust Hash Functions for Digital Watermarking

ITCC '00 Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00)
A novel image hash algorithm resistant to print-scan

Signal Processing
Perceptual image hashing based on virtual watermark detection

IEEE Transactions on Image Processing
Robust video hashing based on radial projections of key frames

IEEE Transactions on Signal Processing - Part II
Robust and Secure Image Hashing via Non-Negative Matrix Factorizations

IEEE Transactions on Information Forensics and Security - Part 1
Robust and secure image hashing

IEEE Transactions on Information Forensics and Security
Perceptual Image Hashing Via Feature Points: Performance Evaluation and Tradeoffs

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a robust image hashing method in discrete Fourier domain that can be applied in such fields as image authentication and retrieval. In the pre-processing stage, image resizing and total variation based filtering are first used to regularize the input image. Then the secondary image is obtained by the rotation projection, and the robust frequency feature is extracted from the secondary image after discrete Fourier transform. More sampling points are chosen from the low- and middle-frequency component to represent the salient content of the image effectively, which is achieved by the non-uniform sampling. Finally, the intermediate sampling feature vectors are scrambled and quantized to produce the resulting binary hash securely. The security of the method depends entirely on the secret key. Experiments are conducted to show that the present method has satisfactory robustness against perceptual content-preserving manipulations and has also very low probability for collision of the hashes of distinct images.