# Robust Zero Watermarking Algorithm for Medical Images Based on Zernike-DCT

Authors: Chengshan Yang; Jingbing Li; Uzair Aslam Bhatti; Jing Liu; Jixin Ma; Mengxing Huang
Journal: Security and Communication Networks
 (2021)

---

## Abstract

Digital medical system not only facilitates the storage and transmission of medical information but also brings information security problems. Aiming at the security of medical images, a robust zero watermarking algorithm for medical images based on Zernike-DCT is proposed. The algorithm first uses a chaotic logic sequence to preprocess and encrypt the watermark, then performs edge detection and Zernike moment processing on the original medical image to get the accurate edge points, and then performs discrete cosine transform (DCT) on them to get the feature vector. Finally, it combines perceptual Hash and zero watermark technology to generate the key to complete the watermark embedding and extraction. The algorithm has good robustness to conventional and geometric attacks, strong antinoise ability, high positioning accuracy, and processing efficiency and is superior to the classical edge detection algorithm in extraction effect. It is a stable and reliable image edge detection algorithm.


---

## Body

## 1. Introduction

In the past two decades, the advent of the era of big data has allowed the explosive development of computer science technology and multimedia communication technology, which has accelerated the digital development process of the healthcare system [1]. When the data containing our personal private information are uploaded to the cloud storage server, we lose direct control over the data, which makes us worry about the security of our private information [2]. With the continuous development of modern medical imaging technology, medical institutions produce a large number of different types of medical images every day, such as CT, MRI, color Doppler ultrasound, OCT, and X-ray [3]. However, when these medical images are stored and transmitted on the Internet, they are susceptible to unintentional or a variety of malicious attacks, resulting in poor security [4, 5]. Medical images are the main basis for doctors to judge the condition, so it is very important to ensure the safety of medical images during network transmission [6]. The emergence of digital watermarking technology [7–9] is an effective improvement to traditional encryption technology. It embeds the patient’s personal information and the cause of disease as a digital watermark into medical images. It has strong security and robustness. It can ensure that after network transmission and data processing, the digital watermark can still be extracted completely and reliably, and the patient’s personal information can be protected.So far, many experts have done a lot of research on the design of digital watermarking and put forward many feasible digital watermarking algorithms [10, 11]. Cui et al. [12] proposed a color image wavelet domain digital watermarking optimization algorithm based on differential evolution. Firstly, Arnold scrambling transform was used to encrypt the watermark image, and then the color image was transformed from RGB space to YIO space suitable for the human visual system, and then three-level DWT transform and SVD decomposition were performed on it. The algorithm adaptively selected scale factor for embedding watermark information. However, it is a little complex, time-consuming, and generally robust. Kamble et al. [13] proposed an innovative data recovery method based on robust reversible watermarking. The algorithm uses a pseudo-random number generator to generate a random key. The key and the data are binary XOR encrypted, and then the encrypted data are embedded into the cover image using the least significant bit (LSB) algorithm to form a watermark image. This algorithm only embeds three bytes of encrypted data, so the capacity of the payload needs to be improved. Fang et al. [14] proposed a blind watermarking technology based on DCT domain. First, Arnold chaotic scrambling was performed on the watermark before embedding to obtain a one-dimensional sequence. Then, the original image was transformed by 8∗8 block DCT, and intermediate frequency coefficients were selected. Then, a one-dimensional sequence was embedded in it, and each block was transformed by IDCT to obtain the image-embedded watermark. The algorithm is simple to embed and extract and does not need the participation of the original image, so it realizes the blind extraction. However, it is less robust to strong noise attack and geometric attack. Ghosal and Mehrotra [15] proposed for the first time to use Zernike orthogonal moments to calculate parameters to realize subpixel edge detection, but this algorithm did not consider the amplification effect of the template, resulting in large errors in the calculation results. Dong and Liu [16] proposed the application of Zernike moment in medical image processing, which proved that Zernike moment is an effective image description method, and has its unique advantages, which meets the technical requirements of high accuracy, good robustness, insensitive to noise and artifacts, and easy to combine with a variety of algorithms in the field of medical image processing. Xue et al. conducted in-depth ontology matching research in order to solve the heterogeneous problem of biomedical ontology [17–19]. An extended compact genetic algorithm-based ontology entity matching technique (ECGA-OEM) is proposed, which uses both the compact encoding mechanism and linkage learning approach to match the ontologies efficiently. A central concepts-based ontology partitioning algorithm is first used to divide the ontology into several disjoint segments, which borrows the idea from the social network and firefly Algorithm (FA). The comparison with the most advanced ontology matching technology shows the robustness and effectiveness of these methods. At present, there are many research studies based on deep learning, which can carry out image feature extraction [20, 21] and natural language processing [22–24], but deep learning requires a large number of samples and corresponding tags. There are few samples of medical images and corresponding privacy labels, so only professionals can calibrate medical image labels.The disadvantage of these algorithms is that they are not very robust to geometric attacks [25], especially rotation attacks. In the field of medical image digital watermarking research, geometric attacks are still a relatively difficult problem to solve so far. In practical applications, medical digital watermarking images are often subject to both conventional attacks and geometric attacks [26]. Therefore, to improve the security of medical information, this paper proposes a zero watermarking algorithm of medical images based on Zernike-DCT. In this scheme, edge detection and Zernike moment processing are performed on the medical image, then discrete cosine transform is performed, and the 32-bit coefficient matrix is selected as the feature vector of the medical image to embed and extract the watermark. The watermark is encrypted by chaos, and zero watermark [27] and blind extraction are realized by using Perceptual Hashing technology [28] and cryptography principle. The algorithm solves the contradiction between invisibility and robustness, and can well resist conventional attacks and geometric attacks, especially rotation attacks. The robustness of the algorithm is very good, and the security of the watermark is improved.This paper consists of five sections: Introduction, Fundamental Theory, Watermarking Algorithm, Results and Discussion, and Conclusion. The first section mainly introduces the development background of medical images in the era of big data, the importance of security and privacy, and the in-depth research on digital watermarking algorithms by experts in recent years. The second section mainly introduces the fundamental theory of the algorithm proposed in this paper, including Canny edge detection, Zernike moment, and Logistic mapping. The third section mainly introduces the specific implementation process of the algorithm proposed in this paper, including watermark encryption, watermark embedding, watermark extraction and decryption, and watermark evaluation methods. The fourth section mainly introduces the results and discussion, including the experimental platform and materials, display of the data and images, and analysis of the experimental results. The fifth section mainly summarizes the main ideas and advantages of this algorithm, which has good robustness, imperceptibility, stability, and reliability.


