A Desynchronization Resilient Watermarking Scheme

  • Authors:
  • Xiaojun Qi;Ji Qi

  • Affiliations:
  • Department of Computer Science, Utah State University, Logan 84322-4205;Department of Computer Science, Utah State University, Logan 84322-4205

  • Venue:
  • Transactions on Data Hiding and Multimedia Security IV
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a content-based desynchronization resistant digital image watermarking scheme. The image content is represented by strong important feature points obtained by our robust and improved Harris corner detector. These feature points are more resistant to geometric attacks and are therefore used by the Delaunay triangle matching and image restoration method to reduce synchronization errors. The spread-spectrum-based blind watermark embedding and retrieval scheme is applied in the Fourier domain of each perceptually highly textured subimage. The multiplicative scheme is then used to embed the same copy of the watermark at highly secure mid-frequency positions generated by one-way hash functions with different secret keys. The watermark detection decision is based on the number of matched bits between the recovered and embedded watermarks in embedding subimages. Experimental results demonstrate that our scheme is more robust to desynchronization attacks (i.e., geometric and common image processing attacks) than other peer feature-based approaches.