Abstract
The loss of synchronization caused by geometrical modifications of an image, such as cropping, rotation and scaling, increases the difficulty of watermark detection, especially for block-based watermarking schemes. In this research, we consider an algorithm to embed an invisible grid structure into watermarked images to overcome this problem. A fixed-size two-dimensional pseudo-random pattern is repeatedly embedded along horizontal and vertical directions of an image after the watermark is embedded in the image. In watermark detection, the affine matrix as well as horizontal/vertical shifts associated with certain geometrical attacks are determined by calculating the auto-correlation of the extracted grid structure and the cross-correlation between the folded grid and the embedded pattern. Synchronization is then recovered, and the watermark can be more easily detected. The applicability and advantages of the proposed algorithm are demonstrated by experimental results.
Original language | English |
---|---|
Pages (from-to) | 406-417 |
Number of pages | 12 |
Journal | Proceedings of SPIE - The International Society for Optical Engineering |
Volume | 4314 |
DOIs | |
State | Published - 2001 |
Event | Security and Watermarking of Multimedia Contents III - San Jose, CA, United States Duration: 22 Jan 2001 → 25 Jan 2001 |
Keywords
- Affine transform
- Block-based watermark
- Discrete cosine transform
- Geometrical attack
- Watermark detection
- Watermark embedding