Fragile watermarking for image authentication using dyadic walsh ordering
A digital image is subjected to the most manipulation. This is driven by the easy manipulating process through image editing software which is growing rapidly. These problems can be solved through the watermarking model as an active authentication system for the image. One of the most popular method...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Ahmad Dahlan
2023
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/42874/1/Fragile%20watermarking%20for%20image%20authentication%20using%20dyadic%20walsh%20ordering.pdf http://umpir.ump.edu.my/id/eprint/42874/ https://doi.org/10.26555/ijain.v9i3.1017 https://doi.org/10.26555/ijain.v9i3.1017 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A digital image is subjected to the most manipulation. This is driven by the easy manipulating process through image editing software which is growing rapidly. These problems can be solved through the watermarking model as an active authentication system for the image. One of the most popular methods is Singular Value Decomposition (SVD) which has good imperceptibility and detection capabilities. Nevertheless, SVD has high complexity and can only utilize one singular matrix S, and ignore two orthogonal matrices. This paper proposes the use of the Walsh matrix with dyadic ordering to generate a new S matrix without the orthogonal matrices. The experimental results showed that the proposed method was able to reduce computational time by 22% and 13% compared to the SVD-based method and similar methods based on the Hadamard matrix respectively. This research can be used as a reference to speed up the computing time of the watermarking methods without compromising the level of imperceptibility and authentication. |
|---|