2022
DOI: 10.11591/ijeecs.v25.i3.pp1383-1391
|View full text |Cite
|
Sign up to set email alerts
|

Fast image watermarking based on signum of cosine matrix

Abstract: <span>In the field of image watermarking, the singular value decomposition has good imperceptibility and robustness, but it has high complexity.  It divides a host image into matrices of U, S, and V. Singular matrix S has been widely used for embedding and extracting watermark, while orthogonal matrices of U and V are used in decomposition and reconstruction. The proposed signum of cosine matrix method is carried out to eliminate the generation of the three matrices at each block and replace it with a si… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 24 publications
(24 reference statements)
0
3
0
Order By: Relevance
“…Touati and Lakhdar [17] presented an efficient scheme based on quantization coefficient and SVD in spatial domain for self-embedding watermarks for compression types of attacks. A watermarking technique using signum of cosine matrix requires less computational time compared to SVD methods, but robustness is good for few attacks [18].…”
Section: Introductionmentioning
confidence: 99%
“…Touati and Lakhdar [17] presented an efficient scheme based on quantization coefficient and SVD in spatial domain for self-embedding watermarks for compression types of attacks. A watermarking technique using signum of cosine matrix requires less computational time compared to SVD methods, but robustness is good for few attacks [18].…”
Section: Introductionmentioning
confidence: 99%
“…The most powerful attacks are JPEG compression, salt and pepper, Gaussian blur and other attacks to reach values for the maximum Peak signal-to-noise ratio (PSNR) and also Arnold transform (AT) with SVD to flood watermarks in addition to using the sine matrix due to the strength of the attacks [31], [32], [33] In this work, new discrete Laguerre wavelets transform derived from Lacier polynomials are proposed and used quick response code (QR code) in image analysis and compression in order to reduce the image data for watermark immersion and to reach the most significant results based on PSNR and normal correlation (NC) values.…”
Section: Introductionmentioning
confidence: 99%
“…The SVD-based active detection method does produce good image quality, but this method has a high level of complexity so it requires a long computational time [24]. This is due to the SVD decomposition process which results in one singular matrix S and two orthogonal matrices U and V on each block, where only the S is used and ignores the other two variables [25]. The main problem of implementing an image authentication system through watermarking is the high level of complexity of popular algorithms such as SVD.…”
mentioning
confidence: 99%