Research On Robust Digital Watermarking Algorithm Based On Slant Transform And BAS

In order to solve the problem of contradiction between robustness and invisibility of the watermark,low security and the false alarm errors of singular value decomposition(SVD).A robust digital watermarking algorithm based on slant transform and beetle antennae search(BAS)is proposed.Firstly,the host image is divided into non-overlapping sub-blocks according to the size of the watermark image and itself.According to the size of non-overlapping sub-blocks,select an appropriate slant matrix,and then,the sub-blocks are transformed by slant transform and decomposed by the blocked SVD and get the largest singular value of each sub-blocks.Then,watermark image is pretreated by two-factor encrypting processing of Arnold transform and the hyper-chaotic system.The watermark image is decomposed by SVD and the principal components of the watermark is extracted.Finally,the watermark principal component is embedded into the largest singular value of each sub-block according to the scaling factor calculated by BAS global optimization.The peak signal-to-noise ratio and the normalized correlation coefficient are used to evaluate the performance of the algorithm.The standard grayscale images are selected for simulation experiments,and the fitness function was adjusted so that the peak signal-to-noise ratio is about 35 dB.Under the conventional attacks such as JPEG compression,noise,filtering and geometric attacks,the normalized correlation value of the extracted watermarking and the original watermarking is mostly more than 0.99.The experimental results show that proposed algorithm not only guarantees good invisibility,but also has strong robustness against conventional and geometric attacks.By referring to the slant transform and the principal components of the watermark,the computational complexity and false alarm errors of the algorithm are effectively reduced.The BAS and hyper-chaos systems are selected to optimize the watermarking algorithm,so that the algorithm can solve the problem of contradiction between robustness and invisibility of the watermark well while having high security.