Fast image watermarking based on signum of cosine matrix
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...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Advanced Engineering and Science
2022
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/33575/1/Fast%20image%20watermarking%20based%20on%20signum%20of%20cosine%20matrix.pdf http://umpir.ump.edu.my/id/eprint/33575/ https://doi.org/10.11591/ijeecs.v25.i3.pp1383-1391 https://doi.org/10.11591/ijeecs.v25.i3.pp1383-1391 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Malaysia Pahang |
| Language: | English |
| Summary: | 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 signum of cosine matrix. The proposed signum of cosine matrix is performed faster on the decomposition and reconstruction. The image is transformed into a coefficient matrix C using the signum matrix. The C matrix values are closer to the S value of singular value decomposition which can preserve high quality of the watermarked image. The experimental results show that our method is able to produce similar imperceptibility and robustness level of the watermarked image with less computational time. |
|---|