2017
DOI: 10.1007/978-981-10-5687-1_3
|View full text |Cite
|
Sign up to set email alerts
|

A Robust Digital Image Watermarking Algorithm Using DWT and SVD

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 27 publications
(6 citation statements)
references
References 17 publications
0
6
0
Order By: Relevance
“…It gave an average PSNR value of 42.74 dB but gave a low NC (normalized correlation) value of the watermarked image after the cropping and rotation attacks. However, Yadav et al 21 obtained comparatively better performance for cropping and rotation attacks. In the method, the original image and the watermark image take the blocks of 256 × 256 and 144 × 144, respectively.…”
Section: Literature Reviewmentioning
confidence: 99%
“…It gave an average PSNR value of 42.74 dB but gave a low NC (normalized correlation) value of the watermarked image after the cropping and rotation attacks. However, Yadav et al 21 obtained comparatively better performance for cropping and rotation attacks. In the method, the original image and the watermark image take the blocks of 256 × 256 and 144 × 144, respectively.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The SVD technology converts an object from an array into three arrays that are similar in their sizes to the original matrix. Assume that A is an object and that the SVD is defined by Equation (1) [36][37][38].…”
Section: Singular Value Decompositionmentioning
confidence: 99%
“…Afterwards, this causes a local deformation, which is connected with the EDT. Therefore, the medium frequency regions do not affect the quality of an object [36,44].…”
Section: Discrete Cosine Transformmentioning
confidence: 99%
“…Among them, robust watermarking is widely considered for copyright protection and ownership verification in the image watermarking (Liu et al, 2019). For the robust watermarking schemes, there are two most common embedding methods: the space domain insertion and the transform domain insertion (Chan & Cheng, 2004;Guo et al, 2017;Nikolaidis & Pitas, 1998;Yadav et al, 2018). Specifically, the former is that the pixel values of host image are changed directly to embed watermark, which has low computational complexity but the ability of resisting image processing attack and geometric attack is relatively weak (Makbol & Khoo, 2014).…”
Section: Introductionmentioning
confidence: 99%
“…Specifically, the former is that the pixel values of host image are changed directly to embed watermark, which has low computational complexity but the ability of resisting image processing attack and geometric attack is relatively weak (Makbol & Khoo, 2014). The latter is that the transform coefficients of the cover image are used to embed the watermark, and the transform coefficients can be obtained by performing different transform, e.g., Discrete Wavelet Transform (DWT) (Yadav et al, 2018), Integer Wavelet Transform (IWT) (Su et al, 2012), redundant discrete wavelet transform (H.-C. , discrete cosine transform (Barni et al, 1998), and discrete Fourier transform (Pun, 2006) etc. Compared with space domain insertion, the robustness of transform domain insertion is better, while the computational complexity is higher.…”
Section: Introductionmentioning
confidence: 99%