A robust spectral approach for blind watermarking of manifold surfaces

This paper proposes a robust, blind, and imperceptible spectral watermarking approach for manifold surfaces represented as triangle meshes. The basic idea is to transform the original mesh into frequency domain using the Fourier-Like Manifold Harmonics Transform. The manifold harmonics basis defined on arbitrary topology surfaces is an intrinsic property of the manifold surfaces, i.e., it is only determined by the surface metric and independent of their resolution and embedding. This property makes our watermarking scheme immune to uniform affine attack (rotation, scaling, and translation) and robust against noise-addition and mesh simplification attacks. The global manifold harmonics are computed using the finite element method combined with a band-by-band algorithm that can compute thousands of eigenvectors for large meshes with up to a million triangles. The watermark data is embedded by modifying the manifold harmonics descriptors magnitude in an imperceptible way. By using global spectral analysis, the detection of such watermarks does not require mesh registration or re-sampling, and analysis of the statistics of the manifold harmonics descriptors is exploited to devise an optimal blind detector. Experimental results show the imperceptibility of the watermark with low distortions, and its robustness against the most common attacks including the uniform affine transformations, random noise addition, mesh simplification, etc.

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

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

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

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

[5]  Leif Kobbelt,et al.  Efficient spectral watermarking of large meshes with orthogonal basis functions , 2005, The Visual Computer.

[6]  B. Prabhakaran,et al.  Robust Blind Watermarking of Point-Sampled Geometry , 2009, IEEE Transactions on Information Forensics and Security.

[7]  B. Prabhakaran,et al.  Robust blind watermarking mechanism for point sampled geometry , 2007, MM&Sec.

[8]  Bruno Lévy,et al.  Spectral Geometry Processing with Manifold Harmonics , 2008, Comput. Graph. Forum.

[9]  Hao Zhang,et al.  Spectral Methods for Mesh Processing and Analysis , 2007, Eurographics.

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

[11]  Prabir Bhattacharya,et al.  Spectral graph-theoretic approach to 3D mesh watermarking , 2007, GI '07.

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

[13]  Markus G. Kuhn,et al.  Information hiding-a survey , 1999, Proc. IEEE.

[14]  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.

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

[16]  Craig Gotsman,et al.  Spectral compression of mesh geometry , 2000, EuroCG.

[17]  Atilla Baskurt,et al.  Three-Dimensional Meshes Watermarking: Review and Attack-Centric Investigation , 2007, Information Hiding.