Robust Image Hashing Based on Random Gabor Filtering and Dithered Lattice Vector Quantization
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
In this paper, we propose a robust-hash function based on random Gabor filtering and dithered lattice vector quantization (LVQ). In order to enhance the robustness against rotation manipulations, the conventional Gabor filter is adapted to be rotation invariant, and the rotation-invariant filter is randomized to facilitate secure feature extraction. Particularly, a novel dithered-LVQ-based quantization scheme is proposed for robust hashing. The dithered-LVQ-based quantization scheme is well suited for robust hashing with several desirable features, including better tradeoff between robustness and discrimination, higher randomness, and secrecy, which are validated by analytical and experimental results. The performance of the proposed hashing algorithm is evaluated over a test image database under various content-preserving manipulations. The proposed hashing algorithm shows superior robustness and discrimination performance compared with other state-of-the-art algorithms, particularly in the robustness against rotations (of large degrees).
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
ImageNet: A large-scale hierarchical image database
Deng, J., Dong, W., Socher, R., Li, L.-J., Li, K., & Fei-Fei, L. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206848 · Cited by 65,333
Daugman, J. G. (1985) · Journal of the Optical Society of America A · doi:10.1364/josaa.2.001160 · Cited by 3,219 · cited 1×
“Moreover, some other properties of Gabor filter also make it well suited for robust hashing, such as the high robustness against distortions [29] and the similarities to the simple cortex cells in the human visual system [30].”
BackgroundRobust 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
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 · cited 3×
“In order to increase the discrimination of robust hashing, some algorithms perform finer quantizations on feature data [6], [18], [20].”
MethodRobust 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 2×
“Fridrich et al. developed a random-projection-based image hashing algorithm, and each pixel block is projected on a randomly generated matrix [7].”
BackgroundMethodPerceptual 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
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
Robust 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
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
Huang, Z., & Liu, S. (2021) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2020.3027001 · Cited by 56
Robust and Secure Image Fingerprinting Learned by Neural Network
Li, Y., Wang, D., & Tang, L. (2020) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2019.2890966 · Cited by 52
Self-citationRobust Image Hashing With Isomap and Saliency Map for Copy Detection
Liang, X., Tang, Z., Wu, J., Li, Z., & Zhang, X. (2023) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2021.3139217 · Cited by 32
Metadata
- Authors
- Li, Y., Lu, Z., Zhu, C., & Niu, X.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2012-04
- Volume
- 21
- Issue
- 4
- Pages
- 1963-1980
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2124370754
- Cited by
- 90
- References
- 6
- FWCI
- 3.45
- 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
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.