Blind Robust 3-D Mesh Watermarking Based on Oblate Spheroidal Harmonics

In this paper, a novel transform-based, blind and robust 3-D mesh watermarking scheme is presented. The 3-D surface of the mesh is firstly divided into a number of discrete continuous regions, each of which is successively sampled and mapped onto oblate spheroids, using a novel surface parameterization scheme. The embedding is performed in the spheroidal harmonic coefficients of the spheroids, using a novel embedding scheme. Changes made to the transform domain are then reversed back to the spatial domain, thus forming the watermarked 3-D mesh. The embedding scheme presented herein resembles, in principal, the ones using the multiplicative embedding rule (inherently providing high imperceptibility). The watermark detection is blind and by far more powerful than the various correlators typically incorporated by multiplicative schemes. Experimental results have shown that the proposed blind watermarking scheme is competitively robust against similarity transformations, connectivity attacks, mesh simplification and refinement, unbalanced resampling, smoothing and noise addition, even when juxtaposed to the informed ones.

[1]  Horace Ho-Shing Ip,et al.  A robust watermarking scheme for 3D triangular mesh models , 2003, Pattern Recognit..

[2]  Rémy Prost,et al.  A multiresolution wavelet scheme for irregularly subdivided 3D triangular mesh , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[3]  Adrian G. Bors,et al.  Watermarking 3D models , 2002, Proceedings. International Conference on Image Processing.

[4]  Benoit M. Macq,et al.  Blind watermarking of 3D meshes using robust feature points detection , 2005, IEEE International Conference on Image Processing 2005.

[5]  M. Abramowitz,et al.  Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55) , 1965 .

[6]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

[7]  Tony DeRose,et al.  Efficient, fair interpolation using Catmull-Clark surfaces , 1993, SIGGRAPH.

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

[9]  Benoit M. Macq,et al.  From 3D Mesh Data Hiding to 3D Shape Blind and Robust Watermarking: A Survey , 2007, Trans. Data Hiding Multim. Secur..

[10]  Pedro V. Sander,et al.  Texture mapping progressive meshes , 2001, SIGGRAPH.

[11]  Rémy Prost,et al.  An Oblivious Watermarking for 3-D Polygonal Meshes Using Distribution of Vertex Norms , 2007, IEEE Transactions on Signal Processing.

[12]  Benoit M. Macq,et al.  Blind and Robust Watermarking of 3D Models: How to Withstand the Cropping Attack? , 2007, 2007 IEEE International Conference on Image Processing.

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

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

[15]  Steven J. Gortler,et al.  Fast exact and approximate geodesics on meshes , 2005, ACM Trans. Graph..

[16]  Fabien A. P. Petitcolas,et al.  3D watermarking design evaluation , 2003, IS&T/SPIE Electronic Imaging.

[17]  Fabien A. P. Petitcolas,et al.  Revised Papers from the 5th International Workshop on Information Hiding , 2002 .

[18]  Gabriel Taubin,et al.  A signal processing approach to fair surface design , 1995, SIGGRAPH.

[19]  Mauro Barni,et al.  Wavelet-based blind watermarking of 3D models , 2004, MM&Sec '04.

[20]  E. Grafarend,et al.  A spheroidal harmonic model of the terrestrial gravitational field. , 1989 .

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

[22]  Henri Maître,et al.  Application of spectral decomposition to compression and watermarking of 3D triangle mesh geometry , 2003, Signal Process. Image Commun..

[23]  Charles T. Loop,et al.  Smooth Subdivision Surfaces Based on Triangles , 1987 .

[24]  Dinesh Manocha,et al.  Appearance-preserving simplification , 1998, SIGGRAPH.

[25]  Atilla Baskurt,et al.  A Comprehensive Survey on Three-Dimensional Mesh Watermarking , 2008, IEEE Transactions on Multimedia.

[26]  Ingemar J. Cox,et al.  Digital Watermarking , 2003, Lecture Notes in Computer Science.

[27]  Elaine Cohen,et al.  Pattern oriented remeshing for Celtic decoration , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..

[28]  Tony DeRose,et al.  Multiresolution analysis for surfaces of arbitrary topological type , 1997, TOGS.

[29]  A. A. Ardalan,et al.  World Geodetic Datum 2000 , 1999 .

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

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

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

[33]  Anastasios Tefas,et al.  Blind robust watermarking schemes for copyright protection of 3D mesh objects , 2005, IEEE Transactions on Visualization and Computer Graphics.

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

[35]  E. Catmull,et al.  Recursively generated B-spline surfaces on arbitrary topological meshes , 1978 .

[36]  Adrian G. Bors,et al.  Watermarking mesh-based representations of 3-D objects using local moments , 2006, IEEE Transactions on Image Processing.