## 2. The Fundamental Theory

### 2.1. Canny Edge Detection

The edge of a gray image is generally the place where the gray level of the image changes dramatically. There are many methods of gray image edge detection [29]. The Canny edge detection method is considered to be one of the most successful gray edge detection methods, and it is also the most widely used edge detection method. Canny edge detection process is as follows.Firstly, a Gaussian filter is used to filter the input image to reduce the influence of noise on gradient calculation. The Gaussian filter formula is as follows:(1)Gx,y,σ=12πσ2exp−x2+y22σ2.First-order difference operator is used to calculate the gradient amplitude components in the horizontal and vertical directions so as to obtain the gradient amplitude and gradient direction of the image.(2)M=Gx2+Gy2,(3)θ=arctanGyGx.The gradient amplitude is not maximally suppressed. The gradient intensity of the current pixel is compared with the two pixels along the positive and negative gradient direction. If the gradient intensity of the current pixel is the largest compared with the other two pixels, the pixel is retained as an edge point; otherwise, the pixel will be suppressed.Through the method of double threshold to extract the edge of the image, TH is the high threshold and TL is the low threshold; it is recommended that the ratio of high threshold and low threshold should be 2 : 1 or 3 : 1. If the gradient value of the edge pixel is higher than the high threshold, it is marked as a strong edge pixel. If the gradient value of the edge pixel is less than the high threshold and greater than the low threshold, it is marked as a weak edge pixel. If the gradient value of the edge pixel is less than the low threshold, it will be suppressed. The selection of threshold depends on the content of the given input image.


### 2.2. Zernike Moment

