# Wavelet-Based Color Pathological Image Watermark through Dynamically Adjusting the Embedding Intensity

Authors: Guoyan Liu; Hongjun Liu; Abdurahman Kadir
Journal: Computational and Mathematical Methods in Medicine
 (2012)

---

## Abstract

This paper proposes a new dynamic and robust blind watermarking scheme for color pathological image based on discrete wavelet transform (DWT). The binary watermark image is preprocessed before embedding; firstly it is scrambled by Arnold cat map and then encrypted by pseudorandom sequence generated by robust chaotic map. The host image is divided inton×n  blocks, and the encrypted watermark is embedded into the higher frequency domain of blue component. The mean and variance of the subbands are calculated, to dynamically modify the wavelet coefficient of a block according to the embedded 0 or 1, so as to generate the detection threshold. We research the relationship between embedding intensity and threshold and give the effective range of the threshold to extract the watermark. Experimental results show that the scheme can resist against common distortions, especially getting advantage over JPEG compression, additive noise, brightening, rotation, and cropping.


---

## Body

## 1. Introduction

For content owners and distributors, there emerged a necessary concern in regard to the content authentication of pathological images as well as copyright protection. A latent solution to this issue is bestowed by digital watermarking. In general, image watermarking can be divided into two categories, according to the processing domain of cover images where the watermark is embedded: (1) the spatial domain method, which directly modifies the intensity value of the image and these algorithms are simple and speedy but not robust; (2) the frequency domain method, which is to modify the frequency coefficients.In recent years, chaos is employed to encrypt the image, for it has sensitive dependence on initial conditions and can be employed to generate pseudorandom sequences, so the algorithm has large key space. Shyamsunder  and Kaliyaperumal [1] proposed an image encryption scheme, which incorporates the concept of modular arithmetic and chaos theory. A necessary random matrix is generated for image encryption, and the look-up table is used to find the element by modular inverse of the random matrix for decryption. Rawat and Raman [2] proposed a chaos-based watermarking scheme for image authentication and tamper detection. Their scheme can detect any modification made to the image and can also indicate the specific locations that have been modified. To improve the security of the proposed scheme, two chaotic maps are employed. Li et al. [3] used logistic system and Chebyshev maps to construct a hybrid chaotic mapping system, the aim is to set risk transfer, process and improve risk management efficiency in projects management. That is a good case for applying chaos in enterprise management.The DWT approach remains one of the most effective ways for image watermarking. Lin et al. [4] proposed a blind watermarking algorithm based on maximum wavelet coefficient quantization; the blocks are randomly selected from different subbands, by adding different energies to the maximum wavelet coefficient to embed the watermark. The wavelet functions will analyze image features such as edges and borders through good space-frequency localization. They are used in several fields: image compression, signal denoising, image smoothing, and texture analysis. The main advantages of embedding watermarks in the DWT can be found in [5, 6].The most important issue in DWT-based image watermarking is how to choose the effective coefficients to be embedded and extracted. Liu [7] estimates the noise detection threshold of each wavelet coefficient in luminance and chrominance components of color image. The thresholds are derived into a locally dynamic fashion based on the wavelet decomposition, through which the perceptually significant coefficients are selected for embedding watermark. Al-Otum and Samara [8] proposed a watermark scheme based on the wavelet trees, which exploits the significant features and relations between the color pixel components in the wavelet domain. The watermark is embedded by spreading it that the interpixel robust relations carry the watermark bit sign with sufficient energy. Zhang et al. [9] proposed an adaptive block-based for embedding binary watermark into grayscale image. In these articles, the watermark bits are only shuffled by pseudorandom sequence, they are not scrambled to uniformly, and randomly distributed in the host image, which will lead to be attacked easily. The threshold is a fixed experimental value, and the authors did not explain how to get the threshold.Horng et al. [10] proposed a blind watermarking algorithm based on the significant difference of wavelet coefficient quantization. The maximum wavelet coefficients are quantized that their significant difference between watermark bit 0 and 1 exhibits a large energy difference, which can be used for watermark extraction. An adaptive threshold is designed to extract the watermark.In this paper, we propose a dynamic blind watermarking scheme for color pathological image based on DWT; the watermark is scrambled firstly by Arnold cat map and XOR with pseudorandom sequence generated by Chebyshev map. The host image is divided inton×n blocks, and each bit of the encrypted watermark is embedded into the detail wavelet sub-band, that is, the higher-frequency domain of blue component. We modify the wavelet coefficient dynamically according to the mean and variance of the subbands to embed “0” or “1.” In addition, we research the relationship between the embedding intensity and the threshold and deduce the range of the threshold, by which to extract the watermark correctly.


## 2. Watermarking Algorithm

### 2.1. Preprocessing the Watermark Image

