Robust digital image-in-image watermarking algorithm using the fast Hadamard transform

Anthony Tung Shuen Ho; Jun Shen; Soon Hie Tan

doi:10.1117/12.451250

30 January 2003 Robust digital image-in-image watermarking algorithm using the fast Hadamard transform

Anthony Tung Shuen Ho, Jun Shen, Soon Hie Tan

Proceedings Volume 4793, Mathematics of Data/Image Coding, Compression, and Encryption V, with Applications; (2003) https://doi.org/10.1117/12.451250
Event: International Symposium on Optical Science and Technology, 2002, Seattle, WA, United States

Abstract

In this paper, we propose a robust image-in-image watermarking algorithm based on the fast Hadamard transform (FHT) for the copyright protection of digital images. Most current research makes use of a normally distributed random vector as a watermark and where the watermark can only be detected by cross-correlating the received coefficients with the watermark generated by secret key and then comparing an experimental threshold value. However, the FHT image-in-image method involves a "blind" watermarking process that retrieves the watermark without the need for an original image present. In the proposed approach, a number of pseudorandom selected 8×8 sub-blocks of original image and a watermark image are decomposed into Hadamard coefficients. To increase the invisibility of the watermark, a visual model based on original image characteristics, such as edges and textures are incorporated to determine the watermarking strength factor. All the AC Hadamard coefficients of watermark image is scaled by the watermarking strength factor and inserted into several middle and high frequency AC components of the Hadamard coefficients from the sub-blocks of original image. To further increase the reliability of the watermarking against the common geometric distortions, such as rotation and scaling, a post-processing technique is proposed. Understanding the type of distortion provides a mean to apply a reversal of the attack on the watermarked image, enabling the restoration to the synchronization of the embedding positions. The performance of the proposed algorithm is evaluated using Stirmark. The experiment uses container image of size 512×512×8bits and the watermark image of size 64×64×8bits. It survives about 60% of all Stirmark attacks. The simplicity of Hadamard transform offers a significant advantage in shorter processing time and ease of hardware implementation than the commonly used DCT and DWT techniques.

Citation Download Citation

Anthony Tung Shuen Ho, Jun Shen, and Soon Hie Tan "Robust digital image-in-image watermarking algorithm using the fast Hadamard transform", Proc. SPIE 4793, Mathematics of Data/Image Coding, Compression, and Encryption V, with Applications, (30 January 2003); https://doi.org/10.1117/12.451250

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available