A SVD-based Digital Watermarking Algorithm for 3D Mesh Models

3D digital models greatly facilitate the distribution and storage of information. While its copyright protection problems attract more and more research interests. A novel SVD (singular value decomposition) based digital watermarking algorithm for 3D models is proposed in this paper. The presented algorithm uses the length between the vertice on the mesh surface and the center of the model to constitute the vertice module matrix which embodies the global characteristics of the whole model. So, the vertice module matrix can be taken as the plane parameters of the 3D models. On this basis, the SVD method can be used to embed one dimensional or two dimensional watermarks into the vertice matrix. Then the 3D mesh models can be recovered from the watermarked vertice matrix, and the watermark spreads all over the mesh model, which means it is difficult to remove the watermark from the model. Furthermore, because of the great stability of SVs, the algorithm is of good robustness. The experiment results presented in the paper indicates that the algorithm shows robustness, feasibility and has promising prospects

[1]  Anne Verroust-Blondet,et al.  Interactive texture mapping , 1993, SIGGRAPH.

[2]  Zhou Kun A Unified Framework for Digital Geometry Processing , 2002 .

[3]  M. Mrak,et al.  Picture quality measures in image compression systems , 2003, The IEEE Region 8 EUROCON 2003. Computer as a Tool..

[4]  Ryutarou Ohbuchi,et al.  Watermarking 3D Polygonal Meshes in the Mesh Spectral Domain , 2001, Graphics Interface.

[5]  Oliver Benedens Robust Watermarking and Affine Registration of 3D Meshes , 2002, Information Hiding.

[6]  Hiroshi Masuda,et al.  Embedding Data in 3D Models , 1997, IDMS.

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

[8]  Liu Quan,et al.  A combination of DCT-based and SVD-based watermarking scheme , 2004, Proceedings 7th International Conference on Signal Processing, 2004. Proceedings. ICSP '04. 2004..