Fragile watermarking for authenticating 3-D polygonal meshes

Designing a powerful fragile watermarking technique for authenticating three-dimensional (3-D) polygonal meshes is a very difficult task. Yeo and Yeung were first to propose a fragile watermarking method to perform authentication of 3-D polygonal meshes. Although their method can authenticate the integrity of 3-D polygonal meshes, it cannot be used for localization of changes. In addition, it is unable to distinguish malicious attacks from incidental data processings. In this paper, we trade off the causality problem in Yeo and Yeung's method for a new fragile watermarking scheme. The proposed scheme can not only achieve localization of malicious modifications in visual inspection, but also is immune to certain incidental data processings (such as quantization of vertex coordinates and vertex reordering). During the process of watermark embedding, a local mesh parameterization approach is employed to perturb the coordinates of invalid vertices while cautiously maintaining the visual appearance of the original model. Since the proposed embedding method is independent of the order of vertices, the hidden watermark is immune to some attacks, such as vertex reordering. In addition, the proposed method can be used to perform region-based tampering detection. The experimental results have shown that the proposed fragile watermarking scheme is indeed powerful.

[1]  Ronald Azuma,et al.  Orientation Tracking for Outdoor Augmented Reality Registration , 1999, IEEE Computer Graphics and Applications.

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

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

[4]  Ryutarou Ohbuchi,et al.  Watermarking 2D vector maps in the mesh-spectral domain , 2003, 2003 Shape Modeling International..

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

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

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

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

[9]  David P. Dobkin,et al.  MAPS: multiresolution adaptive parameterization of surfaces , 1998, SIGGRAPH.

[10]  Greg Turk,et al.  Generating random points in triangles , 1990 .

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

[12]  Minerva M. Yeung,et al.  An invisible watermarking technique for image verification , 1997, Proceedings of International Conference on Image Processing.

[13]  Andrea Sanna,et al.  Public key watermarking for authentication of CSG models , 2000, Comput. Aided Des..

[14]  Peter Schröder,et al.  Multiresolution signal processing for meshes , 1999, SIGGRAPH.

[15]  Martial Hebert,et al.  Control of Polygonal Mesh Resolution for 3-D Computer Vision , 1998, Graph. Model. Image Process..

[16]  Tsuhan Chen,et al.  Progressive browsing of 3D models , 1999, 1999 IEEE Third Workshop on Multimedia Signal Processing (Cat. No.99TH8451).

[17]  Fausto Bernardini,et al.  Cut-and-paste editing of multiresolution surfaces , 2002, SIGGRAPH.

[18]  Oliver Benedens Affine Invariant Watermarks for 3D Polygonal and NURBS Based Models , 2000, ISW.

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

[20]  Mark Meyer,et al.  Implicit fairing of irregular meshes using diffusion and curvature flow , 1999, SIGGRAPH.

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

[22]  Edward H. Adelson,et al.  The Laplacian Pyramid as a Compact Image Code , 1983, IEEE Trans. Commun..

[23]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[24]  Mohan S. Kankanhalli,et al.  Authentication of Volume Data Using Wavelet-Based Foveation , 2001, Eurographics Multimedia Workshop.

[25]  Greg Turk,et al.  Re-tiling polygonal surfaces , 1992, SIGGRAPH.

[26]  Hiroshi Masuda,et al.  A shape-preserving data embedding algorithm for NURBS curves and surfaces , 1999, 1999 Proceedings Computer Graphics International.

[27]  Hiroshi Masuda,et al.  Data embedding algorithms for geometrical and non-geometrical targets in three-dimensional polygonal models , 1998, Comput. Commun..

[28]  Greg Turk,et al.  Robust Creation of Implicit Surfaces from Polygonal Meshes , 2002, IEEE Trans. Vis. Comput. Graph..

[29]  Michael S. Floater,et al.  Parametrization and smooth approximation of surface triangulations , 1997, Comput. Aided Geom. Des..

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

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

[32]  Andrew E. Johnson,et al.  Efficient multiple model recognition in cluttered 3-D scenes , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[33]  Leif Kobbelt,et al.  Extraction of feature lines on triangulated surfaces using morphological operators , 2000 .

[34]  Peter Schröder,et al.  Consistent mesh parameterizations , 2001, SIGGRAPH.

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

[36]  Xiaoyang Mao,et al.  Watermarking 3D geometric models through triangle subdivision , 2001, IS&T/SPIE Electronic Imaging.

[37]  Andrew E. Johnson,et al.  Using Spin Images for Efficient Object Recognition in Cluttered 3D Scenes , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

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

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