IEEE Trans. on Image Processing, vol. 15, no. 11, pp. 3452-3465, Nov. 2006.

Perceptual Image Hashing Via Feature Points: Performance Evaluation and Trade-Offs

Vishal Monga and Brian L. Evans

Center for Perceptual Systems, The University of Texas at Austin, Austin, TX 78712 USA -

Draft of Paper - Software

Image Hashing Research at UT Austin


We propose an image hashing paradigm using visually significant feature points. The feature points should be largely invariant under perceptually insignificant distortions. To satisfy this, we propose an iterative feature detector to extract significant geometry preserving feature points. We apply probabilistic quantization on the derived features to introduce randomness, which in turn reduces vulnerability to adversarial attacks. The proposed hash algorithm withstands standard benchmark (e.g. Stirmark) attacks including compression, geometric distortions of scaling and small angle rotation, and common signal processing operations. Content changing (malicious) manipulations of image data are also accurately detected. Detailed statistical analysis in the form of receiver operating characteristic (ROC) curves is presented and reveals the success of the proposed scheme in achieving perceptual robustness while avoiding misclassification.

COPYRIGHT NOTICE: All the documents on this server have been submitted by their authors to scholarly journals or conferences as indicated, for the purpose of non-commercial dissemination of scientific work. The manuscripts are put on-line to facilitate this purpose. These manuscripts are copyrighted by the authors or the journals in which they were published. You may copy a manuscript for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect these copyrights.

Last Updated 11/01/06.