Geometric hashing techniques for watermarking

In this paper we introduce the idea of using computer vision techniques for improving and enhancing watermarking capabilities. Specifically, we incorporate geometric hashing techniques into the watermarking methodology. Geometric hashing was developed to detect objects in a visual scene under a class of geometric transformations. The technique is incorporated into watermarking to detect watermarks encoded under transformations. This allows randomization of the watermark code without the need of maintaining the random generator seed. In turn, this randomization increases robustness under attacks such as collusion (determining the watermark from multiple watermarked examples). Depending on the embedding domain, robustness of the watermark under geometric attacks can be achieved.

[1]  Iwan Setyawan,et al.  Watermarking digital image and video data. A state-of-the-art overview , 2000 .

[2]  Walter Bender,et al.  Techniques for data hiding , 1995, Electronic Imaging.

[3]  I. Rigoutsos,et al.  Geometric Hashing , 1997, IEEE Computational Science and Engineering.

[4]  Ioannis Pitas,et al.  Image watermarking using DCT domain constraints , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[5]  Haim J. Wolfson,et al.  Geometric hashing: an overview , 1997 .

[6]  Hagit Hel-Or,et al.  Multi-level watermarking with independent decoding , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[7]  Yehezkel Lamdan,et al.  On the error analysis of 'geometric hashing' , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.