A key-dependent secure image hashing scheme by using Radon transform
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
The perceptual image hashing is an emerging technique which can be used in image authentication and content-based image retrieval. Recently, several image hashing schemes based on Radon transform are proposed for image authentication and retrieval. These schemes have no random information to strengthen the security with image hashing. In this paper, we propose a simple key-based secure image hashing scheme by using radon transform and 1-D Discrete Cosine Transform (DCT). Particularly, we introduce a randomization on Radon transform and make the image hash more secure and more robust. Moreover, the discriminative capability is also confirmed in our experimental results.
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
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 2×
“Finally, we conclude the paper in Section 5.”
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×
“The early image hashing approaches [3], [4] usually based on DCT/DWT use the low frequency components to extract important image features from a reduced set of the original image data.”
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 multidimensional scaling
Tang, Z., Huang, Z., Zhang, X., & Lao, H. (2017) · Signal Processing · doi:10.1016/j.sigpro.2017.02.008 · Cited by 80
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
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
“D Discrete Cosine Transform (DCT) and Radon transform [10].”
Method
Metadata
- Authors
- Ou, Y., & Rhee, K. H.
- Venue
- 2009 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)
- Publisher
- IEEE
- Published
- 2009-12
- Pages
- 595-598
- OpenAlex
- W2111588291
- Cited by
- 52
- References
- 3
- FWCI
- 1.36
- Type
- conference paper
- 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.