Research On The Algorithm Of Optimizing The Embedding Position Of Digital Image Watermark

With the pace of the times,Internet technology and multimedia technology are developing faster and faster.A large number of digital products are rapidly spread online and offline,and because there is no good way to protect the products,incidents of copyright infringement occur frequently.The ability of digital watermarking technology to protect product copyright is better,so this technology is widely used.In order to improve the performance of digital watermarking and obtain superior robustness and watermark invisibility,the article proposes two algorithms for optimizing the embedded position of the watermark.The comparison of simulation experiment data proves that these two algorithms have superior invisibility and robustness.The two main contents of this article:(1)A DCT blind watermarking algorithm based on the hybrid of particle swarm and leapfrog is proposed.The algorithm uses the particle swarm optimization algorithm and the leapfrog algorithm to mix,optimize the DCT coefficients in two stages,and the final optimization result is used as the location of the embedded watermark.The algorithm first divides the carrier image into blocks and numbers them,and then performs DCT transformation on each small block separately,and the DCT coefficients obtained by the transformation are arranged according to the word "Zig-zag" and numbered 1-64.Then the particle swarm optimization algorithm is used for the first stage of optimization,and the 64 transform coefficients obtained after each small block are transformed are used as the initial value of the particle swarm.Since the particle swarm optimization algorithm is prone to premature convergence,which leads to a certain error in the optimization result,the global optimal value and individual optimal value obtained in the first iteration of the particle swarm optimization iteration are finally selected as the optimization result.The particle swarm optimization operation is performed on all the small blocks to obtain the set of these two values.Leapfrog optimization is the second stage of optimization.The set of two values output by the first stage optimization is used as the two initial populations of the leapfrog algorithm,and the optimization obtains two optimal values,which are the two positions where the watermark is embedded.Finally,the watermark is embedded through a specific watermark embedding principle,and the effectiveness of the algorithm is proved through two experiments of invisibility and robustness.(2)A watermarking algorithm based on 3D wheelbase combined with particle swarm is proposed.According to the characteristics of the image,construct the three-dimensional wheelbase,calculate the distribution probability of the three-dimensional wheelbase,The image three-dimensional wheelbase has the characteristics of the larger the wheelbase,the smaller the probability,so the maximum wheelbase position is selected as the watermark embedding position.The calculation shows that there are many pixels when the three-dimensional wheelbase is the largest,and the particle swarm optimization algorithm is used to optimize the position of the pixels.Take all the pixels with the largest wheelbase as the initial value of the particle swarm,and optimize the optimal pixel position as the embedding position of the watermark.A large amount of experimental data shows that the algorithm makes the watermark more invisible,and at the same time,it can also show good robustness when under attack.This paper takes the optimization of the embedding position of the digital watermark as the research direction.The two algorithms proposed are simple to implement,have good robustness and have good watermark invisibility.