## Abstract

A blind robust watermarking scheme is proposed. A watermark is firstly transformed into a non-cascade iterative encrypted kinoform with non-cascade phase retrieve algorithm and random fractional Fourier transform (RFrFT). An iterative algorithm and Human Visual System (HVS) are both presented to adaptively embed the kinoform watermark into corresponding 2-level DWT coefficients of the cover image. The kinoform accounts for much less data amount to be embedded than regular computer-generated hologram (CGH). And the kinoform can be extracted with the only right phase key and right fractional order, and reconstructed to represent original watermark without original cover image. The experiments have shown the scheme’s high security, good imperceptibility, and robustness to resist attacks such as noise, compression, filtering, cropping.

© 2011 OSA

## 1. Introduction

Rapid development in internet and wireless communication makes people much easier to get access to products such as images, videos and so on. However, it also provides convenient way for illegal acquisition and distribution of the copyright products. Recently, in order to effectively protect copyright, increasing research in both security and robustness of watermarking scheme [20–22] has been focused on.

To enhance the security of a watermarking scheme, some techniques in the field of security has been used in the watermarking. Double random phase encoding technique, proposed by Javidi, has been applied to optically or numerically encrypt the original watermark [7–9]. As a generation of traditional Discrete Fourier Transform (DFT), the fractional Fourier Transform (FrFT) [13] provides additional key for watermark embedding in the DFT domain of the cover image [10]. The cascaded Fresnel digital hologram is used for the encryption of digital image without lens architecture [11,12]. Also some other encryption algorithms such as pixel permutations and so on, are generally used to increase the difficulty to decrypt the watermark [1].

Meanwhile, to enhance the robustness of a watermarking scheme, Computer-generated hologram (CGH) has been investigated and used in watermarking [2–5]. With very good feature of the residue of empirical mode decomposition (EMD) to resist noise attack, literature [22] proposed robust image watermarking in multiband wavelet transform. However, an effective watermarking scheme demands comprehensive performance such as high security, good robustness and imperceptibility. The usage of CGH in watermarking accounts for large data amount and is reconstructed with conjugate images. Its security is much fragile. Besides, cascade phase retrieve watermarking algorithm converges slowly, which may lead to loss of source. Its robustness is poor as well. However, random fractional Fourier transform (RFrFT) [14–16] possesses good mathematical properties and can be directly used in optical encryption and decryption, which ensured good security. And non-cascade phase retrieve kinoform [6] converges quickly and account for less data amount, which not only ensured good imperceptibility, but also was reconstructed without conjugate image. The iterative embedding algorithm in Jianzhong Li’s adaptive watermarking scheme [17] ensued both the imperceptibility and robustness of the watermarking. According to HVS, the Pixel-Mask model [18] also improved the imperceptibility of the watermarked image. Therefore, based on RFrFT, non-cascade phase retrieve kinoform and iterative embedding algorithm with HVS model, a new watermarking scheme is proposed in this paper to ensure quick convergence, high security, good imperceptibility, and robustness to resist attacks.

## 2. Non-cascade iterative encrypted kinoform

Compared to traditional CGH, kinoform is the one with less data amount and can be reconstructed with only one image. Also, because DFT is too simple to decrypt, the security of CGH is seriously affected. Therefore, a non-cascade iterative encrypted kinoform is proposed to ensure the security and less data amount to be stored.

#### 2.1 Random fractional Fourier transform (RFrFT)

It is known that fractional Fourier transform (FrFT) [13] is generalization of common Fourier transform with high security of its fractional order. The *α* th order FrFT is defined as follows:

*α*th order FrFT function of the$f\left(x\right)$, the$f\left(x\right)$ denotes the original watermark, ${K}_{\alpha}\left(x;u\right)$ denotes the transform kernel function, and is defined as follows:

Based on FrFT definition, RFrFT [16] possesses good mathematical properties by randomizing the kernel function of FrFT to improve its high security. And it is defined as follows:

#### 2.2 Kinoform watermark generation

In order to conquer the disadvantage of large data amount of regular CGH, a non-cascade iterative encrypted kinoform, which possesses much less data amount and without conjugated image in reconstruction, is proposed based on the RFrFT and non-cascade phase retrieve algorithm. Its flowchart has been shown in Fig. 3 .

