(Guest Editors)

We present a technique for steganography in polygonal meshes. Our method hides a message in the indexed rep‐resentation of a mesh by permuting the order in which faces and vertices are stored. The permutation is relative to a reference ordering that encoder and decoder derive from the mesh connectivity in a consistent manner. Our method is distortion‐free because it does not modify the geometry of the mesh. Compared to previous steganographic methods for polygonal meshes our capacity is up to an order of magnitude better.

[1]  Arnold Schönhage,et al.  Schnelle Multiplikation großer Zahlen , 1971, Computing.

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

[3]  Craig Gotsman,et al.  Efficient Coding of Nontriangular Mesh Connectivity , 2001, Graph. Model..

[4]  Yu-Ming Cheng,et al.  A high-capacity steganographic approach for 3D polygonal meshes , 2006, The Visual Computer.

[5]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[6]  Chung-Ming Wang,et al.  Steganography on point-sampled geometry , 2006, Comput. Graph..

[7]  Craig Gotsman,et al.  Triangle Mesh Compression , 1998, Graphics Interface.

[8]  Henri Maitre,et al.  Watermarking 3D triangle meshes for authentication and integrity , 2004 .

[9]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

[10]  Yu-Ming Cheng,et al.  An Efficient Information Hiding Algorithm for Polygon Models , 2005, Comput. Graph. Forum.

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

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

[13]  Jarek Rossignac,et al.  Edgebreaker: Connectivity Compression for Triangle Meshes , 1999, IEEE Trans. Vis. Comput. Graph..

[14]  Pierre Alliez,et al.  Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes , 2002, Graph. Model..

[15]  William G. Poole,et al.  An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .

[16]  Craig Gotsman,et al.  Universal Rendering Sequences for Transparent Vertex Caching of Progressive Meshes , 2002, Comput. Graph. Forum.

[17]  Craig Gotsman,et al.  Efficient coding of non-triangular mesh connectivity , 2000, Proceedings the Eighth Pacific Conference on Computer Graphics and Applications.

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

[19]  M. Isenburg.  Compressing Polygon Mesh Connectivity with Degree Duality Prediction , 2002, Graphics Interface.

[20]  Touradj Ebrahimi,et al.  Data hiding on 3D polygonal meshes , 2004, MM&Sec '04.

[21]  Tim Weyrich,et al.  Robust watermarking of point-sampled geometry , 2004, Proceedings Shape Modeling Applications, 2004..

[22]  S. Kanai,et al.  Digital Watermarking for 3D Polygons using Multiresolution Wavelet Decomposition , 1998 .

[23]  Martin Isenburg,et al.  Streaming meshes , 2005, VIS 05. IEEE Visualization, 2005..

[24]  Ryutarou Ohbuchi,et al.  Watermarking a 3D shape model defined as a point set , 2003, 2004 International Conference on Cyberworlds.