Image hashing with color vector angle
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Abstract Color vector angle (CVA) is an important feature of processing color images and has been successfully developed and used in real applications, such as edge detection, indexing and retrieval of images. However, it is unsolved how to apply the CVA to efficiently generating an image hash. Also, most image hashing algorithms choose luminance component of color image for hash generation and cannot well capture the color information of images. To tackle these issues, we study efficient image hashing algorithms with the histogram of CVAs, called HCVA hashing. The histogram is first extracted from those angles that are in the biggest circle inscribed inside the normalized image. And then, it is compressed to make a short hash. We conducted some experiments to assess the performance, and illustrated that the DCT (Discrete Cosine Transform) is the best one of that cooperating with HCVA at generating hashes, as well as the HCVA hashing is robust and promising.
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
Robust 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
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
Self-citationPerceptual 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
Huang, Z., & Liu, S. (2021) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2020.3027001 · Cited by 56
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
Self-citationA Secure and Robust Image Hashing Scheme Using Gaussian Pyramids
Bashir, I., Ahmed, F., Ahmad, J., Boulila, W., & Alharbi, N. (2019) · Entropy · doi:10.3390/e21111132 · Cited by 20
“in [18] use the idea of Color Vector Angle (CVA) to generate image hash.”
Method
Metadata
- Authors
- Tang, Z., Li, X., Zhang, X., Zhang, S., & Dai, Y.
- Venue
- Neurocomputing
- Publisher
- Elsevier BV
- Published
- 2018-09
- Volume
- 308
- Pages
- 147-158
- ISSN
- 0925-2312 (ISSN-L)
- OpenAlex
- W2799661474
- Cited by
- 38
- References
- 5
- FWCI
- 2.37
- Type
- journal article
- Language
- en
- Open access
- green
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.