Watermarking curves using 2D mesh spectral transform

This paper presents a robust watermarking method for curves that uses informed-detection. To embed watermarks, the presented algorithm parameterizes a curve using the B-spline model and acquires the control points of the B-spline model. For these control points, 2D mesh are created by applying Delaunay triangulation and then the mesh spectral analysis is performed to calculate the mesh spectral coefficients where watermark messages are embedded in a spread spectrum way. The watermarked coefficients are inversely transformed to the coordinates of the control points and the watermarked curve is reconstructed by calculating B-spline model with the control points. To detect the embedded watermark, we calculate the difference between the original and watermarked mesh spectral coefficients with the same process for embedding. By calculating correlation coefficients between the detected and candidate watermark, we decide which watermark was embedded.

[1]  Carlos Cabrelli,et al.  Calculating the Hausdorff Distance Between Curves , 1997, Inf. Process. Lett..

[2]  Hongmei Gou,et al.  Data hiding in curves with application to fingerprinting maps , 2005, IEEE Transactions on Signal Processing.

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

[4]  Ioannis Pitas,et al.  Watermarking Polygonal Lines Using Fourier Descriptors , 2004, IEEE Computer Graphics and Applications.

[5]  N. Nikolaidis,et al.  Watermarking polygonal lines using Fourier descriptors , 2004, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

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

[7]  DAVID G. KENDALL,et al.  Introduction to Mathematical Statistics , 1947, Nature.