The Digital Watermarking Algorithm Based on the Big Data Algebra Graoh

Comprehensive information and contradiction of the curse of dimensionality is biggest hiden problem of the big data era. Discrete cosine transform (DCT) digital watermarking has always been the mainstream watermarking method, but the existing algorithms do not work well for high-dimensional nonlinear data; the indepth digital watermarkbelongs to nonlinear digital watermarking method, is has better application for the approximation problem of complex functions, but very sensitive to the hidden layer parameters. For above problems, the large data algebraic graph theory is introduced into of digital watermarking, and proposes a optimized digital watermarking algorithm based on algebraic graph of big data era. This algorithm used big data algebraic graph evolution strategy to implement the golbal serach and character of optimization, and optimize towards the structure of indepth digital watermark and related parameters. Both theoretical analysis and experimental results have proved the effectiveness of the algorithm.