Watermarking Algorithms for 3D NURBS Graphic Data

Two watermarking algorithms for 3D nonuniform rational B-spline (NURBS) graphic data are proposed: one is appropriate for the steganography, and the other for watermarking. Instead of directly embedding data into the parameters of NURBS, the proposed algorithms embed data into the 2D virtual images extracted by parameter sampling of 3D model. As a result, the proposed steganography algorithm can embed information into more places of the surface than the conventional algorithm, while preserving the data size of the model. Also, any existing 2D watermarking technique can be used for the watermarking of 3D NURBS surfaces. From the experiment, it is found that the algorithm for the watermarking is robust to the attacks on weights, control points, and knots. It is also found to be robust to the remodeling of NURBS models.

[1]  Carl de Boor,et al.  A Practical Guide to Splines , 1978, Applied Mathematical Sciences.

[2]  Les A. Piegl,et al.  On NURBS: A Survey , 2004 .

[3]  Wayne Tiller,et al.  Knot-removal algorithms for NURBS curves and surfaces , 1992, Comput. Aided Des..

[4]  Les A. Piegl,et al.  The NURBS Book , 1995, Monographs in Visual Communication.

[5]  Ingemar J. Cox,et al.  Secure spread spectrum watermarking for multimedia , 1997, IEEE Trans. Image Process..

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

[7]  Frank Hartung,et al.  Multimedia watermarking techniques , 1999, Proc. IEEE.

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

[9]  Fernando Pérez-González,et al.  Statistical analysis of watermarking schemes for copyright protection of images , 1999, Proc. IEEE.

[10]  Nam Ik Cho,et al.  Watermarking for 3D NURBS graphic data , 2002, 2002 IEEE Workshop on Multimedia Signal Processing..