Robust Hashing for Image Authentication Using Zernike Moments and Local Features
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
A robust hashing method is developed for detecting image forgery including removal, insertion, and replacement of objects, and abnormal color modification, and for locating the forged area. Both global and local features are used in forming the hash sequence. The global features are based on Zernike moments representing luminance and chrominance characteristics of the image as a whole. The local features include position and texture information of salient regions in the image. Secret keys are introduced in feature extraction and hash construction. While being robust against content-preserving image processing, the hash is sensitive to malicious tampering and, therefore, applicable to image authentication. The hash of a test image is compared with that of a reference image. When the hash distance is greater than a threshold τ1and less than τ2, the received image is judged as a fake. By decomposing the hashes, the type of image forgery and location of forged areas can be determined. Probability of collision between hashes of different images approaches zero. Experimental results are presented to show effectiveness of the method.
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
Robust and secure image hashing
Swaminathan, A., Mao, Y., & Wu, M. (2006) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2006.873601 · Cited by 552
Cited by
Robust 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
“To make theoretical analysis of these results, the ROC graph was used again, which has been widely exploited to analyze performances of hashing algorithms [17], [22], [23], [25], [34].”
BackgroundMethodInfluentialSelf-citationRobust Image Hashing with Tensor Decomposition
Tang, Z., Chen, L., Zhang, X., & Zhang, S. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2837745 · Cited by 134
Self-citationRobust image hashing with multidimensional scaling
Tang, Z., Huang, Z., Zhang, X., & Lao, H. (2017) · Signal Processing · doi:10.1016/j.sigpro.2017.02.008 · Cited by 80
Self-citationQin, 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
Self-citationHuang, Z., & Liu, S. (2021) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2020.3027001 · Cited by 56
Metadata
- Authors
- Zhao, Y., Wang, S., Zhang, X., & Yao, H.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2013-01
- Volume
- 8
- Issue
- 1
- Pages
- 55-63
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W2096571195
- Cited by
- 227
- References
- 1
- FWCI
- 11.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: Robust Hashing for Image Authentication Using Zernike Moments and Local Features. https://app.cochat.ai/papers/10.1109/tifs.2012.2223680
- The paper
- Zhao, Y., Wang, S., Zhang, X., & Yao, H. (2013). Robust Hashing for Image Authentication Using Zernike Moments and Local Features. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2012.2223680
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.