Then-th-order m-order Zernike moment of two-dimensional continuous image fx,y is defined as follows:(4)Znm=n+1π∬x2+y2≤1fx,yVnm∗ρ,θdxdy,where Vnm∗ρ,0 is the conjugate complex number of Vnmρ,0.From the ideal subpixel edge detection model of an image, the mode of an image before and after rotation remains unchanged, and only the phase angle changes. The relationship between Zernike momentZnm′ after rotation and Zernike moment Znm before rotation and the formula of edge parameters are as follows:(5)Znm′=Znme−imφ,(6)φ=arctanImZ11ReZ11.The other three edge parametersh, K, and l can be calculated by using the Zernike moment formula of image rotation where h is the background gray, K represents gray scale difference, and l is the vertical distance from the center of the unit circle to the edge:(7)k=3Z1121−l23/2ejφ,(8)h=Z00kπ/2+karcsinl+kl1−l2π,(9)l=Z20Z11e−jφ.In the discrete case, the template and pixel gray value convolution are used to calculate the moment [30]. Due to the template effect, when the unit circle is used for sampling in the N× N pixel area, the template moves on the image for convolution. The template contains N2 pixels around the center of the template. At this time, the unit radius becomes N/2, so it needs the vertical distance l calculated on the unit circle which is enlarged by N/2 times, so the calculation formula of the subpixel coordinates of the pixel point is as follows:(10)xsys=xy+N2lcosφsinφ.Among them,xs and ys are the subpixel coordinates of the edge and x and y are the origin coordinates.


### 2.3. Logistic Mapping

The encryption of the watermark adopts a logistic map. One-dimensional logistic map is one of the most famous chaotic maps, and it is a simple dynamic nonlinear regression with chaotic behavior. Its mathematical definition is as follows:(11)xk+1=μ⋅xk1−xk,where x(k) ∈ (0, 1), 0 < μ <= 4, and μ is called logistic parameter. Logistic map is not necessarily in a chaotic state, which is related to the value of μ. Experiments show that when 3.5699456 < u <= 4, the value generated by iteration is in a state of pseudo-random distribution. At this time, a logistic map works in a chaotic state [31], and a logistic chaotic sequence can be used as an ideal key sequence.


## 2.1. Canny Edge Detection

The edge of a gray image is generally the place where the gray level of the image changes dramatically. There are many methods of gray image edge detection [29]. The Canny edge detection method is considered to be one of the most successful gray edge detection methods, and it is also the most widely used edge detection method. Canny edge detection process is as follows.Firstly, a Gaussian filter is used to filter the input image to reduce the influence of noise on gradient calculation. The Gaussian filter formula is as follows:(1)Gx,y,σ=12πσ2exp−x2+y22σ2.First-order difference operator is used to calculate the gradient amplitude components in the horizontal and vertical directions so as to obtain the gradient amplitude and gradient direction of the image.(2)M=Gx2+Gy2,(3)θ=arctanGyGx.The gradient amplitude is not maximally suppressed. The gradient intensity of the current pixel is compared with the two pixels along the positive and negative gradient direction. If the gradient intensity of the current pixel is the largest compared with the other two pixels, the pixel is retained as an edge point; otherwise, the pixel will be suppressed.Through the method of double threshold to extract the edge of the image, TH is the high threshold and TL is the low threshold; it is recommended that the ratio of high threshold and low threshold should be 2 : 1 or 3 : 1. If the gradient value of the edge pixel is higher than the high threshold, it is marked as a strong edge pixel. If the gradient value of the edge pixel is less than the high threshold and greater than the low threshold, it is marked as a weak edge pixel. If the gradient value of the edge pixel is less than the low threshold, it will be suppressed. The selection of threshold depends on the content of the given input image.


## 2.2. Zernike Moment

Then-th-order m-order Zernike moment of two-dimensional continuous image fx,y is defined as follows:(4)Znm=n+1π∬x2+y2≤1fx,yVnm∗ρ,θdxdy,where Vnm∗ρ,0 is the conjugate complex number of Vnmρ,0.From the ideal subpixel edge detection model of an image, the mode of an image before and after rotation remains unchanged, and only the phase angle changes. The relationship between Zernike momentZnm′ after rotation and Zernike moment Znm before rotation and the formula of edge parameters are as follows:(5)Znm′=Znme−imφ,(6)φ=arctanImZ11ReZ11.The other three edge parametersh, K, and l can be calculated by using the Zernike moment formula of image rotation where h is the background gray, K represents gray scale difference, and l is the vertical distance from the center of the unit circle to the edge:(7)k=3Z1121−l23/2ejφ,(8)h=Z00kπ/2+karcsinl+kl1−l2π,(9)l=Z20Z11e−jφ.In the discrete case, the template and pixel gray value convolution are used to calculate the moment [30]. Due to the template effect, when the unit circle is used for sampling in the N× N pixel area, the template moves on the image for convolution. The template contains N2 pixels around the center of the template. At this time, the unit radius becomes N/2, so it needs the vertical distance l calculated on the unit circle which is enlarged by N/2 times, so the calculation formula of the subpixel coordinates of the pixel point is as follows:(10)xsys=xy+N2lcosφsinφ.Among them,xs and ys are the subpixel coordinates of the edge and x and y are the origin coordinates.


