A Robust Digital Watermarking Algorithm Based on Finite-Set Discrete Radon Transform Tight Frame ()

Jiangui Zhang^{1,2}, Huibin Qi^{2}

^{1}Guangdong Huiyu Intelligent Survey Technology Co. Ltd., Zhuhai, China.

^{2}Hunan Jiajia Car-Parking Technology Co. Ltd., Changsha, China.

**DOI: **10.4236/jcc.2020.812012
PDF
HTML XML
517
Downloads
1,841
Views
Citations

Digital watermarking technology plays a powerful role in the effective protection of digital media copyright, image authentication, image sharing, image information transmission and other fields. Driven by strong demand, digital image watermarking technology has aroused widespread research interest and has gradually developed into one of the most active research directions in information science. In this paper, we present a novel robust digital watermarking algorithm based on discrete radon transform tight frame in finite-set (FDRT). FDRT of the zero mean image is a tight frame, the frame boundary **A** = **B** = 1, the dual of the frame is itself. The decomposition and reconstruction of the FDRT tight frame will not cause the phenomenon of image distortion. The embedding of hidden watermark is to add a weak signal to the strong background of the original image. Watermark extraction is to effectively identify the embedded weak signal. The feasibility of the watermarking algorithm is analyzed from two aspects of information hiding and robustness. We select the independent Gaussian random vector as the watermark series, and the peak signal-to-noise ratio (PSNR) as the visual degradation criterion of the watermark image. Basing the FDRT compact stand dual operator, we derived the relationship among the strength parameter, square sum of watermark series, the PSNR. Using Checkmark system, the simulation results show that the algorithm is robust enough to some very important image processing attacks such as lossy compression, MAP, filtering, segmentation, edge enhancement, jitter, quadratic modulation and general geometric attack (scaling, rotation, shearing), etc.

Keywords

Digital Watermarking, Data Mining, Discrete Radon Transform, Tight Frame, Copyright Protection, Information Hiding, Finite-Set

Share and Cite:

Zhang, J. and Qi, H. (2020) A Robust Digital Watermarking Algorithm Based on Finite-Set Discrete Radon Transform Tight Frame. *Journal of Computer and Communications*, **8**, 123-133. doi: 10.4236/jcc.2020.812012.

1. Introduction

In recent years, the research activities in digital watermarking have increased rapidly, mainly because the Internet and digital technology have brought us rich online digital images, which need effective copyright protection, image authentication, image sharing, and image information transmission [1].

The embedding of image implicit watermark is to superimpose a weak signal on the strong background of the original image. Watermark extraction is to effectively identify embedded weak signals [2]. The current researches on digital image watermarking algorithms mainly focus on three directions: based on spatial domain, based on transform domain, and based on compressed domain [3]. The visual quality of the watermark embedded in the original image brings a certain degree of degradation, so that, a good watermarking algorithm must meet three requirements at the same time: the visual quality of the watermarked image is high and reversible [4], the embedding of the watermark is good, and the algorithm is robust [5].

The embedded watermark for protection should not degrade image quality. In addition, it must be robust to distortions caused by image processing algorithms. Image processing does not modify only the image but also the embedded watermark signal as well. Thus, the watermark may become undetectable after intentional or unintentional image processing attacks. A general watermarking framework for copyright protection has been described in [6].

Most watermarking techniques in the literature involve watermark signal detection based on similarity. However, the similarity detector is optimal only if the watermark series follows a Gaussian distribution and minimizes the error probability [7].

The direct discrete Radon transform in Euclidean geometry will introduce information redundancy when describing digital images [8]. Combined with masking characteristics of visual system, this paper proposes a new watermarking embedding robust algorithm based on discrete radon transform tight frame in finite set (FDRT). The reason of embedding watermark in FDRT domain is analyzed from two aspects of invisibility and robustness, and the embedding strategy and detection algorithm of FDRT domain watermark are realized. Using the peak signal-to-noise ratio (PSNR) as an objective criterion to evaluate the quality of the watermark image, the relationship among the watermark capacity, embedding depth and the PSNR of the watermark image is derived. According to this formula, the embedding parameters of watermark can be selected adaptively under the constraint of given image quality. The final numerical experiments effectively support the above conclusions.

