2020
DOI: 10.1016/j.procs.2020.03.361
|View full text |Cite
|
Sign up to set email alerts
|

A Novel and Efficient Blind Image Watermarking In Transform Domain

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(9 citation statements)
references
References 22 publications
0
8
0
Order By: Relevance
“…In this approach, several variants of Fourier transforms are applied to R, G, and B components of an image separately, the watermark is embedded in medium frequency band based on the combined parity of coefficients, and the obtained results are satisfactory in terms of average PSNR greater than 40 decibels for integration into a variant of Fourier transform coefficients. Another blind image watermarking scheme in the transform domain, where there is no need for a watermark and host image for extracting the watermark, gives good imperceptibility and robustness with less computational cost [33]. In this scheme, the host image is split into nonoverlapping blocks each of size 8 × 8, and DCT coefficients of each block are computed; then, two datasets (d1 and d2) are created from the selected blocks, and DCT coefficients of d1 and d2 are compared with the prefixed threshold values (k1 and k2) as follows: if the watermark bit value is 1, then corresponding d1 and d2 coefficient values are modified with set α value; else, the corresponding d1 and d2 coefficient values are set to zero.…”
Section: Related Workmentioning
confidence: 99%
“…In this approach, several variants of Fourier transforms are applied to R, G, and B components of an image separately, the watermark is embedded in medium frequency band based on the combined parity of coefficients, and the obtained results are satisfactory in terms of average PSNR greater than 40 decibels for integration into a variant of Fourier transform coefficients. Another blind image watermarking scheme in the transform domain, where there is no need for a watermark and host image for extracting the watermark, gives good imperceptibility and robustness with less computational cost [33]. In this scheme, the host image is split into nonoverlapping blocks each of size 8 × 8, and DCT coefficients of each block are computed; then, two datasets (d1 and d2) are created from the selected blocks, and DCT coefficients of d1 and d2 are compared with the prefixed threshold values (k1 and k2) as follows: if the watermark bit value is 1, then corresponding d1 and d2 coefficient values are modified with set α value; else, the corresponding d1 and d2 coefficient values are set to zero.…”
Section: Related Workmentioning
confidence: 99%
“…Discrete Cosine Transform can transform the spatial domain signal into the frequency domain signal and has good decorrelation performance [11,12]. The important information of the image after discrete cosine transform is concentrated on the middle and low frequency coefficients.…”
Section: Discrete Cosine Transformmentioning
confidence: 99%
“…Improved, with remarkable robustness when subjected to different attacks. Sunesh et al [9]. proposed a blind extraction of digital watermark technology using discrete cosine transform.…”
Section: Related Workmentioning
confidence: 99%