Efficient Image Hashing with Geometric Invariant Vector Distance for Copy Detection
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Hashing method is an efficient technique of multimedia security for content protection. It maps an image into a content-based compact code for denoting the image itself. While most existing algorithms focus on improving the classification between robustness and discrimination, little attention has been paid to geometric invariance under normal digital operations, and therefore results in quite fragile to geometric distortion when applied in image copy detection. In this article, a novel effective image hashing method is proposed based on geometric invariant vector distance in both spatial domain and frequency domain. First, the image is preprocessed by some joint operations to extract robust features. Then, the preprocessed image is randomly divided into several overlapping blocks under a secret key, and two different feature matrices are separately obtained in the spatial domain and frequency domain through invariant moment and low frequency discrete cosine transform coefficients. Furthermore, the invariant distances between vectors in feature matrices are calculated and quantified to form a compact hash code. We conduct various experiments to demonstrate that the proposed hashing not only reaches good classification between robustness and discrimination, but also resists most geometric distortion in image copy detection. In addition, both receiver operating characteristics curve comparisons and mean average precision in copy detection clearly illustrate that the proposed hashing method outperforms state-of-the-art algorithms.
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
Aggregating Local Image Descriptors into Compact Codes
Jegou, H., Perronnin, F., Douze, M., Sanchez, J., Perez, P., & Schmid, C. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.235 · Cited by 1,503
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
Two-Stream 3-D convNet Fusion for Action Recognition in Videos With Arbitrary Size and Length
Wang, X., Gao, L., Wang, P., Sun, X., & Liu, X. (2018) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2017.2749159 · Cited by 263 · cited 2×
“More recently, some learning-based hashing methods have been proposed, which includes machine learning hashing [33, 42–45] and deep learning hashing [46–49].”
BackgroundMethodRobust 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 · cited 5×
“For example, Tang et al. [3] divided the input image into different ring partitions to extract statistical features, and further calculated the vector distance between statistical features for getting image hashing.”
BackgroundMethodInfluentialA secure and robust hash-based scheme for image authentication
Ahmed, F., Siyal, M. Y., & Uddin Abbas, V. (2010) · Signal Processing · doi:10.1016/j.sigpro.2009.05.024 · Cited by 189
Content-based image copy detection
Kim, C. (2003) · Signal Processing Image Communication · doi:10.1016/s0923-5965(02)00130-3 · Cited by 165 · cited 1×
“In addition, content-based image copy detection has received more attention to detect legal copies through extracting content-based features from images and then matching the similarity between extracted features [64].”
BackgroundPerceptual 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
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
Self-citationUnified Performance Evaluation Method for Perceptual Image Hashing
Li, X., Qin, C., Wang, Z., Qian, Z., & Zhang, X. (2022) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2022.3161149 · Cited by 32
Robust 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
Deep Perceptual Hash Based on Hash Center for Image Copyright Protection
Sun, X., & Zhou, J. (2022) · IEEE Access · doi:10.1109/access.2022.3221980 · Cited by 20
“…the preprocessed image into multiple overlapping blocks, obtained two characteristic matrices through invariant moments and low-frequency discrete cosine transform coef-ficients, and quantized the invariant distance between vectors in the characteristic matrix to form a compact hash code [12].”
Background
Metadata
- Authors
- Liu, S., & Huang, Z.
- Venue
- ACM Transactions on Multimedia Computing, Communications, and Applications
- Published
- 2019-11-30
- Volume
- 15
- Issue
- 4
- Pages
- 1-22
- ISSN
- 1551-6857 (ISSN-L)
- 1551-6865
- OpenAlex
- W3018599631
- Cited by
- 41
- References
- 7
- FWCI
- 2.35
- 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.