2. Discrete Radon Transform Tight Frame in Finite Set

As defining continuous Radon transformations in Euclidean geometry, finite Radon transformations are defined in finite geometry set. The FDRT of a real function *f* defined on a finite set *S* is the real function on subset *G* (*G** *Ì *S*), the values of which are obtained by summing *f* over the subset *G*. When set *S* is considered a special algebraic structure like image, subset *G* is the lattice points on a line, the FDRT of the image can be attained [9].

The FDRT of an image
$f[i,j]$ (
$i,j\in {Z}_{p}$,
${Z}_{p}=\{\text{1},\text{2},\dots ,p-\text{1}\}$, *p* is a prime number) is defined as:

${\Re}_{k}\text{[}l\text{]}=\text{FDRT(}f[k,l])=\frac{1}{\sqrt{p}}{\displaystyle \underset{(i,j)\in {L}_{k,l}}{\sum}f[i,j]}$ (1)

where, the factor
$\text{1}/\sqrt{p}$ is introduced to normalize the l_{2}-norm between the input and output of the FDRT, and ensure the energy matching between the original image and the reconstructed image. L_{k}_{,l} denotes the point set that makes up a line on the lattice
${Z}_{p}^{2}$.

$\begin{array}{l}{L}_{k\text{,}l}=\text{{(}i,j\text{):}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}j=ki+l\text{\hspace{0.05em}}\text{\hspace{0.05em}}\cdot \text{mod}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{(}p\text{)}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{,}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}i\in {Z}_{p}\text{}}\text{\hspace{0.05em}}\text{\hspace{0.05em}},\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}0\le k\le p-1\\ {L}_{p\text{,}l}=\text{{(}l,j\text{):}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}j\in {Z}_{p}\text{}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}k=p\text{,}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}l\in {Z}_{p}\end{array}$ (2)

where, due to existing of the module operation, the line L_{k}_{,l} exhibits a wrap-around effect. In other words, the FDRT treats the input image as a periodic image.

The line *L*_{k}_{,l} on the finite set
${Z}_{p}^{\text{2}}$ is uniquely represented by its slope or direction
$k\in {Z}_{p}^{*}$ (
${Z}_{p}^{\text{2}}=\{0,\text{1},\text{2},\dots ,p-\text{1},p\}$ ) and its intercept
$l\in {Z}_{p}$, where *k* = *p* corresponds to infinite slope or close to vertical lines. There are total lines
$p\times \text{(}p+\text{1)}$ defined in this way and every line contains *p* points. Two lines of different slopes intersect at exactly one point, and any two distinct points on
${Z}_{p}^{\text{2}}$ belong to just one line. For any given slope, there are *p* parallel lines that provide a complete cover on the lattice
${Z}_{p}^{\text{2}}$. Traversing all image
${Z}_{p}^{\text{2}}$, we have:

$\underset{l\in {Z}_{p},k\in {Z}_{p}^{*}}{\overset{}{\sum}}{\Re}_{k}\text{[}l\text{]}}=\frac{1}{\sqrt{p}}{\displaystyle \underset{l\in {Z}_{p},k\in {Z}_{p}^{*}}{\overset{}{\sum}}{\displaystyle \underset{(i,j)\in {Z}_{p}^{2}}{\sum}f\text{[}i,j\text{]}}}=\frac{E}{\sqrt{p}$ (3)

where the constant E is the total energy of the original image f.

An inverse converter $\stackrel{\u02dc}{f}$ is the sum of the finite Radon coefficients of all lines passing through a given point, that is,

$\stackrel{\u02dc}{f}\text{[}i,j\text{]}=\text{IFDRT(}{\Re}_{k}\text{[}l\text{])}=\frac{1}{\sqrt{p}}{\displaystyle \underset{(k,l)\in {P}_{i,j}}{\sum}{\Re}_{k}\text{[}l\text{]},\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{(}i,j\text{)}\in {Z}_{p}^{2}}\text{\hspace{0.05em}}$ (4)

where *P** _{i}*,

${P}_{i,j}=\text{{(}k,l\text{)}:l=j-ki\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\cdot \text{mod(}p\text{)}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}},\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}k\in {Z}_{p}\text{}}\cup \text{{(}p,i\text{)}}$ (5)

