Perceptual Image Hashing Via Feature Points: Performance Evaluation and Tradeoffs

Citations Over TimeTop 1% of 2006 papers

Abstract

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.

Related Papers

• → A visual saliency based video hashing algorithm(2012)15 cited
• → Deep binary constraint hashing for fast image retrieval(2017)8 cited
• → Fast Retrieval Method of Image Data Based on Learning to Hash(2020)1 cited
• → CLIP-HASH: A Lightweight Hashing Network for Cross-Modal Retrieval(2023)1 cited
• → NAPHash: Efficient Image Hash to Reduce Dataset Redundancy(2021)