A three-dimensional grid splitting method of blind watermark

Abstract

The invention relates to a three-dimensional grid splitting method of blind watermark. The process of embedding the watermark comprises the steps of 1) processing an original model using an NPCA algorithm, and separating all peaks into multiple aggregations; 2) splitting the grid, mapping all peak aggregations to be front view, selecting proper pixel from the front view to obtain an additional information sampling view; and 3) embedding the watermark information; the process of extracting the watermark comprises the steps of a) processing an attacked model using the NPCA algorithm; b) extracting the additional information sampling view of the attacked model; c) subtracting the additional information sampling view of the original model by the additional information sampling view of the attacked model, aligning the grid and primarily estimating the spit grid; and d) extracting the watermark. The invention only carries a little information, can synchronously split the attacked model, extracts the watermark without the original model, and can predict the watermark grid splitting boundary with less auxiliary data.

Description

Technical field [0001] The invention relates to a three-dimensional grid segmentation method for blind watermarking. Background technique [0002] In the past ten years, digital watermarking has become an important method for copyright protection and ownership declaration. Most of the applicable digital watermarking technologies mainly focus on traditional data media types such as audio, image and video, and they are widely distributed on the Internet. It was not until a few years ago that scholars began to study 3D watermarking. This is the result of the increasing spread of 3D objects in the fields of architectural design, virtual reality, entertainment, mechanical engineering, and cultural heritage. However, the research on three-dimensional objects is not as deep as the research on images and videos. [0003] The two main requirements of any watermarking algorithm are the robustness and security of the watermark. Robustness requires that the watermark can be detected even if ...

AI Technical Summary

Problems solved by technology

[0007] 2) Lack of alternative meshes with significant geometric features as watermark targets

Applying these existing segmentation algorithms to 3D watermarking, the main problem is that the real segmentation may not meet the needs of watermarking, because the 3D compression architecture relies on some relative transformation parameters and the remaining error to compensate for the gap between the alternative grids

Images