An adaptive color image watermarking using RDWT-SVD and artificial bee colony based quality metric strength factor optimization
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Abstract Image watermarking has emerged as a useful method for solving security issues like authenticity, copyright protection and rightful ownership of digital data. Existing watermarking schemes use either a binary or grayscale image as a watermark. This paper proposes a new robust and adaptive watermarking scheme in which both the host and watermark are the color images of the same size and dimension. The security of the proposed watermarking scheme is enhanced by scrambling both color host and watermark images using Arnold chaotic map. The host image is decomposed by redundant discrete wavelet transform (RDWT) into four sub-bands of the same dimension, and then approximate sub-band undergoes singular value decomposition (SVD) to obtain the principal component (PC). The scrambled watermark is then directly inserted into a principal component of scrambled host image, using an artificial bee colony optimized adaptive multi-scaling factor, obtained by considering both the host and watermark image perceptual quality to overcome the tradeoff between imperceptibility and robustness of the watermarked image. The hybridization of RDWT-SVD provides an advantage of no shift-invariant to achieve higher embedding capacity in the host image and preserving the imperceptibility and robustness by exploiting SVD properties. To measure the imperceptibility and robustness of the proposed scheme, both qualitative and quantitative evaluation parameters like peak signal to noise ratio (PSNR), structural similarity index metric (SSIM) and normalized cross-correlation (NC) are used. Experiments are performed against several image processing attacks and the results are analyzed and compared with other related existing watermarking schemes which clearly depict the usefulness of the proposed scheme. At the same time, the proposed scheme overcomes the major security problem of false positive error (FPE) that mostly occurs in existing SVD based watermarking schemes.
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
Secure spread spectrum watermarking for multimedia
Cox, I. J., Kilian, J., Leighton, F. T., & Shamoon, T. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.650120 · Cited by 5,299
Cited by
Abdel Hakeem, S. A., & Kim, H. (2025) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2025.3558849 · Cited by 90
Intelligent Intrusion Detection System for VANET Using Machine Learning and Deep Learning Approaches
Karthiga, B., Durairaj, D., Nawaz, N., Venkatasamy, T. K., Ramasamy, G., & Hariharasudan, A. (2022) · Wireless Communications and Mobile Computing · doi:10.1155/2022/5069104 · Cited by 73
Secure and optimized satellite image sharing based on chaotic eπ map and Racah moments
Karmouni, H., Tahiri, M. A., Dagal, I., Amakdouf, H., Jamil, M. O., Qjidaa, H., & Sayyouri, M. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.121247 · Cited by 22
Metadata
- Authors
- Sharma, S., Sharma, H., & Sharma, J. B.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2019-11
- Volume
- 84
- Pages
- 105696
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W2969520439
- Cited by
- 92
- References
- 1
- FWCI
- 4.80
- 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.