The watermark used for embedding is a binary logo image, which is very small in size compared to the host image. The watermark needs to be very small so that it is spatially localized and becomes robust against the intentional and unintentional attacks.For a binary logo image, in order to uniformly and randomly spread the bits over the host image, it is needed to be preprocessed, or the watermarked image cannot resist against even the simplest attack: cropping. The watermark can be preprocessed in numerous ways, such as randomly select the embedding position, generate pseudorandom sequences to shuffle these bits [11], or the original watermark itself is dynamically generated from a pseudorandom Gaussian sequence [12, 13].Here we take two measures to preprocess the watermark bits. Firstly, in order to make the watermarked image be more robust to resist against cropping attack, the two-dimensional Arnold cat map [14] is employed to scramble these binary bits. Suppose the watermark is an n×n binary image W; after scrambling, we get the binary image WA; the aim is to uniformly spread the watermark bits in the host image. By this means, the watermarked image can be more robust against cropping than the method in [7]. The iteration times t is served as one of the keys. The Arnold cat map can be described as follows:
(1)[xn+1yn+1]=[1112][xnyn]modn.Secondly, watermarks generated from low-pass chaotic signals have superior performance over other signal types [13]. In order to eliminate the statistical significance and make the numbers of 0 and 1 approximately equal, a pseudorandom sequence Sn∈{0,1} will be generated by the Chebyshev map.The expression of Chebyshev map is as follows:(2)zi+1=cos(w(arccoszi)),-1≤zi≤1,
where w is the degree of Chebyshev map. Its corresponding invariant density is as follows:
(3)ρ(z)=1(π1-z2).Chebyshev map has important properties of excellent cryptosystem [14, 15]. While w≥2, the Lyapunov exponent of the Chebyshev map is positive, which predicates that Chebyshev map is chaotic, as shown in Figure 1.The bifurcate and Lyapunov exponent figures of Chebyshev map.
(a)
The bifurcate image
(b)
The Lyapunov exponent imageDifferent sequences can be generated with different initial values; we get the sequenceSn∈{0,1} by
(4)Sn={0,zn∈[-1,0),1,zn∈[0,1].Finally, we can get the binary imageWAX by the XOR operation:
(5)WAX=WA⊕Sn,
which is a binary sequence to be embedded into the host image.The preprocessing process, including the original imageW, the scrambled image WA, and the image WAX, is shown in Figure 2.The preprocessing process of the original watermark.
(a)
Original watermark
(b)
Scrambled watermark
(c)
Watermark after XOR operation


### 2.2. Analysis of Wavelet  Coefficients

The host imageI of size w×h is transformed into wavelet coefficients using the L-level discrete wavelet transform (DWT). With L-level decomposition, we can get 3×l+1 subbands, as shown in Figure 3. The lowest band (approximation band) LLl is the basic band of the decomposed wavelet, which includes most of the energy from the original image; it has a crucial effect on quality; therefore, LLl frequency band is unsuitable to be modified.Figure 3
Wavelet subbands of 3-level.Only embedding the watermark intoHHl, HHl-1,…, HH1 subbands is also unsuitable, for they have the highest wavelet coefficients; the subbands can easily be eliminated and modified by lossy compression or other processing [14].According to these characteristics, we design to adaptively adjusting, the high-frequency coefficient of the subbandsHLl,  LHl, and HHl, to embed the watermark bits.Generally, watermark embedding is realized by modifying some special values of pixels or transforming domain coefficients [16]. When the watermarked image receives some attacks, though the quality is still high, the pixel value or coefficient may be seriously eliminated, which will lead to the watermark detecting failed [17, 18]. Here we take advantage of the statistic characteristic, such as mean and variance of the LHl, HLl, and HHl subbands, to modify the whole coefficients of them to dynamically embed the watermark and implement the compromise between quality and robustness.


### 2.3. Watermark Embedding

After preprocessing the binary watermark imageW to get WAX, we reshape WAX to binary sequence wm; its length is still n×n. According to Human Visual System (HVS) [19], small changes to the blue component of color image are the most difficult to detect by human eyes; then we select the blue component to embed.Here we improve the method in [9] to embed pre-processed watermark into the blue component of color image. Suppose the host color image is I. Firstly, we divide the blue component of I into a set of nonoverlapping n×n subblocks bj∈B, j=1,2,...,n2. Then a l-level DWT decomposition of each sub-block of image I is performed using Haar wavelet, and then compute the mean Ej of each wavelet block SD by
(6)Ej=1M(∑(x,y)∈SDcj(l,s)(x,y)),
where cj(l,s)(x,y) is the wavelet coefficient of the jth sub-block, l is the level of wavelet decomposition, s refers to the three subbands of LHl,  HLl and HHl. (x,y) is the coordinate for wavelet coefficient in the wavelet blocks, and M is the total number of wavelet coefficient in SD.For example, here we setl=2, for the jth sub-block b(j)∈B; we use the dwt2() function in Matlab to perform a single-level two-dimensional wavelet decomposition. Finally, cj(2,s)(x,y) can be gotten by (9)
(7)[LLj1,LHj1,HLj1,HHj1]=dwt2(b(j),′haar′),(8)[LLj2,LHj2,HLj2,HHj2]=dwt2(LLj1,′haar′),(9)cj(2,s)(x,y)=[LHj2,HLj2,HHj2].The purpose ofEj is to keep the average of cj(l,s)(x,y)-λEj in (10) and (11) close to zero.Ifwm(j)=1, we modify the whole wavelet coefficients in SD by
(10)cj′(l,s)(x,y)=cj(l,s)(x,y)-λEj.Ifwm(j)=0, we modify the whole wavelet coefficients in SD by
(11)cj′(l,s)(x,y)=cj(l,s)(x,y)-λEj+P.Herecj′(l,s)(x,y) is the modified wavelet coefficient; the distribution of wavelet coefficient is modulated by wm(j). s refers to the three detail subbands of LHl, HLl, and HHl. That is to say, embedding “0” means that the coefficient mean of wavelet block SD is P, and embedding “1” means 0. λ refers to the magnification of Ej; here we set λ=1.5 to ensure the range of threshold Th larger enough to extract the watermark.Because the variance is bigger in the textures and edges than that in the smooth region, we use the variance of the coefficient as the modulation coefficientP to control the dynamically embedding intensity [19]. Raising embedding intensity within the definition can enhance the robustness [15]. So P can be defined by
(12)P=A+T(j).T(j) is defined as
(13)T(j)=((∑(x,y)∈SD(cj(l,a)(x,y)-cj(l,b)(x,y))-λEj)2)β.We can find thatT(j) is the local variance of the jth wavelet sub-block except the approximate sub-band LLl, and β is a constant. In (12), A is the intensity coefficient, which ensures to embed some watermark in the smooth region while T(j) is approximately 0. So (11) can be fully expressed by (14). 								(14)cj′(l,s)(x,y)=cj(l,s)(x,y)-λEj+A+((∑(x,y)∈SD(cj(l,a)(x,y)-cj(l,b)(x,y))-λEj)2)β.Using (10) and (14) we embed watermark by modify the wavelet coefficients. Finally, the IDWT is applied to each block, to get the watermarked image Iw.


### 2.4. Watermark Extraction

The watermark can be extracted correctly from the watermarked image, without the original host image or the watermark image, so the scheme belongs to blind watermark algorithm. The transformed coefficients are compared with the thresholdTh of the coefficients, those coefficients above the threshold are retained, and all the others are discarded [20].The extracting process is as follows, which is mirroring the embedding process.Step 1.
We divide the blue component of the watermarked color imageI into a set of nonoverlapping n×n subblocks.Step 2.
To extract the embedded bit from a sub-block, theL-level DWT decomposition of each block is firstly obtained. Then we compute Sum(j), the coefficients sum of the wavelet block SD using
(15)Sum(j)=∑(x,y)∈SDc′j(l,s)(x,y).
For all the wavelet blocks ofj=1,2,...,n2,
(16)Sum(j)∈[r1,r2],ifSDcarriesbit“1",Sum(j)∈[r3,r4],ifSDcarriesbit“0",
where r1<r2<r3<r4, then we can get the range of Th∈(r2,r3).Step 3.
Sum
(
j
) is compared with the threshold Th, to decide whether the coefficient carries a bit “1” or “0” using
(17)wm(j)={1Sum(j)<Th,0Sum(j)≥Th,
where wm(j) is the extracted bit.Step 4.
Finally, the extracted watermark bits are recovered into a binary image according to the inverse process.
During the embedding and extracting processes, the iteration timest of Arnold transform, the initial value of Chebyshev map, the size n×n of each block, the values of A, λ, and β, the threshold Th, and the type of wavelet are all served as keys, which can guarantee the security of the watermarked image; it is impossible to extract the watermark without these keys.


## 2.1. Preprocessing the Watermark Image

The watermark used for embedding is a binary logo image, which is very small in size compared to the host image. The watermark needs to be very small so that it is spatially localized and becomes robust against the intentional and unintentional attacks.For a binary logo image, in order to uniformly and randomly spread the bits over the host image, it is needed to be preprocessed, or the watermarked image cannot resist against even the simplest attack: cropping. The watermark can be preprocessed in numerous ways, such as randomly select the embedding position, generate pseudorandom sequences to shuffle these bits [11], or the original watermark itself is dynamically generated from a pseudorandom Gaussian sequence [12, 13].Here we take two measures to preprocess the watermark bits. Firstly, in order to make the watermarked image be more robust to resist against cropping attack, the two-dimensional Arnold cat map [14] is employed to scramble these binary bits. Suppose the watermark is an n×n binary image W; after scrambling, we get the binary image WA; the aim is to uniformly spread the watermark bits in the host image. By this means, the watermarked image can be more robust against cropping than the method in [7]. The iteration times t is served as one of the keys. The Arnold cat map can be described as follows:
(1)[xn+1yn+1]=[1112][xnyn]modn.Secondly, watermarks generated from low-pass chaotic signals have superior performance over other signal types [13]. In order to eliminate the statistical significance and make the numbers of 0 and 1 approximately equal, a pseudorandom sequence Sn∈{0,1} will be generated by the Chebyshev map.The expression of Chebyshev map is as follows:(2)zi+1=cos(w(arccoszi)),-1≤zi≤1,
where w is the degree of Chebyshev map. Its corresponding invariant density is as follows:
(3)ρ(z)=1(π1-z2).Chebyshev map has important properties of excellent cryptosystem [14, 15]. While w≥2, the Lyapunov exponent of the Chebyshev map is positive, which predicates that Chebyshev map is chaotic, as shown in Figure 1.The bifurcate and Lyapunov exponent figures of Chebyshev map.
(a)
The bifurcate image
(b)
The Lyapunov exponent imageDifferent sequences can be generated with different initial values; we get the sequenceSn∈{0,1} by
(4)Sn={0,zn∈[-1,0),1,zn∈[0,1].Finally, we can get the binary imageWAX by the XOR operation:
(5)WAX=WA⊕Sn,
which is a binary sequence to be embedded into the host image.The preprocessing process, including the original imageW, the scrambled image WA, and the image WAX, is shown in Figure 2.The preprocessing process of the original watermark.
(a)
Original watermark
(b)
Scrambled watermark
(c)
Watermark after XOR operation


## 2.2. Analysis of Wavelet  Coefficients

The host imageI of size w×h is transformed into wavelet coefficients using the L-level discrete wavelet transform (DWT). With L-level decomposition, we can get 3×l+1 subbands, as shown in Figure 3. The lowest band (approximation band) LLl is the basic band of the decomposed wavelet, which includes most of the energy from the original image; it has a crucial effect on quality; therefore, LLl frequency band is unsuitable to be modified.Figure 3
Wavelet subbands of 3-level.Only embedding the watermark intoHHl, HHl-1,…, HH1 subbands is also unsuitable, for they have the highest wavelet coefficients; the subbands can easily be eliminated and modified by lossy compression or other processing [14].According to these characteristics, we design to adaptively adjusting, the high-frequency coefficient of the subbandsHLl,  LHl, and HHl, to embed the watermark bits.Generally, watermark embedding is realized by modifying some special values of pixels or transforming domain coefficients [16]. When the watermarked image receives some attacks, though the quality is still high, the pixel value or coefficient may be seriously eliminated, which will lead to the watermark detecting failed [17, 18]. Here we take advantage of the statistic characteristic, such as mean and variance of the LHl, HLl, and HHl subbands, to modify the whole coefficients of them to dynamically embed the watermark and implement the compromise between quality and robustness.


## 2.3. Watermark Embedding

After preprocessing the binary watermark imageW to get WAX, we reshape WAX to binary sequence wm; its length is still n×n. According to Human Visual System (HVS) [19], small changes to the blue component of color image are the most difficult to detect by human eyes; then we select the blue component to embed.Here we improve the method in [9] to embed pre-processed watermark into the blue component of color image. Suppose the host color image is I. Firstly, we divide the blue component of I into a set of nonoverlapping n×n subblocks bj∈B, j=1,2,...,n2. Then a l-level DWT decomposition of each sub-block of image I is performed using Haar wavelet, and then compute the mean Ej of each wavelet block SD by
(6)Ej=1M(∑(x,y)∈SDcj(l,s)(x,y)),
where cj(l,s)(x,y) is the wavelet coefficient of the jth sub-block, l is the level of wavelet decomposition, s refers to the three subbands of LHl,  HLl and HHl. (x,y) is the coordinate for wavelet coefficient in the wavelet blocks, and M is the total number of wavelet coefficient in SD.For example, here we setl=2, for the jth sub-block b(j)∈B; we use the dwt2() function in Matlab to perform a single-level two-dimensional wavelet decomposition. Finally, cj(2,s)(x,y) can be gotten by (9)
(7)[LLj1,LHj1,HLj1,HHj1]=dwt2(b(j),′haar′),(8)[LLj2,LHj2,HLj2,HHj2]=dwt2(LLj1,′haar′),(9)cj(2,s)(x,y)=[LHj2,HLj2,HHj2].The purpose ofEj is to keep the average of cj(l,s)(x,y)-λEj in (10) and (11) close to zero.Ifwm(j)=1, we modify the whole wavelet coefficients in SD by
(10)cj′(l,s)(x,y)=cj(l,s)(x,y)-λEj.Ifwm(j)=0, we modify the whole wavelet coefficients in SD by
(11)cj′(l,s)(x,y)=cj(l,s)(x,y)-λEj+P.Herecj′(l,s)(x,y) is the modified wavelet coefficient; the distribution of wavelet coefficient is modulated by wm(j). s refers to the three detail subbands of LHl, HLl, and HHl. That is to say, embedding “0” means that the coefficient mean of wavelet block SD is P, and embedding “1” means 0. λ refers to the magnification of Ej; here we set λ=1.5 to ensure the range of threshold Th larger enough to extract the watermark.Because the variance is bigger in the textures and edges than that in the smooth region, we use the variance of the coefficient as the modulation coefficientP to control the dynamically embedding intensity [19]. Raising embedding intensity within the definition can enhance the robustness [15]. So P can be defined by
(12)P=A+T(j).T(j) is defined as
(13)T(j)=((∑(x,y)∈SD(cj(l,a)(x,y)-cj(l,b)(x,y))-λEj)2)β.We can find thatT(j) is the local variance of the jth wavelet sub-block except the approximate sub-band LLl, and β is a constant. In (12), A is the intensity coefficient, which ensures to embed some watermark in the smooth region while T(j) is approximately 0. So (11) can be fully expressed by (14). 								(14)cj′(l,s)(x,y)=cj(l,s)(x,y)-λEj+A+((∑(x,y)∈SD(cj(l,a)(x,y)-cj(l,b)(x,y))-λEj)2)β.Using (10) and (14) we embed watermark by modify the wavelet coefficients. Finally, the IDWT is applied to each block, to get the watermarked image Iw.


## 2.4. Watermark Extraction

The watermark can be extracted correctly from the watermarked image, without the original host image or the watermark image, so the scheme belongs to blind watermark algorithm. The transformed coefficients are compared with the thresholdTh of the coefficients, those coefficients above the threshold are retained, and all the others are discarded [20].The extracting process is as follows, which is mirroring the embedding process.Step 1.
We divide the blue component of the watermarked color imageI into a set of nonoverlapping n×n subblocks.Step 2.
To extract the embedded bit from a sub-block, theL-level DWT decomposition of each block is firstly obtained. Then we compute Sum(j), the coefficients sum of the wavelet block SD using
(15)Sum(j)=∑(x,y)∈SDc′j(l,s)(x,y).
For all the wavelet blocks ofj=1,2,...,n2,
(16)Sum(j)∈[r1,r2],ifSDcarriesbit“1",Sum(j)∈[r3,r4],ifSDcarriesbit“0",
where r1<r2<r3<r4, then we can get the range of Th∈(r2,r3).Step 3.
Sum
(
j
) is compared with the threshold Th, to decide whether the coefficient carries a bit “1” or “0” using
(17)wm(j)={1Sum(j)<Th,0Sum(j)≥Th,
where wm(j) is the extracted bit.Step 4.
Finally, the extracted watermark bits are recovered into a binary image according to the inverse process.
During the embedding and extracting processes, the iteration timest of Arnold transform, the initial value of Chebyshev map, the size n×n of each block, the values of A, λ, and β, the threshold Th, and the type of wavelet are all served as keys, which can guarantee the security of the watermarked image; it is impossible to extract the watermark without these keys.


## 3. Experimental Result Analysis

### 3.1. Get the Effective Range of the Threshold in Experiment

The threshold is a critical factor, which can ensure to extract the watermark correctly from watermarked image under some attacks, and some papers only provide a fixed value [3, 7, 8]. The proposed scheme provides an exact range of the threshold by testing dozens of images, and it keeps constant even if the watermarked image has been attacked in some degree.Figure4 is Image1 distribution of Sum(j) before embedding; we can find that most of the coefficients in the detail subbands after DWT are close to zero, and the mean of each detail sub-band is approximately zero.Figure 4
Distribution:Sum(j) of the wavelet blocks SD before embedding.Figures5 and 6 are the Image1 distribution of Sum(j) after embedding with β=0.218 and β=0.818; from them we can find that when β=0.218, the distribution of Sum(j) is relatively concentrated, but when β=0.818, the values of Sum(j) distribute in larger range. The distribution of other images, such as Image3 and Airplane, is similar to Image1 when we set β=0.218.Figure 5
Distribution:Sum(j) of SD after embedding (β=0.218).Figure 6
Distribution:Sum(j) of SD after embedding (β=0.818).Experiment results demonstrate that when we setβ∈[0.218,0.818], the threshold Th∈(10,35), which is consistent with the result of (16), the range of Thwatermark can ensure the watermark to be extracted clearly from the watermarked images.


### 3.2. The Relationship betweenβ and PSNR

The quality of watermarked image is based on the PSNR [12]. From Figure 7 we can find that the PSNRs decrease smoothly with the increase of β∈[0.218,0.818], which can increase the embedding intensity P. What’s more, Figure 7 shows that the PSNR values of Image1, Image2, and Image3 are similar, and they are greater than that of Image1, for they have richer edges and borders than Image4, as shown in Figure 8.Figure 7
The relationship betweenβ and PSNR (dB).Sample images.
(a)
Image1
(b)
Image2
(c)
Image3
(d)
Image4


## 3.1. Get the Effective Range of the Threshold in Experiment

The threshold is a critical factor, which can ensure to extract the watermark correctly from watermarked image under some attacks, and some papers only provide a fixed value [3, 7, 8]. The proposed scheme provides an exact range of the threshold by testing dozens of images, and it keeps constant even if the watermarked image has been attacked in some degree.Figure4 is Image1 distribution of Sum(j) before embedding; we can find that most of the coefficients in the detail subbands after DWT are close to zero, and the mean of each detail sub-band is approximately zero.Figure 4
Distribution:Sum(j) of the wavelet blocks SD before embedding.Figures5 and 6 are the Image1 distribution of Sum(j) after embedding with β=0.218 and β=0.818; from them we can find that when β=0.218, the distribution of Sum(j) is relatively concentrated, but when β=0.818, the values of Sum(j) distribute in larger range. The distribution of other images, such as Image3 and Airplane, is similar to Image1 when we set β=0.218.Figure 5
Distribution:Sum(j) of SD after embedding (β=0.218).Figure 6
Distribution:Sum(j) of SD after embedding (β=0.818).Experiment results demonstrate that when we setβ∈[0.218,0.818], the threshold Th∈(10,35), which is consistent with the result of (16), the range of Thwatermark can ensure the watermark to be extracted clearly from the watermarked images.


## 3.2. The Relationship betweenβ and PSNR

The quality of watermarked image is based on the PSNR [12]. From Figure 7 we can find that the PSNRs decrease smoothly with the increase of β∈[0.218,0.818], which can increase the embedding intensity P. What’s more, Figure 7 shows that the PSNR values of Image1, Image2, and Image3 are similar, and they are greater than that of Image1, for they have richer edges and borders than Image4, as shown in Figure 8.Figure 7
The relationship betweenβ and PSNR (dB).Sample images.
(a)
Image1
(b)
Image2
(c)
Image3
(d)
Image4


## 4. Experimental Results and Key Space

### 4.1. Experimental Result

Here we made a64×64 binary image as the watermark. Some standard color images with the size of 512×512×24 bits, including Image1, Airplane, and Image3, are being tested. The size of the sub-block is set to 8×8, λ=1.5, l=2, when A∈[4,22], β∈[0.218,0.818], and Th∈(10,35); the results of watermarked images are satisfactory, as shown in Figure 9.The original and the watermarked Image1, and the difference between them.
(a)
The original Image1
(b)
The watermarked Image1
(c)
Almost no difference between (a) and (b)


### 4.2. Key Space Analysis

The high sensitivity to initial conditions is inherent to any chaotic system. To provide an secure algorithm, the key space should be large enough to make any brute force attack ineffective. Our scheme has some of the following secret keys: (1) for the Arnold cat map, the initial values ofx0 and  y0, the iteration times t; (2) Chebyshev maps, the initial value z0, and the parameter w.For the Arnold cat map,x0,y0∈[1,n] and  t∈[1,256], here n=64. For the Chebyshev maps, when the tiny change in the initial value Δz0=10-16, the scrambled watermark image is completely different. A large number of experimental results indicate that the key spaces for initial values are Sz0=1016. Similarly, the variation of the parameter w in the chaotic region is between 2 and 6 with a step of 10-16, so Sw≈4×1016.Finally, the total key space isS=Sx0×Sy0×St×Sz0×Sw≈4.19×1038, which is larger than 2100, so even the scrambled watermark is extracted; it’s difficult to recover it.


## 4.1. Experimental Result

Here we made a64×64 binary image as the watermark. Some standard color images with the size of 512×512×24 bits, including Image1, Airplane, and Image3, are being tested. The size of the sub-block is set to 8×8, λ=1.5, l=2, when A∈[4,22], β∈[0.218,0.818], and Th∈(10,35); the results of watermarked images are satisfactory, as shown in Figure 9.The original and the watermarked Image1, and the difference between them.
(a)
The original Image1
(b)
The watermarked Image1
(c)
Almost no difference between (a) and (b)


## 4.2. Key Space Analysis

The high sensitivity to initial conditions is inherent to any chaotic system. To provide an secure algorithm, the key space should be large enough to make any brute force attack ineffective. Our scheme has some of the following secret keys: (1) for the Arnold cat map, the initial values ofx0 and  y0, the iteration times t; (2) Chebyshev maps, the initial value z0, and the parameter w.For the Arnold cat map,x0,y0∈[1,n] and  t∈[1,256], here n=64. For the Chebyshev maps, when the tiny change in the initial value Δz0=10-16, the scrambled watermark image is completely different. A large number of experimental results indicate that the key spaces for initial values are Sz0=1016. Similarly, the variation of the parameter w in the chaotic region is between 2 and 6 with a step of 10-16, so Sw≈4×1016.Finally, the total key space isS=Sx0×Sy0×St×Sz0×Sw≈4.19×1038, which is larger than 2100, so even the scrambled watermark is extracted; it’s difficult to recover it.


## 5. Attack Test Results

The attacks to the whole watermarked image can modify the red, green, and blue components simultaneously. The modifications in the red or green component are easier to be observed, that is only because of the Human Visual System. There is no evidence to show that the modification in the blue component can be more robust than the other components.The peak signal-to-noise ratio (PSNR) is used to evaluate the quality between an attacked image and the original image. For the sake of completeness, we list the PSNR formula as follows:(18)PSNR=10×log10255×2551/(Ih×Iw)∑x=0Ih-1∑y=0Iw-1[f(x,y)-g(x,y)]2dB,whereIh and Iw are the height and width of the image, respectively. f(x,y) and g(x,y) are the values located at coordinates (x,y) of the original image and the attacked image, respectively.After extracting the watermark, the normalized correlation coefficient (NC) is computed using the original watermark and the extracted watermark to judge the existence of the watermark and to measure the correctness of an extracted watermark. It can be defined as(19)NC=1Wh×Ww∑i=0Wh-1∑j=0Ww-1W(i,j)×W′(i,j),
where Wh and Ww are the height and width of the watermark, respectively. W(i,j) and W'(i,j) are the watermark bits located at coordinates (i,j) of the original watermark and the extracted watermark.


### 5.1. Attack of Noise

Noise attack is a common attack during the transmission of the watermarked image on the network [21]. In the experiment, we add salt and pepper noise and Gaussian white noise to Image1 image, as shown in Table 1.Table 1
Noise attacking results for Image1.
Density
d = 0.001
d = 0.005
d = 0.01
d = 0.02
d = 0.05
Salt and pepper
NC
0.9585
0.8520
0.7462
0.6488
0.5309
Mean and variance
m = 0, v = 0.0005
m = 0, v = 0.001
m = 0, v = 0.002
m = 0, v = 0.005
m = 0, v = 0.01
Gaussian
NC
0.8503
0.7124
0.6258
0.5615
0.5137For the watermarked image with salt and pepper noise, with the increase of noise density, more and more noise points appear in the extracted watermark, when the density is set to 0.05, the NC is 0.5309, and the extracted watermark can still be distinguishable. Similarly, for the watermarked image attacked by Gaussian white noise, when the mean value is set to zero, more noise points appear in the extracted watermark with the increase of variance; when variance is set to 0.01, the extracted watermark can still be distinguishable.


### 5.2. Attack of JPEG Compression

JPEG lossy compression is the most common image compression technique. The watermarked image Image1 is compressed using JPEG with different value ofβ, horizontal resampling by 2 : 1, and compression ratios, 0.80, 0.65, 0.50, 0.25, and 0.10 respectively. The results obtained are summarized in Table 2; the distinguishable watermark can still be extracted even the ratio is set to 0.10, so the algorithm is very robust against compression.Table 2
Compression results with different ratios.
A
=
20, β=0.128
0.80
0.65
0.50
0.25
0.10
Image1
NC
0.8071
0.7325
0.7143
0.5497
0.4449
Image2
NC
0.7765
0.6970
0.6603
0.5368
0.4186
Image3
NC
0.6363
0.5789
0.5621
0.5100
0.5037


### 5.3. Attack of Cropping

The algorithm is also very robust against the cropping operation. In order to resist true cropping, that is, only a portion of the image is kept and the remaining part is thrown away, the width and height of the host image, along with the other keys, are sent to the detector. If the detector receives a portion of the image, he can recover it to the original size by zero padding, to extract the watermark.After randomly selecting the position and crop 5%, 10%, 25%, 50%, and 75% of the watermarked image, respectively, then extract the watermark, as shown in Table3. When 50% of the whole image is cropped, we can still extract the distinguishable watermark. That is to say, the algorithm has high robustness against cropping.Table 3
Extracting results for Image1 and Image2 after being cropped.
Cropping
5%
10%
25%
50%
75%
Image1Watermark extracted
NC
0.9128
0.8245
0.6617
0.4701
0.3470
Image2Watermark extracted
NC
0.8911
0.8245
0.6320
0.4622
0.3332After cropping the randomly selected position, and filling the cropped region with zero, the extracted watermark before and after the reverse transformation is shown in Table4; from it we can find that the randomly cropping has no effect on the extracted watermark.Table 4
Randomly select the cropping position and the extracting result.
A
=
20, β=0.128
Randomly cropped
Quadrately cropped
Ambiently cropped
Cropped watermarked image
Extracted watermark before reverse transformation
Extracted watermark after reverse transformationWithout the preprocessing to scramble the watermark, the four letters “DLUT” on the original watermark may be unexpectedly cropped; that is, the extracted watermark may be fragmentary, so scrambling the watermark by Arnold cat map in Section2.1 can help to make the bits randomly distributed, which contributes to the robustness.


### 5.4. Attack of Brightness

We increase and decrease the brightness by 10%, 30%, and 50%, respectively, as shown in Figure10. The extracted watermarks demonstrate that increasing the brightness has less effect on the watermark than decreasing the brightness, as shown in Table 5. So the algorithm has high robustness against the attack of brightness.Table 5
Extracting results from the image with enhanced and decreased brightness.
Enhanced brightness
10%
30%
50%
Extracted watermark
Decreased brightness
−10%
−30%
−50%
Extracted watermarkImage1: enhance and decrease the brightness.
(a)
10%
(b)
30%
(c)
50%
(d)
–10%
(e)
–30%
(f)
–50%


### 5.5. Comparison

Finally, we use Image1 withβ=0.218 to compare our algorithm with the algorithms proposed in [4, 11, 18]. The results show that our algorithm gets advantages over the others in the attacks of median filter, compression, rotation, and cropping, as shown in Table 6.Table 6
Compare the proposed method with the algorithms in [4, 11, 18].
Attacks
NC
Reference [4]
Reference [11]
Reference [18]
Our algorithm
(PSNR = 42.02 dB)
(PSNR = 44.73 dB)
(PSNR = 42.98 dB)
(PSNR = 31.14 dB)
Median filter(3×3)
0.90
0.88
0.93
1
JPEG (ratio = 0.80)
0.99
NA
1
0.9997
JPEG (ratio = 0.50)
0.96
0.95
0.96
0.9976
JPEG (ratio = 0.10)
0.34
0.33
0.32
0.9987
Rotation (degree: 0.25°)
0.59
0.61
0.65
0.9897
Rotation (degree: −0.25°)
0.60
0.65
0.72
0.9900
Cropping 1/4
0.66
0.60
0.67
0.8561
Scaling256×256
0.88
0.71
0.85
0.9999


## 5.1. Attack of Noise

Noise attack is a common attack during the transmission of the watermarked image on the network [21]. In the experiment, we add salt and pepper noise and Gaussian white noise to Image1 image, as shown in Table 1.Table 1
Noise attacking results for Image1.
Density
d = 0.001
d = 0.005
d = 0.01
d = 0.02
d = 0.05
Salt and pepper
NC
0.9585
0.8520
0.7462
0.6488
0.5309
Mean and variance
m = 0, v = 0.0005
m = 0, v = 0.001
m = 0, v = 0.002
m = 0, v = 0.005
m = 0, v = 0.01
Gaussian
NC
0.8503
0.7124
0.6258
0.5615
0.5137For the watermarked image with salt and pepper noise, with the increase of noise density, more and more noise points appear in the extracted watermark, when the density is set to 0.05, the NC is 0.5309, and the extracted watermark can still be distinguishable. Similarly, for the watermarked image attacked by Gaussian white noise, when the mean value is set to zero, more noise points appear in the extracted watermark with the increase of variance; when variance is set to 0.01, the extracted watermark can still be distinguishable.


## 5.2. Attack of JPEG Compression

JPEG lossy compression is the most common image compression technique. The watermarked image Image1 is compressed using JPEG with different value ofβ, horizontal resampling by 2 : 1, and compression ratios, 0.80, 0.65, 0.50, 0.25, and 0.10 respectively. The results obtained are summarized in Table 2; the distinguishable watermark can still be extracted even the ratio is set to 0.10, so the algorithm is very robust against compression.Table 2
Compression results with different ratios.
A
=
20, β=0.128
0.80
0.65
0.50
0.25
0.10
Image1
NC
0.8071
0.7325
0.7143
0.5497
0.4449
Image2
NC
0.7765
0.6970
0.6603
0.5368
0.4186
Image3
NC
0.6363
0.5789
0.5621
0.5100
0.5037


## 5.3. Attack of Cropping

The algorithm is also very robust against the cropping operation. In order to resist true cropping, that is, only a portion of the image is kept and the remaining part is thrown away, the width and height of the host image, along with the other keys, are sent to the detector. If the detector receives a portion of the image, he can recover it to the original size by zero padding, to extract the watermark.After randomly selecting the position and crop 5%, 10%, 25%, 50%, and 75% of the watermarked image, respectively, then extract the watermark, as shown in Table3. When 50% of the whole image is cropped, we can still extract the distinguishable watermark. That is to say, the algorithm has high robustness against cropping.Table 3
Extracting results for Image1 and Image2 after being cropped.
Cropping
5%
10%
25%
50%
75%
Image1Watermark extracted
NC
0.9128
0.8245
0.6617
0.4701
0.3470
Image2Watermark extracted
NC
0.8911
0.8245
0.6320
0.4622
0.3332After cropping the randomly selected position, and filling the cropped region with zero, the extracted watermark before and after the reverse transformation is shown in Table4; from it we can find that the randomly cropping has no effect on the extracted watermark.Table 4
Randomly select the cropping position and the extracting result.
A
=
20, β=0.128
Randomly cropped
Quadrately cropped
Ambiently cropped
Cropped watermarked image
Extracted watermark before reverse transformation
Extracted watermark after reverse transformationWithout the preprocessing to scramble the watermark, the four letters “DLUT” on the original watermark may be unexpectedly cropped; that is, the extracted watermark may be fragmentary, so scrambling the watermark by Arnold cat map in Section2.1 can help to make the bits randomly distributed, which contributes to the robustness.


## 5.4. Attack of Brightness

We increase and decrease the brightness by 10%, 30%, and 50%, respectively, as shown in Figure10. The extracted watermarks demonstrate that increasing the brightness has less effect on the watermark than decreasing the brightness, as shown in Table 5. So the algorithm has high robustness against the attack of brightness.Table 5
Extracting results from the image with enhanced and decreased brightness.
Enhanced brightness
10%
30%
50%
Extracted watermark
Decreased brightness
−10%
−30%
−50%
Extracted watermarkImage1: enhance and decrease the brightness.
(a)
10%
(b)
30%
(c)
50%
(d)
–10%
(e)
–30%
(f)
–50%


## 5.5. Comparison

Finally, we use Image1 withβ=0.218 to compare our algorithm with the algorithms proposed in [4, 11, 18]. The results show that our algorithm gets advantages over the others in the attacks of median filter, compression, rotation, and cropping, as shown in Table 6.Table 6
Compare the proposed method with the algorithms in [4, 11, 18].
Attacks
NC
Reference [4]
Reference [11]
Reference [18]
Our algorithm
(PSNR = 42.02 dB)
(PSNR = 44.73 dB)
(PSNR = 42.98 dB)
(PSNR = 31.14 dB)
Median filter(3×3)
0.90
0.88
0.93
1
JPEG (ratio = 0.80)
0.99
NA
1
0.9997
JPEG (ratio = 0.50)
0.96
0.95
0.96
0.9976
JPEG (ratio = 0.10)
0.34
0.33
0.32
0.9987
Rotation (degree: 0.25°)
0.59
0.61
0.65
0.9897
Rotation (degree: −0.25°)
0.60
0.65
0.72
0.9900
Cropping 1/4
0.66
0.60
0.67
0.8561
Scaling256×256
0.88
0.71
0.85
0.9999


## 6. Conclusion

We propose a dynamic block-based blind watermark algorithm based on a 2-level DWT, using Haar filter to embed a preprocessing binary image into the blue component of the color pathological image. By analyzing the coefficients’ characteristic after wavelet decomposition, we select the detail subbands to embed watermark. During the embedding procedure, the statistic characteristics of the mean and variance are applied to dynamically adjust the embedding intensity, so as to generate the effective range of threshold to extract the watermark. Experiment results demonstrate that the quality of the watermarked image, which is based on the PSNR, decreases smoothly with the increase of the embedding intensity, and the algorithm is robust against common distortions, especially, getting advantages over noise, compression, cropping, rotation, and brightening.



---

*Source: 406349-2012-12-02.xml*