Robust watermarking of 3D mesh models

A robust watermarking algorithm for the 3D mesh models is proposed. The algorithm is based on the watermarking of images from a virtual 3D scanner, which mimics the operation of 3D scanner in the real world. The position of the object in the scanner is determined by the principle component analysis of the vertex points. After obtaining 2D range image from the virtual scanner, we embed the watermark using the conventional 2D image watermarking method based on the DCT. Then, the vertices of the model are moved according to the range values modified by the 2D watermark. For the watermark extraction, the virtual ranging is performed and then the retrieval process of 2D image watermarking is performed. Experimental results show that the proposed algorithm is robust against the attacks such as mesh simplification and Gaussian noise.

[1]  Oliver Benedens Two high capacity methods for embedding public watermarks into 3 D polygonal models , 1999 .

[2]  Marc Rioux,et al.  Nefertiti: a query by content software for three-dimensional models databases management , 1997, Proceedings. International Conference on Recent Advances in 3-D Digital Imaging and Modeling (Cat. No.97TB100134).

[3]  Boon-Lock Yeo,et al.  Watermarking 3D Objects for Verification , 1999, IEEE Computer Graphics and Applications.

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

[5]  Christoph Busch,et al.  Towards Blind Detection of Robust Watermarks in Polygonal Models , 2000, Comput. Graph. Forum.

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

[7]  Fernando Pérez-González,et al.  Statistical analysis of watermarking schemes for copyright protection of images , 1999, Proc. IEEE.

[8]  Mohan S. Kankanhalli,et al.  Robust invisible watermarking of volume data using the 3D DCT , 2001, Proceedings. Computer Graphics International 2001.

[9]  Oliver Benedens Affine Invariant Watermarks for 3D Polygonal and NURBS Based Models , 2000, ISW.

[10]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[11]  Dinesh Manocha,et al.  Simplification envelopes , 1996, SIGGRAPH.

[12]  Joseph O'Rourke,et al.  Computational geometry in C (2nd ed.) , 1998 .

[13]  Hiroshi Masuda,et al.  A shape-preserving data embedding algorithm for NURBS curves and surfaces , 1999, 1999 Proceedings Computer Graphics International.

[14]  Rafael Jesús Segura,et al.  An algorithm for determining intersection segment-polygon in 3D , 1998, Comput. Graph..

[15]  Oliver Benedens Watermarking of 3D-polygon-based models with robustness against mesh simplification , 1999, Electronic Imaging.

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

[17]  Oliver Benedens,et al.  Geometry-Based Watermarking of 3D Models , 1999, IEEE Computer Graphics and Applications.