## 2.3. Logistic Mapping

The encryption of the watermark adopts a logistic map. One-dimensional logistic map is one of the most famous chaotic maps, and it is a simple dynamic nonlinear regression with chaotic behavior. Its mathematical definition is as follows:(11)xk+1=μ⋅xk1−xk,where x(k) ∈ (0, 1), 0 < μ <= 4, and μ is called logistic parameter. Logistic map is not necessarily in a chaotic state, which is related to the value of μ. Experiments show that when 3.5699456 < u <= 4, the value generated by iteration is in a state of pseudo-random distribution. At this time, a logistic map works in a chaotic state [31], and a logistic chaotic sequence can be used as an ideal key sequence.


## 3. Watermarking Algorithm

### 3.1. Watermark Encryption

The process of digital watermark encryption is shown in Figure1.Figure 1
Digital watermark encryption process.The chaotic sequence is generated by the initial valuex0 of the logistic mapping. The chaotic sequence generated by different initial values is different, and it is a one-dimensional sequence. It also needs to be upgraded to a binary sequence Bi,j and then XOR with the original watermark Wi,j to get the encrypted digital watermark BWi,j. Even if the algorithm is public, the original watermark cannot be restored without the private key x0.


### 3.2. Watermark Embedding

The digital watermarking system mainly includes watermark embedding and extraction. At the same time, this paper also combines the zero watermark technology and perceptual hash to achieve zero watermark embedding without changing the original medical image. The specific steps are shown in Figure2.Figure 2
Medical image feature vector extraction and watermark embedding process.It can be seen from Figure2 that the Canny operator is used to perform edge detection on the original medical image Fi,j. The coordinates and gradient direction of the edge point are determined at the pixel level to obtain the coarse positioning of the edge point and the edge point coordinate matrix Ci,j.According to the constructed edge point vector and reference threshold, the edge points are repositioned by the Zernike moment algorithm to realize the subpixel edge detection of the image, and the subpixel coordinate matrixZi,j is obtained, and finally DCT transformation is performed on it and a hash function is used to obtain 4∗8 visual feature vector Vj.The visual feature vectorVj and the encrypted digital watermark BWi,j obtain the Keyi,j through the hash function commonly used in cryptography and save it to a third party to obtain the ownership of the original image so that it can be used to extract the watermark later.(12)Keyi,j=BWi,j⊕Vj.


### 3.3. The Extraction and Decryption of Watermark

Watermark extraction is the reverse process of watermark embedding. The process of extracting and decrypting the original watermark is shown in Figure3.Figure 3
Watermark extraction and decryption process.According to the method of extracting the feature vector of the original medical image, the feature vector of the medical image to be tested is extracted, and the encrypted watermarkBW′i,j in the image to be tested is obtained by hash function with the Keyi,j mentioned above. The binary encryption sequence B′i,j is obtained by upgrading the dimension of the one-dimensional sequence generated by the initial value x0 of logistic mapping. It can restore watermark W′i,j by Hash function properties with BW′i,j. The method proposed in this paper does not need the original medical image when extracting the watermark, which can protect the medical image from any interference and improve the security of the watermark.(13)BW′i,j=Keyi,j⊕V′j,(14)W′i,j=B′i,j⊕BW′i,j.


### 3.4. Evaluation of Watermark

The normalized correlation coefficient is used to evaluate the similarity between the original watermark and the extracted watermark, and the peak signal-to-noise ratio is used to measure the distortion of the medical image with the watermark.(15)NC=∑i∑jWi,jW′i,j∑i∑jWi,j2,(16)PSNR=10lgMNmaxIi,j2∑i∑jIi,j−I′i,j2.


## 3.1. Watermark Encryption

The process of digital watermark encryption is shown in Figure1.Figure 1
Digital watermark encryption process.The chaotic sequence is generated by the initial valuex0 of the logistic mapping. The chaotic sequence generated by different initial values is different, and it is a one-dimensional sequence. It also needs to be upgraded to a binary sequence Bi,j and then XOR with the original watermark Wi,j to get the encrypted digital watermark BWi,j. Even if the algorithm is public, the original watermark cannot be restored without the private key x0.


