z-logo
open-access-imgOpen Access
An optimized watermarking scheme using an encrypted gyrator transform computer generated hologram based on particle swarm optimization
Author(s) -
Jianzhong Li
Publication year - 2014
Publication title -
optics express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/oe.22.010002
Subject(s) - digital watermarking , contourlet , watermark , computer science , encryption , robustness (evolution) , particle swarm optimization , holography , artificial intelligence , scrambling , computer vision , algorithm , embedding , wavelet transform , image (mathematics) , wavelet , optics , biochemistry , chemistry , physics , gene , operating system
In this paper, a novel secure optimal image watermarking scheme using an encrypted gyrator transform computer generated hologram (CGH) in the contourlet domain is presented. A new encrypted CGH technique, which is based on the gyrator transform, the random phase mask, the three-step phase-shifting interferometry and the Fibonacci transform, has been proposed to produce a hologram of a watermark first. With the huge key space of the encrypted CGH, the security strength of the watermarking system is enhanced. To achieve better imperceptibility, an improved quantization embedding algorithm is proposed to embed the encrypted CGH into the low frequency sub-band of the contourlet-transformed host image. In order to obtain the highest possible robustness without losing the imperceptibility, particle swarm optimization algorithm is employed to search the optimal embedding parameter of the watermarking system. In comparison with other method, the proposed watermarking scheme offers better performances for both imperceptibility and robustness. Experimental results demonstrate that the proposed image watermarking is not only secure and invisible, but also robust against a variety of 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