Cited by 32Image Retrieval and Classification TechniquesAdvanced Steganography and Watermarking TechniquesDigital Media Forensic Detection

Robust Image Hashing With Isomap and Saliency Map for Copy Detection

Liang, Xiaoping, Tang, Zhenjun, Wu, Jingli, Li, Zhixin, Zhang, Xinpeng·2023·IEEE Transactions on Multimedia

Abstract

Compression technology for representing image is on demand for efficiently processing images in the Big Data era. Image hashing is an effective compression technology for computing a short representation based on visual content of input image. Currently, most reported image hashing algorithms have weakness in making a desirable classification between discrimination and robustness and thus can not reach good performance in copy detection. To address these issues, this paper proposes a new robust image hashing with Isometric Mapping (Isomap) and saliency map for copy detection. A key contribution is hash generation with saliency map determined by the Frequency Tuned (FT) method, which can guarantee robustness of the proposed image hashing. Another contribution is the use of Isomap in deriving hash from the FT-based saliency map. Since Isomap can discover the internal geometry features of image, the use of Isomap can learn discriminative image features and thus discrimination of the proposed image hashing is ensured. Experiments on open image databases are carried out. Comparison results illustrate that the proposed image hashing is better than some state-of-the-art algorithms in the performances of classification and copy detection.

Integrity signals

Registry

Crossref · 10.1109/tmm.2021.3139217

Cites

61 of 61 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Liang, X., Tang, Z., Wu, J., Li, Z., & Zhang, X.
Affiliations
  • Guangxi Normal University (CN)
  • Fudan University (CN)
Venue
IEEE Transactions on Multimedia
Published
2023
Volume
25
Pages
1085-1097
ISSN
  • 1520-9210 (ISSN-L)
  • 1941-0077
OpenAlex
W4200615098
Cited by
32
References
61
Citations by year
2026: 5 · 2025: 4 · 2024: 11 · 2023: 8 · 2022: 4
FWCI
2.07
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Multimedia (publishedVersion)
Funders
  • Guangxi Collaborative Innovation Center of Multi-source Information
  • Guangxi Talent Highland Project of Big Data Intelligence and Application
  • National Natural Science Foundation of China (61962008, 61762015, 62162006, 61966004, U1936214)
  • Guangxi Bagui Scholar Team for Innovation and Research
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Image Retrieval and Classification Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Digital Media Forensic Detection
Keywords
image hashing, copy detection, Isomap, saliency maps, hash robustness, discriminative hashing, image representation

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