so as

$\begin{array}{c}\stackrel{\u02dc}{f}\text{[}i,j\text{]}=\text{IFDRT(}{\Re}_{k}\text{[}l\text{])}=\frac{\text{1}}{p}\cdot {\displaystyle \underset{\text{(}k,l\text{)}\in {P}_{i,j}}{\sum}{\displaystyle \underset{\text{(}i,j\text{)}\in {L}_{k,l}}{\sum}f\text{[}i,j\text{]}}}\\ =\frac{\text{1}}{p}\text{(}p\cdot f\text{[}i,j\text{]}+{\displaystyle \underset{l\in {Z}_{p},k\in {Z}_{p}^{*}}{\sum}{\displaystyle \underset{\text{(}i,j\text{)}\in {L}_{k,l}}{\sum}f\text{[}i,j\text{]}}}\text{)}\\ =f\text{[}i,j\text{]}+E/p\end{array}$ (6)

The constant *E* is the total energy of image
$f[i,j]$. Equation (6) shows that the result of reconstructing
$\stackrel{\u02dc}{f}\text{[}i,j\text{]}$ can be completely reconstructed except for adding a constant
$E/p$ to each pixel.

If the total energy *E* = 0, let the matrix
$\psi \text{[}i,j\text{]}$ studied is a zero-mean image, then Equation (6) shows that there is no redundancy or loss of information/energy in the FDRT and IFDRT of
$\psi \text{[}i,j\text{]}$.

Let the discrete Radon transform of
$\psi \text{[}i,j\text{]}$ be expressed as FDRT(*ψ*) = *Hψ*. The elements of matrix *H*_{(p+1)×p} is

${h}_{k,l}={p}^{-1/2}{\delta}_{{L}_{k,l}}^{(i,j\text{)}}$,

where
${\delta}_{{L}_{k,l}}^{(i,j\text{)}}=\{\begin{array}{l}1\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}},\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{(}i,j\text{)}\in {L}_{k,l}\\ 0\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}},\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}otherwise\end{array}$. If
$\psi \text{[}i,j\text{]}$ the zero-mean image as a set of column vectors, then the matrix *H* reduced to
$H={p}^{-1/2}R$, where *R* is the correlation matrix between the set *H* and its subset
${\text{(}{R}_{{L}_{k,l}}\text{)}}_{\text{(}i,j\text{)}}=\{\begin{array}{l}\text{1}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}},\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{(}i,j\text{)}\in {L}_{k,l}\\ \text{0}\text{\hspace{0.05em}}\text{\hspace{0.05em}},\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}otherwise\end{array}$.

The FDRT of the zero-mean image
$\psi \text{[}i,j\text{]}$ satisfies the frame condition, and the frame
$\text{{}{h}_{k\text{,}l}:k\in {Z}_{p}^{*},l\in {Z}_{p}\text{}}$ is a tight frame, the frame boundary *A* = *B* = 1. i.e. the dual frame
$\{{\stackrel{^}{h}}_{k,l}:k\in {Z}_{p}^{*},l\in {Z}_{p}\}$ is itself [10], which has:

$\stackrel{\u02dc}{\psi}={\displaystyle \underset{l\in {Z}_{p}}{\sum}{\displaystyle \underset{k\in {Z}_{p}^{*}}{\sum}\langle \stackrel{\u02dc}{\psi},{h}_{k,l}\rangle {h}_{k,l}}}$, $\forall f\subset {Z}_{p}^{*}$ (7)

Therefore, the decomposition and reconstruction of the FDRT tight frame for zero mean images $\psi \text{[}i,j\text{]}$ is a reversible operation. That is, the FDRT and IFDRT of the frame have the same algorithm structure. The decomposition and reconstruction of the FDRT tight frame will not cause the phenomenon of image distortion.

3. Watermark Embedding and Detection

Watermark embedding can be seen as a weak signal superimposed on the strong background of the original image. According to the masking characteristics of the vision system, only when the superimposed signal exceeds certain intensity can it be detected by the vision system. In the image domain, the strength of the watermark can’t cause changes in the objective quality of the original image (such as PSNR) and visual effects. The watermark can be better hidden in the original image, making it lossless information [11] [12] [13].

