Scale-invariant image watermarking via optimization algorithms for quantizing randomized statistics

ABSTRACT

We introduce a novel approach for blind and semi-blind watermarking and apply it to images. We derive randomized robust semi-global features of images in a suitable transform domain (wavelets in case of images) and quantize them in order to embed the watermark. Quantization is carried out by embedding to the host a computed sequence via solving an optimization problem whose parameters are known to the information hider, but unknown to the attacker. The image features are rationa statistics of pseudo-random regions; these statistics are by construction invariant against scaling attacks and approximately invariant against several contrast enhancement modifications (such as histogram equalization). This scheme can be seen as an improved version of our previous image watermarking algorithm [1].

REFERENCES

• 1: M. K. Mihçak, R. Venkatesan, and M. Kesal, "Watermarking via optimization algorithms for quantizing randomized statistics of image regions," in Proc. 40th Annual Allerton Conf. on Communication, Control and Computing Monticello, Illinois, October 2002.
• 2: Fabien A. P. Petitcolas , Ross J. Anderson , Markus G. Kuhn, Attacks on Copyright Marking Systems, Proceedings of the Second International Workshop on Information Hiding, p.218-238, April 14-17, 1998
• 3: R. Venkatesan, S. Koon, M. Jakubowski, and P. Moulin, "Robust Image Hashing," in Proc. Int. Conf. Image Processing Vancouver, Canada, September 2000.
• 4: T. Liu and P. Moulin, "Error exponents for one-bit watermarking," in Proc. Int. Conf. Acoustics, Speech, and Signal Processing Hong Kong, April 2003.
• 5: M. K. Mihçak and P. Moulin, "Information embedding codes matched to ocally stationary Guassian image models," in Proc. Int. Conf. Image Processing Rochester, New York, September 2002.

INDEX TERMS

Primary Classification:
  E. Data
  E.0 GENERAL

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.0 General
          Subjects: Security and protection (e.g., firewalls)

  G. Mathematics of Computing
  G.3 PROBABILITY AND STATISTICS
      Subjects: Probabilistic algorithms (including Monte Carlo)

  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.0 General
  H.4 INFORMATION SYSTEMS APPLICATIONS

General Terms:
Algorithms, Security, Theory

Keywords:
cryptanalysis, mark embedding, optimization, quantization, randomized statistics, security, verification, watermarking