Time-Frequency and Time-Scale-Based Fragile Watermarking Methods for Image Authentication
© B. Barkat and F. Sattar. 2010
Received: 14 February 2010
Accepted: 30 July 2010
Published: 9 August 2010
Two fragile image watermarking methods are proposed for image authentication. The first method is based on time-frequency analysis and the second one is based on time-scale analysis. For the first method, the watermark is chosen as an arbitrary nonstationary signal with a particular signature in the time-frequency plane. Experimental results show that this technique is very sensitive to many attacks such as cropping, scaling, translation, JPEG compression, and rotation, making it very effective in image authentication. For the second method, based on a wavelet-domain multiresolution analysis, quantization index modulation (QIM) embedding scheme and arbitrary frequency-modulated (FM) chirp watermarks are used in the implementation. In this blind technique, the original watermark is needed neither for the content integrity verification of the original image nor for the content quality assessment of the distorted image.
Watermarking techniques are developed for the protection of intellectual property rights. They can be used in various areas, including broadcast monitoring, proof of ownership, transaction tracking, content authentication, and copy control . In the last two decades a number of watermarking techniques have been developed [2–10]. The requirement(s) that a particular watermarking scheme needs to fulfill depend(s) on the application purpose(s). In this paper, we focus on the authentication of images. In image authentication, there are basically two main objectives: (i) the verification of the image ownership and (ii) the detection of any forgery of the original data. Specifically, in the authentication, we check whether the embedded information (i.e., the invisible watermark) has been altered or not in the receiver side.
Fragile watermarking is a powerful image content authentication tool [1, 7, 8, 11]. It is used to detect any possible change that may have occurred in the original image. A fragile watermark is readily destroyed if the watermarked image has been slightly modified. As an early work on image authentication, Friedman proposed a trusted digital camera, which embeds a digital signature for each captured image . In , Yeung and Mintzer proposed an authentication watermark that uses a pseudorandom sequence and a modified error diffusion method to protect the integrity of the images. Wong and Memon proposed a secret and a public key image watermarking scheme for authentication of grayscale images . A secure watermark based on chaotic sequence was used for JPEG image authentication in . A statistical multiscale fragile watermarking approach based on a Gaussian mixture model was proposed in . Many more fragile watermarking techniques can be found in the literature.
Most of the existing image watermarking methods are based on either spatial domain techniques or frequency domain techniques. Only few methods are based on a joint spatial-frequency domain techniques [15, 16] or a joint time-frequency domain techniques [9, 17]. The approach in  uses the projections of the 2D Radon-Wigner distribution in order to achieve the watermark detection. This watermarking technique requires the knowledge of the Radon-Wigner distribution of the original image in the detection process. In , the watermark detection is based on the correlation between the 2D STFT of the watermarked image and that of the watermark image for each image pixel. In [9, 17], the Wigner distribution of the image is added to the time-frequency watermark. In this technique the detector requires access to the Wigner distribution of the original image.
In this paper, we propose two different private fragile watermarking methods: the first one is based on a time-frequency analysis, the other one is based on a time-scale analysis. Firstly, in the time-frequency-based method the fragile watermark consists of an arbitrary nonstationary signal with a particular signature in the time-frequency domain. The length (in samples) of the nonstationary signal, used as a watermark, can be chosen equal up to the total number of pixels in the image under consideration. That is, for a given image size, we are able to embed a watermark signal of size less or equal to samples. For simplicity, and without loss of generality, we consider in the sequel a square image of size and the nonstationary signal of length samples only. The locations of the image pixels used to embed the watermark samples can be chosen arbitrarily. In what follows, we choose to embed the watermark in the diagonal pixels of the image. Alternative pixel locations can also be considered. Moreover, a pseudonoise (PN) sequence can be used as a secret key to modulate the watermark signal, making the time-frequency signature harder to perceive or to modify. In the extraction process, not all pixels of the original image are needed to recover the watermark but only those pixels where the watermark has been embedded. Here, these original pixels are inserted in the watermarked image itself. At the receiver, it is assumed that the legal user knows the locations of the watermark samples as well as the locations of the corresponding original pixels and the secret key (if used). If, for any reason, the original pixels are not inserted in the watermarked image, they still need to be known by the legal user for the detection purpose. Once the watermark is extracted, its time-frequency representation is used to certify the original ownership of the image and verify whether it has been modified or not. If the watermarked image has been attacked or modified, the time-frequency signature of the extracted watermark would also be modified significantly, as it will be shown in coming sections.
The second proposed fragile watermarking method, based on wavelet analysis, uses complex chirp signals as watermarks. The advantages of using complex chirp signals as watermarks are manyfold, among these one can cite (i) the wide frequency range of such signals making the watermarking capacity very high and (ii) the easiness in adjusting the FM/AM parameters to generate different watermarks. In this technique, the wavelet transformation decomposes the host image hierarchically into a series of successively lower resolution reference images and their associated detail images. The low resolution image and the detail images including the horizontal, vertical, and diagonal details contain the information to reconstruct the reference image of the next higher resolution level. The detection does not require the original image, instead it uses the special feature of the extracted complex chirp watermark signal for content authentication.
Before concluding this section, we should observe that due to its inherent hierarchical structure, the wavelet-based watermarking method provides a higher level of security, and a more precise localization of any tampering (that may occur) in the watermarked image. On the other hand, the advantage of the time-frequency-based watermarking method, compared to the proposed time-scale one, lies in its simplicity and its possibility to use a larger class of nonstationary signals as watermarks.
The paper is organized as follows. In Sections 2 and 3, we give a brief review of time-frequency analysis, introduce the time-frequency based watermarking method, and discuss its performance through some selected examples. In Section 4, we present a brief review of the discrete wavelet transform and introduce the wavelet based watermarking method. In Section 5, we discuss the performance of the second method through two applications: the content integrity verification with tamper localization capability and the quality assessment of the watermarked image. Section 6 concludes the paper.
2. Method I: Proposed Fragile Watermarking Based on Time-Frequency Analysis
2.1. Brief Review of Time-Frequency Analysis
Note that, theoretically, we have an infinite number of possibilities to generate a quadratic FM. This could be accomplished by just choosing different combinations of values for , and . In the sequel, we will select a particular quadratic FM signal, with arbitrary start and stop times, as a watermark for our application. We emphasize here that other nonstationary signals are also feasible to choose and select.
2.2. Watermark Embedding and Extraction
We stress again that (i) the number of image pixels used to embed the watermark signal samples, and (ii) their locations in the original image can be chosen arbitrarily. Indeed, we can choose to embed all image pixels by just selecting an equal number of samples for the watermark signal. However, this number and the corresponding pixels locations used must be known to the legal user of the data.
To extract the watermark, we need to remove the quadratic FM samples from the diagonal pixels of the watermarked image. For that, we need the values of the original image pixels at those particular positions. These original pixels should be known to a legal user. They could be transmitted independently or they can be transmitted in the watermarked image itself. For instance, in the watermarked image in Figure 3, we have inserted these original pixels in the watermarked image. We have done this by augmenting the watermarked image to an image of size and allocated the upper diagonal whose elements are indexed by , to contain the required original pixels. Obviously, any other locations (in the watermarked image) can alternatively be used to insert the original pixels. Similarly, if the PN sequence is used, it should also be known to the legal user at the receiving end in order to extract the watermark. This sequence can also be transmitted independently or hidden in the watermark itself (using a similar procedure to the one used for the needed original pixels). Once, we have extracted the watermark samples, we use a time-frequency distribution (TFD) to analyse their content.
3. Results and Performance for Method I
In this section, we evaluate the performance of the proposed fragile watermarking method. For that, we consider the time-frequency analysis of the extracted watermark when the watermarked image has been subjected to some common attacks such as cropping, scaling, translation, rotation, and JPEG compression.
For the cropping, we choose to crop only the first row of pixels of the watermarked image (leaving all the other rows untouched); for the scaling we choose the factor value 1.1; for the translation we choose to translate the whole watermarked image by only 1 column to the right; for the rotation we rotate the whole watermarked image by anticlockwise; for the compression we choose a JPEG compression at quality level equal to 99%. Visually, the effect of these attacks on the watermarked image is unnoticeable. This is because the chosen values are very close to the values 1 (i.e., no scaling), 0 (i.e., no translation), 1 (i.e., slight rotation), and 100% (i.e., no compression). For space limitations, the various attacked watermarked images are not shown here (they look very similar to the unattacked watermarked image displayed in Figure 3).
Similarity measure between the TFD of the original watermark and that of the extracted watermark, when the watermarked image is subjected to various attacks.
Type of Attack
Scaling (factor 1.1)
JPEG (QF = 99%)
It is worth observing that any attack on the watermarked image that (i) does not affect any of the pixels where the watermark signal is embedded and, in addition, (ii) does not result in the relocation of any of these embedded pixels from its original position when it was watermarked, will not be detected at the receiver end. However, this situation can be easily avoided by increasing the watermark nonstationary signal length to watermark a larger number of the original image pixels. As stated above, the length of the watermark signal can be chosen equal up to the total number of the pixels of the unwatermarked original image.
4. Method II: Proposed Fragile Watermarking Based on Time-Scale Analysis
In this proposed fragile multiresolution watermarking scheme a complex FM chirp signal will be embedded, using a wavelet analysis, in the original image.
A discrete wavelet transform is used to decompose the original image into a series of successively lower resolution reference images and their associated detail images. The low-resolution image and the detail images, including the horizontal, vertical, and diagonal details, contain the information needed to reconstruct the reference image at the next higher resolution level.
4.1. Brief Review of the Discrete Wavelet Transform (DWT)
where represents the low-pass filter, the high-pass filter, the DWT decomposition level, and the input image with .
4.2. Proposed Multiresolution Watermark Embedding Scheme
Step 1 (discrete wavelet transform of the original image).
A level (in the following analysis we use = 3) DWT of the original image is performed using Harr bases. The obtained wavelet coefficients are denoted as .
Step 2 (generation of the watermark bits).
Every value of the real part, , and every value of the imaginary part, , of the unitary amplitude watermark complex sample, , is quantized into an integer value from 0 to 127. Each of the quantization values is digitally coded using a 7-bit digital code.
Specifically, a given real part value , is digitally coded into a 7-bit code labeled , where represents one of the 7 digit positions in this 7-bit code (i.e., takes of the values from 1 to 7). In a similar way, a given imaginary part value , is digitally coded into a 7-bit code labeled
Step 3 (generation of the key).
A random sequence is generated and used to randomly select the various image pixels to be used in the watermarking process.
Step 4 (procedure to embed the watermark).
Step 5 (inverse wavelet transform).
The final watermarked image is obtained by an inverse DWT of , using Harr bases.
4.3. An Illustrative Example
In our Lena example, the PSNR of the watermarked image displayed in Figure 11(b) is found to be equal to 45.97 dB.
4.4. Watermark Extraction and Performance Against Attacks
4.4.1. Watermark Extraction Procedure
This section presents the procedure to extract the watermark at the receiver end. We observe that the extraction procedure is blind. That is, neither the original unwatermarked image nor the original watermark are required in the extraction and verification stages. However, the legal user needs to know the key used in the random permutation for the embedding locations, the wavelet type, the values of the quantization parameter , and the quantization function .
Step 1 (DWT of the received image).
The received image denoted as , could be the watermarked image or the watermarked image altered by attacks. A level (the same as that used in the embedding process) DWT of the received image is performed using Harr bases. The resulting wavelet coefficients are denoted as .
Step 2 (Extraction of the watermark bits).
where and are the extracted real part and imaginary part of the complex watermark signal sample at time instant .
Without resorting to the original watermark, the image content authentication can be performed by simply evaluating the magnitude of the extracted chirp watermark signal. This magnitude should be constant and equal to unity since our original watermark is an FM complex chirp signal with magnitude that is equal to one.
4.4.2. Performance Against Attacks
JPEG compression of quality factors 90%, 80%, 70%, 60%, 50%, and 40%;
histogram equalization (uniform distortion);
sharpening (low-pass filtering)—processed by Adobe Photoshop 7.0;
blurring (high-pass filtering)—processed by Adobe Photoshop 7.0;
additive Gaussian noise (variance = 0.01);
Salt-and-pepper noise (This type of noise is typically seen on images with impulse noise model and represents itself as randomly occurring white and black pixels with value set to 255 or 0, resp.).
where is the number of bits in error and is the total number of watermark bits used in the watermarking process.
Bit error rate (BER) values of the extracted watermarks obtained for the JPEG compression attacks for various values of the quality factor (QF), and at each DWT level .
Example: Lena image
Bit error rate (BER) values of the extracted watermarks obtained for other types of attacks, and at each DWT level .
Example: Lena image
Peak signal-to-noise ratio (PSNR) values (in dB) of the distorted watermarked Lena image when subjected to various attacks.
Example: Lena image
JPEG comp. 90%
JPEG comp. 80%
JPEG comp. 70%
JPEG comp. 60%
JPEG comp. 50%
JPEG comp. 40%
We note that the watermark embedded in a higher decomposition level (low frequency band) has better resistance against distortions. Also, note that the embedded watermark can be fully recovered without any bit error when there is no attack.
5. Performance Study for Method II
In this section we demonstrate the performance of the wavelet-based watermarking method through two applications. In the first application we study the content integrity verification with localization capability. In the second application, we study the quality assessment of the watermarked content by investigating the extracted complex chirp watermark in the absence of the original watermark.
5.1. Content Integrity Verification without Resorting to the Original Watermark
Here we present how to check the integrity of the watermarked image content, and how to localize any tamper in the image, without knowing the original watermark. Specifically, our aim is to detect and locate any malicious change, such as feature adding, cropping, and replacement that may have occurred in the watermarked image. The detection is performed by simply extracting the watermark complex chirp signal and, then, evaluating its magnitude. Recall that this magnitude should be constant and equal to unity if the watermarked image has not been subjected to any attack.
Now we assume that the Lena image has been subjected to an attack. First, we consider that the attack has occurred in one single block. Then, we generalize the assumption to multiple blocks.
5.1.1. Tamper in a Single Authentication Block
5.1.2. Tampers in Multiple Authentication Blocks
Here, we assume that the watermarked Lena image is altered in more than one authentication blocks.
5.2. Quality Assessment of the Proposed Method II
where denotes the magnitude of the th extracted watermark sample, and is the number of watermark samples embedded in the image.
Note that the further is the extracted watermark signal from the original watermark one, the larger is the value of the MSE, and, consequently, the smaller is the value of the SNR.
Quality assessment using the mean square error (MSE) and the signal-to-noise ratio (SNR) of the extracted watermark signal, when the watermarked Lena image is JPEG compressed, using various compression quality factor values.
In the same table, we also show the PSNR values obtained in this case. These values confirm the degradation of the attacked image with decreasing JPEG quality factor.
We note that the MSE obtained for the JPEG compression quality factor 100% (i.e., no attack) is nonzero. This is due to the quantization noise (refer to earlier sections), and can be reduced by reducing the quantization step used in the watermarking procedure.
Quality assessment using the mean square error (MSE) and the signal-to-noise ratio (SNR) of the extracted watermark signal, when the watermarked Lena image is altered by various attacks.
In this paper, we proposed two fragile watermarking methods for still images. The first method uses time-frequency analysis and the second one uses time-scale analysis. In the first method, the watermark consists of an arbitrary nonstationary signal with a particular signature in the time-frequency plane. This method can allow the use of a secret key to enhance the security and privacy. To verify the image ownership and to check whether it has been subjected to any attack, we exploit the particular signature of the watermark in the time-frequency domain. The advantages of this method are twofold: (i) we can detect any change that results from an attack such as rotation, scaling, translation, and compression and (ii) the watermarked image quality is retained quite high because only few pixels of the original image are used in the watermarking process. In the second proposed method, an arbitrary complex FM signal is embedded in the wavelet domain. This method was shown to be very effective, in terms of sensitivity of the hidden fragile watermark, when the watermarked image is subjected to various attacks. A nice feature of this second method is that the watermark extraction is performed without the need for the original watermark. Two potential applications are presented to demonstrate the high performance of this proposed method. The first application deals with a content integrity verification without restoring to the original watermark and the second application deals with a blind quality assessment of the received watermarked image.
- Cox IJ, Miller ML, Bloom JA: Digital Watermarking. Morgan Kaufmann, San Mateo, Calif, USA; 2002. An Imprint of Academic PressGoogle Scholar
- Lee S-J, Jung S-H: A survey of watermarking techniques applied to multimedia. Proceedings of the IEEE International Symposium on Industrial Electronics (ISIE '01), June 2001 272-277.Google Scholar
- Wang H, Liao C: JPEG images authentication with discrimination of tampers on the image content or watermark. IETE Technical Review 2010, 27(3):244-251. 10.4103/0256-4602.62787View ArticleGoogle Scholar
- Wang C-C, Hsu Y-C: New watermarking algorithm with data authentication and reduction for JPEG image. Journal of Electronic Imaging 2008., 17(3, article no. 033009):
- Suthaharan S: Fragile image watermarking using a gradient image for improved localization and security. Pattern Recognition Letters 2004, 25(16):1893-1903. 10.1016/j.patrec.2004.08.017View ArticleGoogle Scholar
- Yuan H, Zhang X-P: Multiscale fragile watermarking based on the Gaussian mixture model. IEEE Transactions on Image Processing 2006, 15(10):3189-3200.View ArticleGoogle Scholar
- Wang C-C, Hsu YC: Fragile watermarking scheme for H.264 video authentication. Optical Engineering 2010., 49(2):
- MeenakshiDevi P, Venkatesan M, Duraiswamy K: A fragile watermarking scheme for image authentication with tamper localization using integer wavelet transform. Journal of Computer Science 2009, 5(11):831-837.View ArticleGoogle Scholar
- Zhang Y, Mobasseri BG, Dogahe BM, Amin MG: Image-adaptive watermarking using 2D chirps. Signal, Image and Video Processing 2010, 4(1):105-121. 10.1007/s11760-008-0102-3View ArticleGoogle Scholar
- Le L, Krishnan S: Time-frequency signal synthesis and its application in multimedia watermark detection. Eurasip Journal on Applied Signal Processing 2006, 2006:-14.Google Scholar
- Zhang X, Wang S: Fragile watermarking scheme using a hierarchical mechanism. Signal Processing 2009, 89(4):675-679. 10.1016/j.sigpro.2008.10.001View ArticleMATHGoogle Scholar
- Friedman GL: Trustworthy digital camera: restoring credibility to the photographic image. IEEE Transactions on Consumer Electronics 1993, 39(4):905-910. 10.1109/30.267415View ArticleGoogle Scholar
- Yeung MM, Mintzer F: Invisible watermarking technique for image verification. Proceedings of the International Conference on Image Processing (ICIP' 97), October 1997 2: 680-682.View ArticleGoogle Scholar
- Wong PW, Memon N: Secret and public key image watermarking schemes for image authentication and ownership verification. IEEE Transactions on Image Processing 2001, 10(10):1593-1601. 10.1109/83.951543View ArticleMATHGoogle Scholar
- Stanković S, Djurović I, Pitas L: Watermarking in the space/spatial-frequency domain using two-dimensional Radon-Wigner distribution. IEEE Transactions on Image Processing 2001, 10(4):650-658. 10.1109/83.913599View ArticleMATHGoogle Scholar
- Stankovic S, Orovic I, Zaric N: An application of multidimensional time-frequency analysis as a base for the unified watermarking approach. IEEE Transactions on Image Processing 2010, 19(3):736-745.MathSciNetView ArticleGoogle Scholar
- Mobasseri BG: Digital watermarking in joint time-frequency domain. Proceedings of the International Conference on Image Processing (ICIP '02), September 2002 481-484.Google Scholar
- Hlawatsch F, Boudreaux-Bartels GF: Linear and quadratic time-frequency signal representations. IEEE Signal Processing Magazine 1992, 9(2):21-67. 10.1109/79.127284View ArticleGoogle Scholar
- Choi H, Williams WJ: Improved time-frequency representation of multicomponent signals using exponential kernels. IEEE Transactions on Acoustics, Speech, and Signal Processing 1989, 37(6):862-871. 10.1109/ASSP.1989.28057View ArticleGoogle Scholar
- Jeong J, Williams WJ: Kernel design for reduced interference distributions. IEEE Transactions on Signal Processing 1992, 40(2):402-412. 10.1109/78.124950View ArticleGoogle Scholar
- Mallat S: A Wavelet Tour of Signal Processing. Academic Press, Amsterdam, The Netherlands; 1999.MATHGoogle Scholar
- Lin L: A survey of digital watermarking technologies. Stoney Brook University, New York, NY, USA; 2005.Google Scholar
- Kundur D, Hatzinakos D: Digital watermarking for telltale tamper proofing and authentication. Proceedings of the IEEE 1999, 87(7):1167-1180. 10.1109/5.771070View ArticleGoogle Scholar
- Lim JS: Two-Dimensional Signal and Image Processing. Prentice Hall Publishers, Upper Saddle River, NJ, USA; 2001.Google Scholar
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.