3.1. Watermark Embedding

In the FDRT domain, the energy of image is best compacted on the projections with different slops. That is to say, the projection matrix Q is composed of *p* + 1 projection vectors. The watermark which is unchangeable and decipherable consists of a real series
$W=\{{\omega}_{i},i=\text{1},\dots ,N\}$, where each value ω_{i} is chosen independently according to
$N(0,1)$ [14].

We select
$l=0$ on the k'-th (
${k}^{\prime}<p-\mathrm{int}(N/p)$ ) projection embedding the watermark W. By Zigzag scanning, we have the watermarked matrix Wm_{k} is

${W}_{\Re}\text{[}k,l\text{]}={\Re}_{k}[l]+\alpha \cdot W{m}_{k}[l]\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}k\in {Z}_{p}^{2}$ (8)

where, *α* is strength factor of the watermark, so

$W{m}_{k}\text{[}l\text{]}=\{\begin{array}{l}W\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{{}{k}^{\prime}\le k\le \text{int(}N/p\text{)},l\in {Z}_{p}\text{}}\\ \text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\cup \text{{}k=\text{int(}N/p\text{)}+\text{1}\uff0c\text{0}<l\le \text{(}N-p\cdot \text{int(}N/p\text{))}}\\ 0\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}otherwise\end{array}$ (9)

Considering the equality (6), the watermarked image ${f}^{\prime}[i,j]$ is:

$\begin{array}{c}{f}^{\prime}[i,j]=\text{IFDRT(}{W}_{\Re}\text{[}k,l\text{])}=f\text{[}i,j\text{]}+\frac{\alpha}{\sqrt{p}}{\displaystyle \underset{\text{(}k,l\text{)}\in {P}_{i,j}}{\sum}W{m}_{k}\text{[}l\text{]}}\\ =f\text{[}i,j\text{]}+\alpha \cdot {W}^{\prime}\text{[}i,j\text{]}\end{array}$ (10)

The first item is reconstructed image
$f\text{[}i,j\text{]}$, and the second item is the inverse projection of the embedded watermark in FDRT domain. The pixels
${W}^{\prime}\text{[}i,j\text{]}$ which satisfies the wrap around stack path L_{k,l} in Equation (4) are defined over the entire image domain, viz, the Equation (10) shows that the energy of the embedded watermark uniformity distributes on all pixels of the image.

If the strength factor *α* is chosen suitably, the watermark signal
${W}^{\prime}\text{[}i,j\text{]}$ in space domain is very weak, so that the degradation of the watermark image is very small. The embedded watermark signal is invisibility, i.e. the visual quality of the watermarked image is not debased.

In the image domain, the watermark embedding process shown in Equation (10) actually introduces noise pollution. The PSNR of the watermarked image is

$\text{PSNR}=\text{10}\cdot \text{lg}\frac{\text{255}\cdot p}{\sqrt{{\displaystyle \underset{\text{(}i,j\text{)}\in {Z}_{p}}{\sum}{\text{(}\alpha \cdot {W}^{\prime}\text{(}i,j\text{))}}^{2}}}}$ (11)