## 3.2. Watermark Embedding

The digital watermarking system mainly includes watermark embedding and extraction. At the same time, this paper also combines the zero watermark technology and perceptual hash to achieve zero watermark embedding without changing the original medical image. The specific steps are shown in Figure2.Figure 2
Medical image feature vector extraction and watermark embedding process.It can be seen from Figure2 that the Canny operator is used to perform edge detection on the original medical image Fi,j. The coordinates and gradient direction of the edge point are determined at the pixel level to obtain the coarse positioning of the edge point and the edge point coordinate matrix Ci,j.According to the constructed edge point vector and reference threshold, the edge points are repositioned by the Zernike moment algorithm to realize the subpixel edge detection of the image, and the subpixel coordinate matrixZi,j is obtained, and finally DCT transformation is performed on it and a hash function is used to obtain 4∗8 visual feature vector Vj.The visual feature vectorVj and the encrypted digital watermark BWi,j obtain the Keyi,j through the hash function commonly used in cryptography and save it to a third party to obtain the ownership of the original image so that it can be used to extract the watermark later.(12)Keyi,j=BWi,j⊕Vj.


## 3.3. The Extraction and Decryption of Watermark

Watermark extraction is the reverse process of watermark embedding. The process of extracting and decrypting the original watermark is shown in Figure3.Figure 3
Watermark extraction and decryption process.According to the method of extracting the feature vector of the original medical image, the feature vector of the medical image to be tested is extracted, and the encrypted watermarkBW′i,j in the image to be tested is obtained by hash function with the Keyi,j mentioned above. The binary encryption sequence B′i,j is obtained by upgrading the dimension of the one-dimensional sequence generated by the initial value x0 of logistic mapping. It can restore watermark W′i,j by Hash function properties with BW′i,j. The method proposed in this paper does not need the original medical image when extracting the watermark, which can protect the medical image from any interference and improve the security of the watermark.(13)BW′i,j=Keyi,j⊕V′j,(14)W′i,j=B′i,j⊕BW′i,j.


## 3.4. Evaluation of Watermark

The normalized correlation coefficient is used to evaluate the similarity between the original watermark and the extracted watermark, and the peak signal-to-noise ratio is used to measure the distortion of the medical image with the watermark.(15)NC=∑i∑jWi,jW′i,j∑i∑jWi,j2,(16)PSNR=10lgMNmaxIi,j2∑i∑jIi,j−I′i,j2.


## 4. Simulation and Results

This experiment is simulated on matlab2018a. The 32∗32-pixel meaningful letter “HN” image is selected as the digital watermark, and the 512∗512-pixel brain medical image is selected as the original medical image. In the watermark encryption process, the initial value of the logistic chaotic system is 0.2, the growth parameter is 4, and the number of iterations is 32. To verify the particularity and feasibility of this algorithm, the similarity between six different medical images is tested. Figure 4 shows six different medical images, and Table 1 shows the tested NC values. The data show that the NC values of different images are less than 0.5, and the NC values of the same image are all 1, which shows that the algorithm is special and feasible.Figure 4
Different medical images: (a) brain; (b) lung; (c) sacroiliac; (d) spine; (e) knee; (f) kidney.
(a)(b)(c)(d)(e)(f)Table 1
Correlation coefficient value between different images (32 bit).
ImageBrainLungSacroiliacSpineKneeKidneyBrain10.3130.208−0.125−0.0630.125Lung0.31310.4480.0620.011−0.062Sacroiliac0.2080.4481−0.070.0480.069Spine−0.1250.062−0.0691−0.063−0.12Knee−0.0630.0110.048−0.06410.063Kidney0.125−0.0630.069−0.1250.0631


### 4.1. The Results of the Attack on Encrypted Watermark

