.png){kind=icon}
.png){kind=icon}
Return
Digital watermarking using Hall property image decomposition method
.png){kind=icon}
PRE
AI
DOI：10.1007/s10044-017-0613-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Most of the existing singular value decomposition-based digital watermarking methods are not robust to geometric rotation, which change the pixels' locations without maintaining the corresponding changes to the pixel's intensity values of entire image and yield high computational cost. To answer this, we propose a digital image watermarking algorithm using the Hall property. In the proposed method, a digital watermark image is factorized into lower-triangular, upper-triangular, and permutation matrices. The permutation matrix is used as the valid key matrix for authentication of the rightful ownership of the watermark image. The product of the lower and upper triangular matrices is processed with a few iterations of the Arnold transformation to obtain the scrambled data. The scrambled data are embedded into particular sub-bands of a cover image using Wavelet transform. Our experiments show that the proposed algorithm is highly reliable and computationally efficient compared with state-of-the-art methods that are based on singular value decomposition.
Keywords:
Hall property
Watermarking
Wavelet transform
Arnold transform
Image encryption
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2
Papers:
1.9K
Citations:
1.9K