Due to the quadratic sum of watermark signal
${W}^{\prime}\text{[}i,j\text{]}$ in image domain equal to the quadratic sum of the watermark series
$\left\{\alpha {\omega}_{i},i=\text{1},2,\dots ,N\right\}$ embedded in FDRT domain, viz.
$\underset{\text{(}i,j\text{)}\in {Z}_{p}}{\sum}{\text{(}\alpha \cdot {W}^{\prime}\text{(}i,j\text{))}}^{2}}={\displaystyle \underset{i=1}{\overset{N}{\sum}}{\text{(}\alpha {\omega}_{i}\text{)}}^{2}$. The watermark series elements *ω** _{i}* are independent random variables, let
${E}_{\omega}={\displaystyle \underset{i=1}{\overset{N}{\sum}}{\text{(}{\omega}_{i}\text{)}}^{2}}$. We have

$\text{PSNR}=\text{10}\cdot \mathrm{lg}(p\text{)}-\text{10}\cdot \text{lg}\alpha -\text{5}\cdot \mathrm{lg}({E}_{\omega}\text{)}$ (12)

The PSNR is only related to the strength parameter *α*, square sum *E _{ω}* of watermark series. For a given watermark series
$W=\{{\omega}_{i},i=\text{1},\dots ,N\}$, the smaller the strength parameter

3.2. Watermark Detection

The watermark extraction is essentially the reverse of the insertion process. The FDRT of the original and watermarked image is first performed. The watermark

Figure 1. The relationship among the PSNR, the strength parameter α, Square sum *E*_{ω} of watermark series, p = 257.

matrix *C*^{*} is then obtained by subtracting the original image projections from the watermarked image projections. We have

$\begin{array}{c}{C}^{*}=\text{FRAT}{f}^{\prime}[k,l]-\text{FRAT}f[k,l]\\ =\{\begin{array}{l}{W}^{\prime}{m}_{k}\text{[}l\text{]}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{{}{k}^{\prime}\le k\le \text{int(}N/p\text{)},l\in {Z}_{p}\text{}}\\ \text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\cup \text{{}k=\text{int(}N/p\text{)}+\text{1,0}<l\le \text{(}N-p\cdot \text{int(}N/p\text{))}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\\ \text{0}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}k\ne {k}^{\prime}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}},l\in {Z}_{p}\end{array}\end{array}$ (13)

After extracting the sub-matrix W^{*}m_{k} from the matrix *C*^{*}, the one-dimensional series W^{*} is restored by Zigzag scanning.

The presence of the watermark is then evaluated based on the similarity between the extracted W^{*} and original watermark W. The similarity detector is given by

$K\text{(}{W}^{*},W\text{)}={\displaystyle \underset{i=1}{\overset{N}{\sum}}\text{(}{W}^{*}\text{(}i\text{)}\cdot W(i\text{))}}/\sqrt{{\displaystyle \underset{i=1}{\overset{N}{\sum}}{({W}^{*}\text{(}i\text{))}}^{2}}}$ (14)

A threshold T is selected previously. If
$K\text{(}{W}^{*},W\text{)}>T$ one can determine that the image
${f}^{\prime}[i,j]$ has been inserted watermark W. The similarity measure depends on N, the length of the watermark series. Larger values of N tend to cause larger similarity values when W^{*} and W are genuinely related, without causing larger similarity values when W^{*} and W are independent. For the smaller number N, setting the threshold at bigger value will not cause spurious matching. We should select the T basing on the length of the original watermark series. For example, N = 1024, then T = 6.

3.3. Watermark Robustness

Using the FDRT, the energy or information of the watermarked signal which is uniformly incumbent on the image is congregated renewed on the correspondence projections in FDRT domain. Even if the watermarked image is exposed to attack, this energy or information can be yet collected on the exactitude projections, and can be detected by the similarity detector. The proposed watermarking algorithm has stronger robustness.

