A Clustering Based Approach to Perceptual Image Hashing
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
A perceptual image hash function maps an image to a short binary string based on an image's appearance to the human eye. Perceptual image hashing is useful in image databases, watermarking, and authentication. In this paper, we decouple image hashing into feature extraction (intermediate hash) followed by data clustering (final hash). For any perceptually significant feature extractor, we propose a polynomial-time heuristic clustering algorithm that automatically determines the final hash length needed to satisfy a specified distortion. We prove that the decision version of our clustering problem is NP complete. Based on the proposed algorithm, we develop two variations to facilitate perceptual robustness versus fragility tradeoffs. We validate the perceptual significance of our hash by testing under Stirmark attacks. Finally, we develop randomized clustering algorithms for the purposes of secure image hashing.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Secure spread spectrum watermarking for multimedia
Cox, I. J., Kilian, J., Leighton, F. T., & Shamoon, T. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.650120 · Cited by 5,299
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
A Parametric Texture Model Based on Joint Statistics of Complex Wavelet Coefficients
Portilla, J., & Simoncelli, E. P. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026553619983 · Cited by 1,806 · cited 2×
“In particular, we employ a universal parametric statistical model for natural images developed by Portilla and Simoncelli [30], which works with a complex overcomplete wavelet representation of the image.”
BackgroundMethodRobust hash functions for digital watermarking
Fridrich, J., & Goljan, M. (2002) · Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540) · doi:10.1109/itcc.2000.844203 · Cited by 336 · cited 1×
“We first present a deterministic algorithm in Section V-A that attempts to retain the perceptual significance of the hash as best possible.”
Method
Cited by
Perceptual Image Hashing Via Feature Points: Performance Evaluation and Tradeoffs
Monga, V., & Evans, B. L. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.881948 · Cited by 363
Self-citationRobust and Secure Image Hashing via Non-Negative Matrix Factorizations
Monga, V., & Mihcak, M. K. (2007) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2007.902670 · Cited by 295
Self-citationRobust Image Hashing With Ring Partition and Invariant Vector Distance
Tang, Z., Zhang, X., Li, X., & Zhang, S. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2485163 · Cited by 247
Perceptual image hashing based on virtual watermark detection
Khelifi, F., & Jiang, J. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2038637 · Cited by 107
Qin, C., Liu, E., Feng, G., & Zhang, X. (2021) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2020.3047142 · Cited by 78
Metadata
- Authors
- Monga, V., Banerjee, A., & Evans, B. L.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2006-03
- Volume
- 1
- Issue
- 1
- Pages
- 68-79
- ISSN
- 1556-6013 (ISSN-L)
- OpenAlex
- W2150111216
- Cited by
- 122
- References
- 5
- FWCI
- 9.80
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Clustering Based Approach to Perceptual Image Hashing. https://app.cochat.ai/papers/10.1109/tifs.2005.863502
- The paper
- Monga, V., Banerjee, A., & Evans, B. L. (2006). A Clustering Based Approach to Perceptual Image Hashing. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2005.863502
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.