To verify the robustness of the digital watermark under this algorithm, the encrypted watermark is subjected to different degrees of conventional attacks and geometric attacks, as shown in Table2 and Figure 5. From the data in Table 2, with the increase in attack intensity, the PSNR and NC values of the encrypted watermark decrease gradually, but the NC value is still far greater than 0.5, indicating that the watermark can be extracted clearly. When the intensity of Gaussian noise reaches 30%, the NC value is 0.68, greater than 0.5, which can effectively resist the Gaussian noise attack. When the JPEG compression strength is 20%∼80%, the NC value is 1, which shows that the algorithm has strong robustness against JPEG compression attack. When the median filter window is 7∗7, the NC value is 0.73, which can effectively resist the median filter attack. Geometric attack is a difficult problem for all encryption algorithms, but this algorithm still has an excellent performance in resisting geometric attack, especially in resisting rotation attack; when the medical image rotates clockwise to 38°, the NC value of the encrypted watermark is still as high as 0.6. When the scaling degree is 2, the NC value is 0.95. When the strength of left movement attack and cropping attack is 10%, the NC values are 0.63 and 0.74, respectively, and the NC value after geometric attack is greater than 0.5, which proves that the algorithm has strong robustness, and can better resist conventional attacks and geometric attacks.Table 2
PSNR and NC values under different attacks.
Type of attacksParameterPSNRNCGaussian noise (%)514.310.921011.860.92209.760.87308.770.68JPEG compression (%)2033.8114035.4616036.4218037.821Median filter (5 times)3∗334.490.955∗529.950.917∗727.540.73Rotation (°) (clockwise)518.000.821015.600.822014.600.793014.400.703814.130.60Scaling factor0.4—0.680.8—0.871.2—12—0.95Movement (%) (left)117.991514.480.91814.210.721013.820.63Cropping (%) (Y direction)3—0.915—0.7810—0.7420—0.64Figure 5
Part of the medical image and the extracted watermarking after the attacks: (a) Gaussian noise 5%; (c) JPEG compression 80%; (e) median filter [5∗5], 5 times; (g) rotation 30%; (i) scale 2 times; (k) cropping (Y direction) 20%; (b), (d), (f), (h), (j), and (l) extracted watermarking.
(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)(k)(l)


### 4.2. Algorithms Comparison

To further verify the superiority of the algorithm proposed in this paper, we compare it with the NC value of the Canny-DCT algorithm, as shown in Table3.Table 3
Comparison between different algorithms.
Type of attacksParameterCanny-DCTZernike-DCTGaussian noise (%)50.350.92100.400.92JPEG compression (%)200.781400.961Median filter (5 times)3∗30.810.955∗50.590.917∗70.420.73Rotation (°) (clockwise)100.670.82200.710.79350.670.70Scaling factor1.20.96120.830.95Movement (%) (left)10.78150.700.91100.480.63Cropping (%) (Y direction)100.690.74200.600.64From the data, we can see that the NC value of the algorithm proposed in this paper is much larger than the NC value of the Canny-DCT algorithm; for scaling and clipping attacks in geometric attacks, the NC value of this algorithm is similar to that of the Canny-DCT algorithm. In terms of rotation and left shift attacks, the NC value of the algorithm is larger than that of the Canny-DCT algorithm. In general, it is proved that the proposed algorithm is more robust than the comparison algorithm, and it is a zero watermark algorithm with higher security.


### 4.3. Runtime Performance

Runtime performance is the key evaluation criterion. Table4 shows the running time of each key step of the algorithm.Table 4
The running time of each part in the proposed algorithm.
TimeDescriptionRunning time (ms)T1The time it takes to encrypt the watermark image6.5T2The time it takes to extract the features of Figure4(a)61.8T3The time it takes to embed an encrypted watermark in Figure4(a)1.8T4The time it takes to extract the encrypted watermark from the attacked Figure4(a)1.3T5The time it takes to decrypt the extracted encrypted watermark5.2


## 4.1. The Results of the Attack on Encrypted Watermark