Since the watermark is Gaussian random series with zero-mean and is a full frequency domain signal, the FDRT and IFDRT do not change the frequency features of the watermark. The watermark signal is covered in the whole image space in full frequency band, this watermark embedding and extraction detection algorithm can resist the attack of various types of convolution filtering (low pass filter, band pass filter, high pass filter, notch filter, etc. in Table 1.

Table 1. The Various types of attack using checkmark system in [15].

Note: [a] The parameters (*a*, *b*), reducing the size to the original 1/*a* according to the nearest neighbor method, and then zooming in *b* times; [b] “Lana”, “Baboon”, the maximum variance method calculates the gray threshold value. “Head”, The image gray threshold is the average value of the image; [c] The lower bound frequency is 3/4 of the highest frequency; [d] The notch frequency band is the highest frequency 1/4 - 2/4.

For various types of shear, edge enhancement, contrast adjust, segmentation, geometrical attacks, FDRT can aggregate the remaining watermark information in the original embedded position of the watermark in the Radon domain, the existence of the watermark can still be detected. That is, the correlation between the watermark to be tested and the original watermark is still high (in Table 1). At the premise of ensuring the objective quality of the watermark image, the watermark series can be embedded in the original image by adjusting the embedding strength *α* in equality (10), the embedding algorithm has a large capacity.

4. Experimental Results

In order to estimate the watermarking scheme, we subjected the watermarked image to a series of image processing and collusion style attacks. In these experiments, the length of the Gaussian white noise series is *N* = 1024. The strength parameter is a = 0.1. The origin point is chosen at the first element of the projection with slope *k* = 30.

Experiment 1: The original image is 256 × 256 × 8 bit “Lena” images with High and low frequency information rich, as shown in Figure 2(a). The watermark image is shown in Figure 2(b), PSNR = 43.172 dB, the original image is less polluted by the watermark signal. Visually, the watermark image is basically consistent with the original image and achieves an invisible purpose. The statistical technique used for watermark detection, i.e. 1000 Gaussian random white noise series with different normal distributions are randomly generated, and the 500^{th} series is embedded in the original image. The watermark extracted according to equality (14) is correlated with the 1000 random series, the 500^{th} is an obvious response (Similarity = 31.689) in the corresponding position of the watermark series, as shown in Figure 2(c). This experiment exhibits that the algorithm has very high definition.

Experiment 2: Noise pollution and compression. The original images selected are 256 × 256 × 8 bit “Lena”, “Baboon”, “Brain” images. The “Baboon” has the complex texture areas. The medical image contains large dark or bright areas; the “Brain” is the human brain MR image.

Because of the diversity of noise sources, digital images are easily polluted. The watermarked image was polluted by Gaussian white noise. Figure 3(a)

(a) (b) (c)

Figure 2. (a) original image. (b) watermarked image (PSNR = 43.172 dB).

(a) (b)

Figure 3. (a) Robustness against noise pollution; (b) Robustness against JPEG.

shows the relationship between the correlation detection and the degree of pollution (PSNR) of the watermark image. As the PSNR is reduced to 26.61 dB, the visual quality of watermark image has become very poor. But the correlation degree of watermark detection is still more than the threshold *T* = 6.

Compression of is very important for image transmission and storage, the robustness of anti-compression is one of the important indexes of watermarking algorithm. Figure 3(b) shows the relationship between the correlation detector and the image quality (PSNR) after JPEG lossy compression. When the compression ratio increases, the visual quality of the image also decreases, and the correlation detector decreases. When the PSNR = 26.12 dB, the compression ratio is 10.4, and the correlation detector drops near the threshold value of 6, but the watermark can still be detected.

Experiment 3, the robustness of watermarking scheme must be tested and evaluated by various attack. This paper uses attack methods and strategies proposed in [15] to evaluate the robustness. The test images are “Lena”, “Baboon”, “Head”. The same watermark series is embedded in each standard test image in the same attack method (PSNR ≈ 43 dB). Various types of attack methods and parameters are shown in Table 1. The correlation degree is detected from the attacked watermark image. The watermark algorithms in this paper can be detected the presence of watermark under noise pollution, JPEG compression, wavelet lossy compression, MAP, filtering, segmentation, edge enhancement, contrast change, jitter, template removal, secondary modulation, and general geometric attacks (scaling, rotation, shear). But for random-geometric attacks such as stirmark-attack, algorithm in this paper can’t detect the existence of watermark.

5. Conclusion

A novel watermark algorithm based on the finite Radon transform tight frame has been presented. We derived the relationship among the PSNR, the strength parameter, quadratic sum of watermark series. According to the assigned image quality, the strength parameter *α* and Square sum of watermark series can be estimated. Experimental results reveal that the proposed watermarking algorithm yields watermarked images with superior imperceptibility and robustness to common attacks, such as removal/interference (filtering, MAP, JPEG, dithering, segmentation, noise pollution) and geometrical attacks (translation, cropping, rotation).

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

[1] | Jemila, R. (2018) A Survey on Recent Reversible Watermarking Techniques. International Journal on Recent and Innovation Trends in Computing and Communication, 6, 27-31. https://doi.org/10.17762/ijritcc.v6i10.5190 |

[2] | Yahya, A.N., Hamid, A.J., Ainuddin, W. and Rafidah, M.N. (2015) Robust Watermarking Algorithm for Digital Images Using Discrete Wavelet and Probabilistic Neural Network. Journal of King Saud University—Computer and Information Sciences, 27, 393-401. https://doi.org/10.1016/j.jksuci.2015.02.002 |

[3] | Lu, Z.-M. and Guo, S.-Z. (2017) Lossless Information Hiding in Images on Transform Domains. In: Lossless Information Hiding in Images, Zhejiang University Press, Hangzhou, 143-204. https://doi.org/10.1016/B978-0-12-812006-4.00003-6 |

[4] | Asifullah, K., Ayesha, S., Summuyya, M. and Sana, A.M. (2014) A Recent Survey of Reversible Watermarking Techniques. Information Sciences, 279, 251-272. https://doi.org/10.1016/j.ins.2014.03.118 |

[5] | Reem, A.A. and Lamiaa, A.E. (2019) Text-Image Watermarking Based on Integer Wavelet Transform (IWT) and Discrete Cosine Transform (DCT). Applied Computing and Informatics, 15, 191-202. https://doi.org/10.1016/j.aci.2018.06.003 |

[6] | Jun, Y.W., Wei, L.H., Wei, M., Xia, H., Wei, P.Z. and Li, H.G. (2020) Imperceptible Digital Watermarking Scheme Combining 4-Level Discrete Wavelet Transform with Singular Value Decomposition. Multimedia Tools and Applications, 79, 22727-22747. https://doi.org/10.1007/s11042-020-08987-3 |

[7] | Ingemar, J.C., Joe, K., Thomson, L. and Talal, S. (1997) Secure Spread Spectrum Watermarking for Multimedia. IEEE Transactions on Image Processing, 6, 1673-1687. https://doi.org/10.1109/83.650120 |

[8] | Matus, F. and Flusser, J. (1993) Image Representation via a Finite Radon Transform. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15, 996-1006. https://doi.org/10.1109/34.254058 |

[9] | Do, M.N. and Vetterli, M. (2003) The Finite Ridgelet Transform for Image Representation. IEEE Transactions on Image Processing, 12, 16-28. https://doi.org/10.1109/TIP.2002.806252 |

[10] | Mallat, S. (2009) Frames. In: A Wavelet Tour of Signal Processing, Academic Press, London, 155-204. https://doi.org/10.1016/B978-0-12-374370-1.00009-4 |

[11] | Martin, K. and Fabien, A.P.P. (1999) Fair Benchmark for Image Watermarking Systems. Proceedings of Electronic Imaging: The Security and Watermarking of Multimedia Contents, San Jose, 25-27 January 1999, Vol. 3657, 226-239. https://doi.org/10.1117/12.344672 |

[12] | Xiaoyan, Y., Chengyou, W. and Xiao, Z. (2019) A Hybrid Transforms-Based Robust Video Zero-Watermarking Algorithm for Resisting High Efficiency Video Coding Compression. IEEE Access, 7, 115708-115724. https://doi.org/10.1109/ACCESS.2019.2936134 |

[13] | Feng, B., Li, X.L., Jie, Y.M., Guo, C. and Fu, H.J. (2020) A Novel Semi-Fragile Digital Watermarking Scheme for Scrambled Image Authentication and Restoration. Mobile Networks and Applications, 25, 82-94. https://doi.org/10.1007/s11036-018-1186-9 |

[14] | Stankovic, S., Djurovic, I. and Pitas, L. (2001) Watermarking in the Space/Spatial- Frequency Domain Using Two-Dimensional Radon-Wigner Distribution. IEEE Trans Image Process, 10, 650-658. https://doi.org/10.1109/83.913599 |

[15] | Peter, M. and Shelby, P. (2002) Attacks, Applications, and Evaluation of Known Watermarking Algorithms with Checkmark. Proceedings of Electronic Imaging: Security and Watermarking of Multimedia Contents, San Jose, 21-24 January 2002, Vol. 4675, 293-304. https://doi.org/10.1117/12.465287 |

Journals Menu

Contact us

+1 323-425-8868 | |

customer@scirp.org | |

+86 18163351462(WhatsApp) | |

1655362766 | |

Paper Publishing WeChat |

Copyright © 2024 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.