z-logo
open-access-imgOpen Access
Digital watermarking algorithm based on 4-level discrete wavelet transform and discrete fractional angular transform
Author(s) -
Jing-You Li,
Chunhui Zhao,
Guang-Da Zhang
Publication year - 2021
Publication title -
optica applicata
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.204
H-Index - 28
eISSN - 1899-7015
pISSN - 0078-5466
DOI - 10.37190/oa210411
Subject(s) - watermark , discrete wavelet transform , digital watermarking , algorithm , stationary wavelet transform , wavelet packet decomposition , second generation wavelet transform , discrete cosine transform , wavelet transform , computer science , mathematics , harmonic wavelet transform , rotation (mathematics) , wavelet , computer vision , image (mathematics)
Nowadays, there are many watermarking algorithms based on wavelet transform. The simple one is to insert directly the watermark into the wavelet transform coefficients. However, most of the existing watermarking schemes can only resist traditional signal processing attacks, such as image compression, noise and filtering. When the watermarked image is subject to geometric transformations, especially rotation attack, it is hard to detect the watermark successfully. In this paper, a digital watermarking algorithm is proposed based on 4-level discrete wavelet transform and discrete fractional angular transform. To enhance the security of the algorithm, the watermark is scrambled with the simplicity of Arnold transform and chaos-based mix optical bistability model, since the chaos is pseudorandom and sensitive to the initial values. And the watermark is embedded into the medium frequency sub-band of the 1-level wavelet decomposition according to the Harris feature point detection. Simulation results show that the proposed digital watermarking algorithm by combining 4-level discrete wavelet transform with discrete fractional angular transform could resist rotation attack and other common attacks.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here