Data hiding on 3D polygonal meshes

This paper presents a high-capacity method to embed information into the geometry of a 3D polygonal mesh. The method extends a previously reported work, to which several improvements have been brought. By construction, the new embedding algorithm is robust against rotation, scaling and translation attacks. Analysis of the proposed method on different meshes showed that its embedding capacity compares to that of previous high-capacity works. Furthermore, the new technique introduces only negligible amount of distortions to the cover mesh.

[1]  Benoit M. Macq,et al.  Data hiding on 3-D triangle meshes , 2003, IEEE Trans. Signal Process..

[2]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[3]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

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

[5]  Deborah Sulsky,et al.  Row Ordering for a Sparse QR Decomposition , 1994 .

[6]  Anastasios Tefas,et al.  Watermarking of 3D models using principal component analysis , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..

[7]  Touradj Ebrahimi,et al.  Steganography for Three-Dimensional Polygonal Meshes , 2002, SPIE Optics + Photonics.

[8]  D. Touretzky.  Gallery of CSS Descramblers , 2002 .

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

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

[11]  M. Tuma.  Row ordering in sparse QR decomposition , 1992 .

[12]  Touradj Ebrahimi,et al.  MESH: measuring errors between surfaces using the Hausdorff distance , 2002, Proceedings. IEEE International Conference on Multimedia and Expo.

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