In the flowchart above, the original watermark image is defined as $W\left(x,y\right)$; the amplitude and random phase mask of input object function ${g}_{n}\left(x,y\right)$ are ${\omega}_{n}\left(x,y\right)$and${e}^{j{\phi}_{n}\left(x,y\right)}$
_{,} respectively; the orders of RFrFT and inverse random fractional Fourier transform (iRFrFT) are *α* and $-\alpha $, respectively; the phase keys for RFrFT and iRFrFT are$P\left(x,y\right)$and${P}^{\text{'}}\left(x,y\right)$, respectively; the amplitude and phase mask of output image function is $A\left(u,v\right)$and${e}^{j\varphi \left(u,v\right)}$, respectively. The limitation of the input plane and output plane are $\omega \left(x,y\right)=W\left(x,y\right)$and $A\left(u,v\right)=c$ (i.e., *c* is a constant, normally *c* = 1), respectively.

The output image function and input object function is presented as follows:

The non-cascade iterative encrypted kinoform is generated according to the following steps:

Step 1: The phase function ${\phi}_{0}\left(x,y\right)$of input object function${g}_{n}\left(x,y\right)$, which uniquely distributes in$\left(0,2\pi \right)$, is generated; and the amplitude function ${\omega}_{0}\left(x,y\right)$of input object function is the original watermark image$W\left(x,y\right)$. Therefore, the input complex function ${g}_{0}\left(x,y\right)={\omega}_{0}\left(x,y\right){e}^{j{\phi}_{0}\left(x,y\right)}$ is obtained. According to the need of the scheme, the fractional order *α* and key $P\left(x,y\right)$ are generated;

Step 2: ${g}_{0}\left(x,y\right)$is transformed by RFrFT to generate output image function${G}_{n}\left(u,v\right)={A}_{n}\left(u,v\right){e}^{j{\varphi}_{n}\left(u,v\right)}$; According to the output limitation${G}_{n}\left(u,v\right)=c\cdot {e}^{j{\varphi}_{n}\left(u,v\right)}$;

Step 3: The new image function is transformed by iRFrFT and phase key ${P}^{\text{'}}\left(x,y\right)$, andtheinputobjectcomplexfunction ${g}_{n+1}\left(x,y\right)=iRFrFT({G}_{n}(u,v))={\omega}_{n+1}\left(x,y\right){e}^{j{\phi}_{n+1}\left(x,y\right)}$;

a: if the NMSE between ${\omega}_{n+1}\left(x,y\right)$ and $W\left(x,y\right)$ converges, go to step 4;

b: if not, according to the input limitation, ${g}_{n+1}\left(x,y\right)=W\left(x,y\right){e}^{j{\phi}_{n+1}\left(x,y\right)}$, and go to Step 2;

Step 4: The output image complex function is generated as$G\left(u,v\right)={\Re}_{\alpha}^{P}\left\{W\left(x,y\right){e}^{j\phi \left(x,y\right)}\right\}=c\cdot {e}^{j\varphi \left(u,v\right)}$, which actually is a pure phase function. After quantification, ${\varphi}_{n}\left(u,v\right)$is saved as a kinoform$K\left(u,v\right)$.

After generation of the non-cascade iterative encrypted kinoform, it can be embedded into the cover image according to the proposed embedding algorithm, which will be described in the following section.

## 3. Watermarking embedding

In order to extract original watermark without original cover image, a method is proposed to embed the kinoform into corresponding 2-level DWT coefficients of the cover image. First, the cover image is transformed by 2-level DWT, and HL2, LH2, HL1, and LH1 are selected and divided into several 3✕3 blocks, as shown in Fig. 4 . Then, certain coefficients of the central position in each block are revised according to the kinoform and revision intensity of HVS mode [18,19]. In order to embed more information, overlapping blocks are preferred.

According to the HVS model proposed in Ref [18], coefficient revision intensity${\beta}_{i}$ is calculated; According to the embedding algorithm proposed in Ref [17], we proposed the following embedding algorithm in Fig. 5
. *Δ* is the quantization step; ${C}_{i}$is the value of central position in each block; ${A}_{i}$is the average value of ${C}_{i}$’s 8 nearest neighbor positions; ${K}_{i}$ ($0\le {K}_{i}\le 1$) is normalized gray kinoform value; ${\gamma}_{i}$controls embedding intensity; and the embedding algorithm is executed as follows:

Step1: Let${C}_{i}^{\text{'}}=\left|{A}_{i}\right|+{\gamma}_{i}\cdot {K}_{i}$,${m}_{i}=0$;

Step2: If $\left|{C}_{i}^{\text{'}}-\left|{C}_{i}\right|\right|>{\beta}_{i}\left|{C}_{i}\right|$, revise appropriate value of ${m}_{i}$ according to the following rules:

a: If ${C}_{i}^{\text{'}}-\left|{C}_{i}\right|>{\beta}_{i}\left|{C}_{i}\right|$, let ${C}_{i}^{\text{'}}={C}_{i}^{\text{'}}-\Delta $ and ${m}_{i}={m}_{i}+1$. Repeat until${C}_{i}^{\text{'}}-\left|{C}_{i}\right|\le {\beta}_{i}\left|{C}_{i}\right|$. Otherwise go to b.

b: If ${C}_{i}^{\text{'}}-\left|{C}_{i}\right|<-{\beta}_{i}\left|{C}_{i}\right|$, let ${C}_{i}^{\text{'}}={C}_{i}^{\text{'}}+\Delta $and${m}_{i}={m}_{i}-1$. Repeat until${C}_{i}^{\text{'}}-\left|{C}_{i}\right|\ge -{\beta}_{i}\left|{C}_{i}\right|$.

Step 3: If${C}_{i}<0$, let${C}_{i}^{\text{'}}=-{C}_{i}^{\text{'}}$;

Step 4: Replace ${C}_{i}$with${C}_{i}^{\text{'}}$.

After kinoform watermark embedding, the coefficients satisfy the following equations. And a watermarked image is obtained after inverse 2-level DWT.

## 4. Watermarking extraction and reconstruction

Similar to the watermarking embedding procedure, the watermarked image is decomposed to be LL2, HL2, LH2, HH2, HL1, LH1, LL2 by 2-level DWT; and the corresponding embedding position is selected from HL2, LH2, HL1 and LH1. According to the following equation, the each pixel of the kinoform could be extracted:

After rearrangement of extracted pixel values, ${K}^{\text{'}}\left(u,v\right)$could be obtained. Then, according to the kinoform generation flowchart and Eq. (9), the original watermark can be reconstructed with the right order $-\alpha $ and phase key ${P}^{\text{'}}$.

## 5. Numerical simulations and analysis

#### 5.1 Judgment principle

In order to evaluate the performance of the proposed scheme, three parameters are defined and used to make a quantitative measure.

**A.** to measure the perceptual distortion of the watermarked image, the Peak Signal to Noise Ratio (PSNR) was defined as follows:

*L*is the peak value of the signal, and the size of the image is${N}_{x}\times {N}_{y}$, ${I}_{o}\left(x,y\right)$and ${I}_{w}\left(x,y\right)$represent the original cover image and watermarked image, respectively.

**B.** To evaluate the similarity degree between the original watermark and extracted watermark, Normalized Cross Correlation (NCC) is defined as follows:

**C.** To evaluate the convergence of the generated kinoform, Normalized Mean Square Error (NMSE) is used and defined as follows:

#### 5.2 Numerical simulations

In the numerical simulation experiments, a gray image “Lena” (256 × 256 pixels) and a binary image “PKU” (64 × 64 pixels) are chosen as the cover image and the original watermark, respectively, as shown in Fig. 6 (a) and (b) . And several numerical tests are implemented to verify the performance of the proposes watermarking scheme under the hardware environment of Dell Precision T 5400 Intel Xeon CPU 2.5 GHz workstation with 4 GB RAM memory and MATLAB version 7.

### 5.2.1 Non-cascade encrypted kinoform generation

A non-cascade encrypted kinoform (64 × 64 pixels) is generated and shown in Fig. 7(a) according to the kinoform watermark generation algorithm. After watermark embedding procedure, a watermarked image(PSNR = 42.34, 256 × 256 pixels)is generated, as shown in Fig. 7(b). Without any attacks, a whole kinoform (64 × 64 pixels) can be extracted, as shown in Fig. 7(c), and the original watermark can be reconstructed with high NCC value of 0.9592, as shown in Fig. 7(d).

### 5.2.2 Convergence tests

During the non-cascade iterative encrypted kinoform generation periods, the kinoform is obtained after iterative calculation. After each loop, the amplitude of the new object function is calculated by NMSE, as shown in Fig. 8
. In Fig. 8, we can find that the NMSE is converging fast before 20 loops, and slow down after 20 loops. Compared to HE’s method ^{[1]} “Cascade FrFT” in Fig. 8, the convergence in the proposed scheme goes much quickly than that of HE’s method. And the NMSE in the proposed scheme can reach less than 0.08, while the HE’s method can only reach about 0.1. Therefore, the proposed watermarking scheme converges much faster and reaches a much lower NMSE value.

### 5.2.3 Security tests

The watermarking scheme possessed good security characteristics with *α* order and phase key$P\left(x,y\right)$in RFrFT. From Fig. 9
, it is found that on the condition of right phase key$P\left(x,y\right)$, only with the right order ($\alpha =0.8718$), the watermark image can be extracted with high NCC value of 0.9614. When *α* goes much closer to the right order value, the watermark can be extracted with a much higher NCC value, which can be shown in Fig. 9 and the curve “Right phase key” in Fig. 11
. And vice versa.

However, with the wrong phase key$P\left(x,y\right)$, the watermark cannot be extracted with high NCC value whatever *α* order is, which can be shown as Fig. 10
and the curve “Wrong phase key” in Fig. 11.

And, the following curve in Fig. 11 also account for the high security.

### 5.2.4 Attack tests

In order to test the robustness of the proposed scheme, related simulation attack experiments are executed as shown in Fig. 12 . The robustness of resisting JPEG loss compression is good. Related experiments are shown as follows:

Because of the property of CGH to resist cropping attack, the proposed watermarking scheme with the kinoform is tested with different kinds of cropping attacks. The experiment results are shown in Fig. 13 .

The measurement of robustness to resist other attacks and extracted watermark images have been shown in Table 1 and Fig. 14 , respectively. Table 1 shows the measure of the robustness of the proposed scheme to resist different attacks.

## 6. Conclusion

By means of non-cascade iterative encrypted kinoform and corresponding embedding algorithm, a new watermarking scheme has been proposed to embed the kinoform to the 2-level DWT coefficients of the cover image. The proposed scheme secured watermarked image’s imperceptibility and possesses good security as well as robustness. And the watermark is extracted without original cover image. Compared to the optical holography, the kinoform is much easier to generate by computers. Besides, the data amount of the kinoform account only 1/4 of the CGH, which can be embedded into the cover image so as to ensure the watermarked image’s good imperceptibility. And the kinoform generation algorithm converges more quickly than the cascaded method in literature [1]. Besides, with the good security feature of RFrFT, the proposed scheme possesses high security, and can also resist other malicious attacks, such as JPEG compression, cropping attack, noise attack, filtering. Therefore, the scheme generally possesses comprehensive performance (imperceptibility, quick convergence, less data amount, security, and robustness).

## References and links

**1. **M. He, Q. Tan, L. Cao, Q. He, and G. Jin, “Security enhanced optical encryption system by random phase key and permutation key,” Opt. Express **17**(25), 22462–22473 (2009). [CrossRef]

**2. **N. Takai and Y. Mifune, “Digital watermarking by a holographic technique,” Appl. Opt. **41**(5), 865–873 (2002). [CrossRef]

**3. **Y. Aoki, “Watermarking technique using computer-generated holograms,” Electron. Commun. Jpn. **84**(1), 21–31 (2001). [CrossRef]

**4. **M. Liu, G. Yang, H. Xie, M. Xia, J. Hu, and H. Zha, “Computer-generated hologram watermarking resilient to rotation and scaling,” Opt. Eng. **46**(6), 060501 (2007). [CrossRef]

**5. **K. Deng, G. Yang, and C. Zhang, “Burch computer-generated hologram watermarking resilient to strong cropping attack,” Biomedical Optics and 3-D Imaging (BIOMED) Topical Meeting, OSA Optics and Photonics Congress, April 2010, in Miami, FL, USA.

**6. **H. Zhai, F. Liu, X. Yang, G. Mu, and P. Chavel, “Improving binary images reconstructed from kinoforms by amplitude adjustment,” Opt. Commun. **219**(1-6), 81–85 (2003). [CrossRef]

**7. **P. Refregier and B. Javidi, “Optical image encryption based on input plane and Fourier plane random encoding,” Opt. Lett. **20**(7), 767–769 (1995). [CrossRef]

**8. **S. Kishk and B. Javidi, “Information hiding technique with double phase encoding,” Appl. Opt. **41**(26), 5462–5470 (2002). [CrossRef]

**9. **Y. Sheng, Z. Xin, M. S. Alam, L. Xi, and L. Xiao-Feng, “Information hiding based on double random-phase encoding and public-key cryptography,” Opt. Express **17**(5), 3270–3284 (2009). [CrossRef]

**10. **R. Tao, Y. Xin, and Y. Wang, “Double image encryption based on random phase encoding in the fractional Fourier domain,” Opt. Express **15**(24), 16067–16079 (2007). [CrossRef]

**11. **S. Deng, L. Liu, H. Lang, W. Pan, and D. Zhao, “Hiding an image in cascaded Fresnel digital holograms,” Chin. Opt. Lett. **4**, 268–271 (2006).

**12. **S. Deng, L. Liu, H. Lang, D. Zhao, and X. Liu, “Watermarks encrypted in the cascaded Fresnel digital hologram,” Optik (Stuttg.) **118**, 302–305 (2007). [CrossRef]

**13. **C. Candan, M. A. Kutay, and H. M. Ozaktas, “The discrete fractional Fourier transform,” IEEE Trans. Signal Process. **48**(5), 1329–1337 (2000). [CrossRef]

**14. **S.-C. Pei and W.-L. Hsue, “Random discrete fractional Fourier transform,” IEEE Signal Process. Lett. **16**(12), 1015–1018 (2009). [CrossRef]

**15. **S.-C. Pei and W.-L. Hsue, “The multiple-parameter discrete fractional Fourier transform,” IEEE Signal Process. Lett. **13**(6), 329–332 (2006). [CrossRef]

**16. **Z. Liu and S. Liu, “Random fractional Fourier transform,” Opt. Lett. **32**(15), 2088–2090 (2007). [CrossRef]

**17. **J. Li, X. Zhang, S. Liu, and X. Ren, “Adaptive watermarking scheme using a gray-level computer generated hologram,” Appl. Opt. **48**(26), 4858–4865 (2009). [CrossRef]

**18. **M. Barni, F. Bartolini, and A. Piva, “Improved wavelet-based watermarking through pixel-wise masking,” IEEE Trans. Image Process. **10**(5), 783–791 (2001). [CrossRef]

**19. **A. Reddy and B. Chatterji, “A new wavelet based logo-watermarking scheme,” Pattern Recognit. Lett. **26**(7), 1019–1027 (2005). [CrossRef]

**20. **P. Bao, “Xiaohu Ma, “Image adaptive watermarking using wavelet domain singular value decomposition,” IEEE Trans. Circ. Syst. Video Tech. **15**, 96–102 (2005). [CrossRef]

**21. **W.-H. Lin, S.-J. Horng, T.-W. Kao, P. Fan, C.-L. Lee, and Y. Pan, “An efficient watermarking method based on significant difference of wavelet coefficient quantization,” IEEE Trans. Multimed. **10**(5), 746–757 (2008). [CrossRef]

**22. **N. Bi, Q. Sun, D. Huang, Z. Yang, and J. Huang, “Robust image watermarking based on multiband wavelets and empirical mode decomposition,” IEEE Trans. Image Process. **16**(8), 1956–1966 (2007). [CrossRef]