A robust confirmable watermarking algorithm for 3D mesh based on manifold harmonics analysis

Owing to the manifold harmonics analysis, a robust non-blind spectral watermarking algorithm for a two-manifold mesh is presented, which can be confirmed by a trusted third party. Derived from the Laplace–Beltrami operator, a set of orthogonal manifold harmonics basis functions is first adopted to span the spectral space of the underlying three-dimensional (3D) mesh. The minimal number of the basis functions required in the proposed algorithm is also determined, which can effectively accelerate the spectrum computations. Then, to assert ownership and resist 3D mesh forging, a digital signature algorithm is adopted to sign the watermark in the embedding phase and to verify the signature in the extraction phase, which could optimize the robust non-blind spectral watermarking algorithm framework. To improve the robustness of the embedded watermark signature, the input 3D mesh will be segmented into patches. The watermark signature bits are embedded into the low-frequency spectral coefficients of all patches repeatedly and extracted with regard to the corresponding variations of their coefficients. Extensive experimental results demonstrate the efficiency, invisibility, and robustness of the proposed algorithm. Compared with existing watermarking algorithms, our algorithm exhibits better visual quality and is more robust to resist various geometric and connectivity attacks.

[1]  Shi-Min Hu,et al.  A New Watermarking Method for 3D Models Based on Integral Invariants , 2009, IEEE Transactions on Visualization and Computer Graphics.

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

[3]  Alfred Menezes,et al.  The Elliptic Curve Digital Signature Algorithm (ECDSA) , 2001, International Journal of Information Security.

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

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

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

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

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

[9]  Adrian G. Bors,et al.  Blind and robust mesh watermarking using manifold harmonics , 2009, 2009 16th IEEE International Conference on Image Processing (ICIP).

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

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

[12]  Bobby Bodenheimer,et al.  Synthesis and evaluation of linear motion transitions , 2008, TOGS.

[13]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Bruce Schneier,et al.  Applied cryptography : protocols, algorithms, and source codein C , 1996 .

[15]  Niklas Peinecke,et al.  Laplace-Beltrami spectra as 'Shape-DNA' of surfaces and solids , 2006, Comput. Aided Des..

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

[17]  Ingemar J. Cox,et al.  Digital Watermarking and Steganography , 2014 .

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

[19]  B. Prabhakaran,et al.  A robust spectral approach for blind watermarking of manifold surfaces , 2008, MM&Sec '08.

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

[21]  Hiroshi Masuda,et al.  Watermaking three-dimensional polygonal models , 1997, MULTIMEDIA '97.

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

[23]  Touradj Ebrahimi,et al.  Perceptually driven 3D distance metrics with application to watermarking , 2006, SPIE Optics + Photonics.

[24]  BenedensOliver Geometry-Based Watermarking of 3D Models , 1999 .

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

[26]  Gonzalo R. Arce,et al.  A class of authentication digital watermarks for secure multimedia communication , 2001, IEEE Trans. Image Process..

[27]  T. Ebrahimi,et al.  Watermarked 3-D Mesh Quality Assessment , 2007, IEEE Transactions on Multimedia.

[28]  Daniel Cohen-Or,et al.  4-points congruent sets for robust pairwise surface registration , 2008, ACM Trans. Graph..

[29]  Atilla Baskurt,et al.  A Fragile Watermarking Scheme for Authentication of Semi-regular Meshes , 2008, Eurographics.

[30]  John Fitch,et al.  Course notes , 1975, SIGS.

[31]  Peter Jorgensen,et al.  Applied cryptography: Protocols, algorithm, and source code in C: By Bruce Schneier. New York: John Wiley, 1993. 618 p. $44.95 (paper). ISBN 0-471-59756-2 , 1996 .

[32]  James H. Burrows,et al.  Secure Hash Standard , 1995 .

[33]  Shi-Min Hu,et al.  Optimization approach for 3D model watermarking by linear binary programming , 2010, Comput. Aided Geom. Des..

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

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

[36]  Bruno Levy,et al.  Spectral Geometry Processing , 2009 .

[37]  Jun-Hai Yong,et al.  A numerically stable fragile watermarking scheme for authenticating 3D models , 2008, Comput. Aided Des..

[38]  Adrian G. Bors,et al.  Local Patch Blind Spectral Watermarking Method for 3D Graphics , 2009, IWDW.

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