To verify the robustness of the digital watermark under this algorithm, the encrypted watermark is subjected to different degrees of conventional attacks and geometric attacks, as shown in Table2 and Figure 5. From the data in Table 2, with the increase in attack intensity, the PSNR and NC values of the encrypted watermark decrease gradually, but the NC value is still far greater than 0.5, indicating that the watermark can be extracted clearly. When the intensity of Gaussian noise reaches 30%, the NC value is 0.68, greater than 0.5, which can effectively resist the Gaussian noise attack. When the JPEG compression strength is 20%∼80%, the NC value is 1, which shows that the algorithm has strong robustness against JPEG compression attack. When the median filter window is 7∗7, the NC value is 0.73, which can effectively resist the median filter attack. Geometric attack is a difficult problem for all encryption algorithms, but this algorithm still has an excellent performance in resisting geometric attack, especially in resisting rotation attack; when the medical image rotates clockwise to 38°, the NC value of the encrypted watermark is still as high as 0.6. When the scaling degree is 2, the NC value is 0.95. When the strength of left movement attack and cropping attack is 10%, the NC values are 0.63 and 0.74, respectively, and the NC value after geometric attack is greater than 0.5, which proves that the algorithm has strong robustness, and can better resist conventional attacks and geometric attacks.Table 2
PSNR and NC values under different attacks.
Type of attacksParameterPSNRNCGaussian noise (%)514.310.921011.860.92209.760.87308.770.68JPEG compression (%)2033.8114035.4616036.4218037.821Median filter (5 times)3∗334.490.955∗529.950.917∗727.540.73Rotation (°) (clockwise)518.000.821015.600.822014.600.793014.400.703814.130.60Scaling factor0.4—0.680.8—0.871.2—12—0.95Movement (%) (left)117.991514.480.91814.210.721013.820.63Cropping (%) (Y direction)3—0.915—0.7810—0.7420—0.64Figure 5
Part of the medical image and the extracted watermarking after the attacks: (a) Gaussian noise 5%; (c) JPEG compression 80%; (e) median filter [5∗5], 5 times; (g) rotation 30%; (i) scale 2 times; (k) cropping (Y direction) 20%; (b), (d), (f), (h), (j), and (l) extracted watermarking.
(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)(k)(l)


## 4.2. Algorithms Comparison

To further verify the superiority of the algorithm proposed in this paper, we compare it with the NC value of the Canny-DCT algorithm, as shown in Table3.Table 3
Comparison between different algorithms.
Type of attacksParameterCanny-DCTZernike-DCTGaussian noise (%)50.350.92100.400.92JPEG compression (%)200.781400.961Median filter (5 times)3∗30.810.955∗50.590.917∗70.420.73Rotation (°) (clockwise)100.670.82200.710.79350.670.70Scaling factor1.20.96120.830.95Movement (%) (left)10.78150.700.91100.480.63Cropping (%) (Y direction)100.690.74200.600.64From the data, we can see that the NC value of the algorithm proposed in this paper is much larger than the NC value of the Canny-DCT algorithm; for scaling and clipping attacks in geometric attacks, the NC value of this algorithm is similar to that of the Canny-DCT algorithm. In terms of rotation and left shift attacks, the NC value of the algorithm is larger than that of the Canny-DCT algorithm. In general, it is proved that the proposed algorithm is more robust than the comparison algorithm, and it is a zero watermark algorithm with higher security.


## 4.3. Runtime Performance

Runtime performance is the key evaluation criterion. Table4 shows the running time of each key step of the algorithm.Table 4
The running time of each part in the proposed algorithm.
TimeDescriptionRunning time (ms)T1The time it takes to encrypt the watermark image6.5T2The time it takes to extract the features of Figure4(a)61.8T3The time it takes to embed an encrypted watermark in Figure4(a)1.8T4The time it takes to extract the encrypted watermark from the attacked Figure4(a)1.3T5The time it takes to decrypt the extracted encrypted watermark5.2


## 5. Conclusions

A robust zero watermarking algorithm for medical images based on the Zernike-DCT transform is proposed. Firstly, the traditional Canny operator is used for edge detection to get coarse edge points. Then, the Zernike moment is used for processing to get subpixel accurate edge points. Finally, the DCT transform is used to get a 32-bit visual feature vector; a logistic chaotic map is used to encrypt the digital watermark, which further improves the security of the algorithm. The algorithm combines Perceptual Hashing, zero watermark technology, and the concept of a third party, which can complete the embedding and extraction of the watermark without changing the original medical image data. Experimental results show that the algorithm has good robustness to conventional and geometric attacks and has good imperceptibility. It effectively solves the contradiction between imperceptibility and robustness and has a strong antinoise ability. It is a stable and reliable robust digital watermarking algorithm for medical images.


### 5.1. Limitations

The low-order moment eigenvector describes the overall shape of an image target, and the high-order moment eigenvector describes the details of the image target. The Zernike moment template used in this algorithm is 7∗7. The larger the Zernike moment template, the higher the accuracy, but the longer the operation time.


## 5.1. Limitations

The low-order moment eigenvector describes the overall shape of an image target, and the high-order moment eigenvector describes the details of the image target. The Zernike moment template used in this algorithm is 7∗7. The larger the Zernike moment template, the higher the accuracy, but the longer the operation time.



---

*Source: 4944797-2021-11-10.xml*