Analysis of pilot-based synchronization algorithms for watermarking of still images

Abstract In this paper we present an analytical approach to pilot-based synchronization algorithms for data hiding in still images. A representative algorithm belonging to the family of those exploiting a regular structure in the spreading sequence is chosen for study. We improve it by proposing the use of the Levenberg–Marquardt's method for nonlinear least-squares estimation, and show how an estimate of the geometrical transformation parameters can be obtained. A statistical model for the estimation error in the parameters is derived and theoretically justified. This allows to quantify the resolution of the algorithm for a certain watermark structure. Moreover, the increase in the bit error probability of the hidden information for a given transformation and interpolation scheme is theoretically analyzed and quantified. Finally, we provide experimental results that support our analysis.

[1]  Thierry Pun,et al.  Second Generation Benchmarking and Application Oriented Evaluation , 2001, Information Hiding.

[2]  Juan R. Hern,et al.  Statistical Analysis of Watermarking Schemes for Copyright Protection of Images , 1999 .

[3]  M. Kutter.  Watermaking resisting to translation, rotation, and scaling , 1998 .

[4]  Thierry Pun,et al.  Attack modelling: towards a second generation watermarking benchmark , 2001, Signal Process..

[5]  Gabriela Csurka,et al.  Template based recovery of Fourier-based watermarks using log-polar and log-log maps , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[6]  Jorge Herbert de Lira,et al.  Two-Dimensional Signal and Image Processing , 1989 .

[7]  Thierry Pun,et al.  Rotation, scale and translation invariant spread spectrum digital image watermarking , 1998, Signal Process..

[8]  Martin Kutter,et al.  Watermarking resistance to translation, rotation, and scaling , 1999, Other Conferences.

[9]  Thierry Pun,et al.  Fast Robust Template Matching for Affine Resistant Image Watermarks , 1999, Information Hiding.

[10]  Thierry Pun,et al.  Robust template matching for affine resistant image watermarks , 2000, IEEE Trans. Image Process..

[11]  Fabien A. P. Petitcolas,et al.  Fair benchmark for image watermarking systems , 1999, Electronic Imaging.

[12]  Arun N. Netravali,et al.  Digital Pictures: Representation, Compression and Standards , 1995 .

[13]  Thierry Pun,et al.  Generalized watermarking attack based on watermark estimation and perceptual remodulation , 2000, Electronic Imaging.

[14]  Fernando Pérez-González,et al.  Approaching the capacity limit in image watermarking: a perspective on coding techniques for data hiding applications , 2001, Signal Process..

[15]  Jean-Luc Dugelay,et al.  Possible counter-attacks against random geometric distortions , 2000, Electronic Imaging.

[16]  R. Keys.  Cubic convolution interpolation for digital image processing , 1981 .

[17]  Stephen J. Wright,et al.  Numerical Optimization (Springer Series in Operations Research and Financial Engineering) , 2000 .

[18]  Sviatoslav Voloshynovskiy,et al.  Watermark template attack , 2001, IS&T/SPIE Electronic Imaging.

[19]  Fernando Pérez-González,et al.  Performance analysis of a 2-D-multipulse amplitude modulation scheme for data hiding and watermarking of still images , 1998, IEEE J. Sel. Areas Commun..

[20]  Markus G. Kuhn,et al.  Attacks on Copyright Marking Systems , 1998, Information Hiding.

[21]  Thierry Pun,et al.  Multibit digital watermarking robust against local nonlinear geometrical distortions , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[22]  Jae S. Lim,et al.  Two-Dimensional Signal and Image Processing , 1989 .

[23]  Gabriela Csurka,et al.  A Bayesian Approach to Affine Transformation Resistant Image and Video Watermarking , 1999, Information Hiding.