A new masking method for spatial domain watermarking of three-dimensional triangle meshes

We examine a new masking scheme for three-dimensional mesh watermarking in the spatial domain. The masking factor at each point is defined based an estimate of the average difference between the position of connected vertices to a vertex. We test the proposed watermarking scheme by embedding a random binary sequence and applying different attacks, such as additive random noise, compression by MPEG-4 SNHC, and mesh simplification, which shows that the proposed masking scheme can improve the robustness of the spatial domain watermarking scheme.

[1]  Ingemar J. Cox,et al.  Secure spread spectrum watermarking for multimedia , 1997, IEEE Trans. Image Process..

[2]  Hiroshi Masuda,et al.  Watermarking three-dimensional polygonal models through geometric and topological modifications , 1998, IEEE J. Sel. Areas Commun..

[3]  Peter Schröder,et al.  Multiresolution signal processing for meshes , 1999, SIGGRAPH.

[4]  Markus G. Kuhn,et al.  Information hiding-a survey , 1999, Proc. IEEE.

[5]  Adam Finkelstein,et al.  Robust mesh watermarking , 1999, SIGGRAPH.

[6]  Michael G. Wagner,et al.  Robust watermarking of polygonal meshes , 2000, Proceedings Geometric Modeling and Processing 2000. Theory and Applications.

[7]  David Zhang,et al.  Robust mesh watermarking based on multiresolution processing , 2001, Comput. Graph..

[8]  Ryutarou Ohbuchi,et al.  A Frequency‐Domain Approach to Watermarking 3D Shapes , 2002, Comput. Graph. Forum.