|Computers, Materials & Continua |
A Zero-Watermark Scheme Based on Quaternion Generalized Fourier Descriptor for Multiple Images
1School of Computer Science, Nanjing University of Information Science and Technology, Nanjing, 210044, China
2Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology (CICAEET), Nanjing, 210044, China
3Engineering Research Center of Digital Forensics, Ministry of Education, Nanjing, 210044, China
4Department of Mathematics and Computer Science, Northeastern State University, Tahlequah, OK, 74464, USA
*Corresponding Author: Baowei Wang. Email: firstname.lastname@example.org
Received: 03 August 2021; Accepted: 16 September 2021
Abstract: Most of the existing zero-watermark schemes for medical images are only appropriate for a single grayscale image. When they protect a large number of medical images, repeating operations will cause a significant amount of time and storage costs. Hence, this paper proposes an efficient zero-watermark scheme for multiple color medical images based on quaternion generalized Fourier descriptor (QGFD). Firstly, QGFD is utilized to compute the feature invariants of each color image, then the representative features of each image are selected, stacked, and reshaped to generate a feature matrix, which is then binarized to get a binary feature image. Copyright information can be converted into the copyright image by using QR code technology, which contains more information. Finally, the zero-watermark image is constructed by executing the XOR operation on the copyright image and the feature image scrambled by the Cat map. In the experiment, different parameters are selected to determine the maximum number of images that the proposed scheme can protect simultaneously while achieving good robustness. The experimental results demonstrate that the proposed scheme can effectively resist common attacks, geometric attacks and joint attacks, and effectively improve the operation efficiency of the algorithm, thus effectively decreasing the time and storage cost of copyright protection for lots of medical images.
Keywords: Copyright protection; color medical image; zero-watermark; QGFD
With the development of multimedia technology and information processing technology, digitization has become an important means of information sharing and transmission, and it is widely used in many fields. In recent years, the rapid application of digitization in the medical field has benefited from the development of medical imaging technology and equipment, as well as the urgent need for hospital information construction. The medical images obtained by medical imaging equipment, such as CT images, ultrasound images, X-ray images, and fundus color images, can provide an important reference basis for clinical diagnosis and scientific research, and promote the convenience and development of remote consultation and remote cooperation. However, the content of medical images contains the patient's personal and medical information. Once these images are intercepted and stolen during the process of shared transmission and local storage, this will lead to information security issues such as infringement of patient privacy and leakage of medical data. Therefore, how to effectively avoid these security problems has become an urgent need. In recent years, mature digital watermark technology [1–8] that integrates knowledge from multiple parties has been widely used in fields such as copyright certification protection and digital content forensics. It modifies the image data to embed watermark information that is invisible to the naked eye, and realize the ownership protection and traceability of the image. However, medical images are an important basis for the diagnosis of patients, and no modification is allowed on them, so as not to affect the quality and integrity of the images. Therefore, how to protect medical images non-destructively has become the key to research.
In 2001, Wen et al.  put forward the concept of zero-watermark for the first time, which effectively avoids the problem that image quality is affected by the traditional method of modifying image data. As a lossless watermark technology, zero-watermark is more suitable for the protection of medical images and can effectively guarantee the integrity and quality of the images. Since the introduction of zero-watermark, many scholars have devoted themselves to the research of zero-watermark technology, and have achieved many excellent scientific research results. However, most zero-watermark algorithms [10–15] are only applicable to a single image. As the number of images that need to be protected increases, the repetitive operation of these algorithms will bring higher time and storage costs. In recent years, the emergence of zero-watermark algorithms [16–18] for multiple images can protect two or three or more images simultaneously, but these algorithms essentially group grayscale images for protection. When the number of images that need to be protected increases sharply, like the zero-watermark algorithm for a single image, these algorithms will also cause higher time and storage costs, and reduce the efficiency of the algorithm.
To the above problems, this paper proposes an efficient zero-watermark scheme for multiple color medical images. Firstly, QGFD is used to calculate the feature invariants of each image. Because the invariants obtained by QGFD have better stability, the algorithm has strong robustness. Then, the main representative features of each image are selected, stacked, reshaped, and formed into a feature matrix, and then the binary feature image can be obtained by binarization according to the mean of the elements of the feature matrix. Integrating the features of multiple images into a matrix effectively improves the efficiency of the algorithm and saves the cost of storage space during copyright protection. The QR code technology is introduced to convert copyright information into copyright images so that it contains more copyright information. Finally, Cat map is used to scramble the copyright image and the feature image, and the XOR operation is performed on the scrambled two images to get the zero-watermark image. The use of Cat map enhances the security of the proposed scheme. The experimental results show that the proposed scheme using QGFD has strong robustness in dealing with various attacks, and can effectively reduce the time and storage cost of a large number of medical image protection, and improve the execution efficiency of the algorithm.
The rest of the paper is organized as follows: Section 2 summarizes the main related work of zero-watermark; Section 3 introduces related background knowledge principles; Section 4 presents the proposed zero-watermark scheme; Section 5 demonstrates and analyzes the performance of the proposed scheme; Section 6 summarizes the work of the paper.
2 Related Work
In 2001, Wen et al.  proposed the concept of zero-watermark. Each image has feature information that is different from other images, which can be used to construct a zero-watermark without modifying the data. They apply the discrete cosine transform (DCT) to the image to obtain the robust features of the image and build the zero-watermark image based on them. Their method overcomes the problem that the traditional watermark algorithm is difficult to resist the statistical attack and verifies the feasibility of the proposed zero-watermark algorithm. Subsequently, Wen et al.  proposed a zero-watermark method based on high-order cumulants, which has achieved good performance in dealing with noise attacks and small-angle rotation attacks. Chen et al.  proposed an image copyright protection scheme based on the wavelet domain. It uses the low-frequency component of the image obtained by the wavelet transform to construct the feature matrix and carries out the digital signature according to the security parameters. Finally, it is saved to the third-party certification body and adds the time stamp according to the date and time. This scheme can effectively resist common image processing attacks and geometric attacks, and has strong robustness. Chang et al.  innovatively paid attention to the edge features of the image and used Sobel technology to extract features. This is a relatively novel method, and the robustness of the method can be enhanced by adjusting the strength of the watermark. Tsai et al.  proposed a lossless image watermark scheme based on -trimmed mean algorithm and support vector machine (SVM). The scheme trains SVM to record the relationship between image feature information and watermark, and uses the trained SVM to recover the watermark to confirm the ownership of copyright. The -trimmed mean algorithm can effectively reduce the influence of noise and improve the robustness of the algorithm. Subsequently, Tsai et al.  obtained image feature invariants based on discrete Fourier transform (DFT) and SVM, and the optimal parameters were determined by particle swarm optimization (PSO) algorithm, thus to some extent making up for the shortcomings of some algorithms in dealing with geometric attacks.
Shao et al.  proposed a watermark algorithm based on orthogonal Fourier-Mellin moments (OFMM) and chaotic mapping, which mapped two images into the real and imaginary parts of the complex number respectively to obtain a whole structure and then calculated the invariants of the OFMM. Experimental results show that the proposed algorithm has good robustness and can reduce the storage space. Subsequently, Shao et al.  applied quaternion moment to the image watermark algorithm. The quaternion can make full use of the color information of the image to construct the watermark by its excellent characteristics. They also demonstrated the robustness and feasibility of quaternion moments such as quaternion Fourier-Melin moments (QFMMs) and quaternion Zernike moments (QZMs) through experiments. Aiming at the problem that existing algorithms only target grayscale images and are difficult to effectively resist geometric attacks, Wang et al.  proposed a zero-watermark algorithm based on quaternion exponential moments. This algorithm calculates the quaternion exponential moments of color images and constructs the feature image based on it. Finally, the XOR operation is performed on the feature image and the logo image to get the zero-watermark image. Experiments show that the proposed algorithm has certain robustness in resisting geometric attacks. Wang et al.  adopted the polar complex exponential transform (PCET) to compute the coefficients of the image, combined with logical mapping to randomly select the coefficients used to construct the features, and created the feature image based on these coefficients. Like most methods, they also utilize the XOR operation to combine the logo image and the feature image to get a zero-watermark. The attacks test demonstrates that it has a certain degree of robustness and ensures the security of the algorithm. Xia et al.  used the quaternion polar harmonic transformation (QPHT) to calculate the image coefficients, and selected more accurate coefficients according to certain rules and constructed a zero-watermark based on these robust coefficients. They describe how the accuracy coefficients are selected, and the presented experimental results also show that the proposed scheme is robust against some attacks. Jiang et al.  proposed a color image zero-watermark algorithm based on tensor mode expansion. The algorithm divides an image into four images of R, G, B component and grayscale, and then combines them into two three-dimensional tensors, and then performs tensor mode expansion on the combined tensor, and finally uses singular value decomposition and DCT processes the expanded data to obtain the feature image of the color image. Aiming at the inaccuracy and inefficiency of the existing calculation methods based on moments, Yang et al.  creatively combined the fast quaternion generic polar complex exponential transformation (FQGPCET) to obtain the image moments. The image moments calculated by this transformation have good stability and distinguishability. The experimental results also show that the moments obtained by the proposed method have certain robustness and have good time complexity. Wang et al.  extended the generalized orthogonal Fourier-Mellin moments (GOFMMs) suitable for grayscale images to the field of color image processing, namely quaternion GOFMMs. They use the polar coordinate pixel stitching method to calculate the GOFMMs, and use all the four-dimensional features of the accurate quaternion GOFMMs of the color image to construct feature information, thereby generating a zero-watermark image. Wang et al.  used PCET to calculate the amplitude of each image, and compared the amplitude of the same position of each image to construct all features, thereby eliminating the correlation between different images and improving the discrimination. The experimental results show that this method achieves certain robustness and makes the constructed zero-watermark have a certain degree of discrimination.
3 Relevant Knowledge
3.1 Quaternion Description of Color Images
The knowledge of quaternion theory was first proposed by Hamilton  in 1843, but it was not applied to specific scenarios. Sangwine  took the lead in applying it to color images and proved the feasibility of quaternion theory in 1996. Similar to a complex number having one real part and one imaginary part, a quaternion contains one real part and three imaginary parts, as shown in Eq. (1).
where, q represents a quaternion, represent real numbers, are imaginary units. Similar to the complex number, the conjugate and magnitude of the quaternion q are and respectively. If , q is a pure quaternion, and if , q is a unit pure quaternion. The relationship between the quaternion imaginary units is similar to the relationship between the complex imaginary units, as shown in Eq. (2).
According to the relationship between imaginary units shown in Eq. (2), it can be known that , that is, the multiplication of quaternion does not follow the commutative law. However, this does not affect the overall description of a color image by a pure quaternion, as shown in Eq. (3).
where, , and are respectively the three-color components of the color image: Red, Green, and Blue. Obviously, the color image processing based on quaternion can reflect the integrity of the color image, and can keep the color information of the color image well, and can really treat the color image as a vector whole.
3.2 Quaternion Generic Fourier Descriptor
Let be an RGB color image in polar coordinates. Since the quaternion multiplication does not satisfy the commutative law, then the quaternion polar Fourier transform (QPFT) of has two forms, that is, the left QPFT and the right QPFT , as show in Eqs. (4) and (5).
where, R represents the radial frequency and T represents angular frequency. , , , . Unit pure quaternion . The QPFT mentioned in this paper refers to the left form.
Since the conjugate of two quaternions and satisfies , the left and right QPFT of the same color image can be derived from each other, as shown in Eq. (6).
Similar to the idea of general Fourier transform , the steps of QPFT are as follows: Firstly, the image in polar space is transformed into a two-dimensional rectangular image in Cartesian space, then the two-dimensional quaternion discrete Fourier transform is applied to it, finally the coefficients of the quaternion polar Fourier transform can be achieved. Quaternion generalized polar Fourier descriptor, as shown in Eq. (7).
The coefficient matrix obtained after QGFD has a certain law, that is, coefficients with high energy values are mainly distributed in the upper left corner of the coefficient matrix. It has a strong energy gathering effect and is particularly suitable for constructing robust features, as shown in Fig. 1. The invariance of the QGFD has been expounded and proved in the paper . The rotation attack on the original image will transform into the translation of the polar coordinate image, and the periodicity shows that QGFD is invariant to rotation. The translation is invariable by moving the origin of coordinates to the centroid, and the zero-order geometric moment is normalized to obtain the scaling invariance of the image by adjusting the size of the image.
4 Proposed Scheme
The proposed scheme aims to protect as many images as possible simultaneously while being efficient and cost-saving. Therefore, assuming that the fixed size of the feature matrix is , select the first f feature of each image as the representation vector, and the maximum number of images that can be protected simultaneously can be obtained as . The proposed scheme consists of a zero-watermark generation part and a verification part. In the zero-watermark generation part, the invariant feature matrix of each color image is firstly calculated by using QGFD, and then the first f features are selected as the representations of each image. Then, the representations of each image are connected end to end to form the principal eigenvector, which is reconstructed into the feature matrix. Then the binary feature image can be obtained by binarization of the feature matrix. Finally, the scrambled QR code image and scrambled feature image are performed XOR operation to generate a zero-watermark image. The zero-watermark verification part is similar to the generation part in feature extraction, but the main difference is that the copyright image (QR code) is obtained by XOR operation between scrambled feature image and zero-watermark image.
4.1 Zero-Watermark Generation
The key to the process of zero-watermark generation is to make full use of the feature information of the image to construct a robust feature matrix, to obtain the zero-watermark image, and save it in the Intellectual Property Protection (IPR) agency. The generation process of zero-watermark is shown in Fig. 2. Detailed steps are described as follows:
Step 1: Set the radial frequency and angular frequency , calculate the invariant features of each image by using QGFD, then the description matrix of each image with the size of can be obtained, and the first f features are selected as the characterization vector of each image;
Step 2: The features of these images are stacked as the main feature vector , which is remodeled into a feature matrix B of size . If it is insufficient, zero is filled to fill the matrix.
Step 3: The mean of the elements in the feature matrix B is calculated, and the feature matrix is binarized according to the mean by Eq. (8). If the value of the elements in the matrix is greater than or equal to the mean , take 1; otherwise, take 0, then the binary feature image F can be obtained.
Step 4: The copyright information provided by the copyright owner is converted into the copyright image C by using QR code technology. The feature image F and the copyright image C are scrambled by Cat map, and the scrambling parameter is used as the for copyright verification, which is saved by the copyright owner.
Step 5: A zero-watermark image W is able to be acquired by performing the XOR manipulation on the scrambled feature image and the copyright image by Eq. (9), which is saved to the trusted third party IPR agency as the basis for copyright verification.
4.2 Zero-Watermark Verification
The key to the zero-watermark verification process is to recover the copyrighted image according to the key provided by the copyright owner, to determine the ownership of multiple images to be verified. The verification process of zero-watermark is shown in Fig. 3. Detailed steps are described as follows:
Step 1: The values of R and T set in the generation stage are used as the basis to calculate the invariant features of each image to be verified by using QGFD. Then the description matrix of each image to be verified with the size of can be obtained, and the first f features are selected as the characterization vector of each image;
Step 2: The features of these images are stacked as the principal eigenvector , which is remodeled into a feature matrix of size . If it is insufficient, zero is filled to fill the matrix.
Step 3: The mean of the elements in the feature matrix is calculated, and the feature matrix is binarized according to the mean by Eq. (10). If the value of the elements in the matrix is greater than or equal to the mean , take 1; otherwise, take 0, then the binary feature image can be obtained.
Step 4: According to the provided by the copyright owner, the feature image obtained is scrambled by Cat map, and the XOR operation is performed on the zero-watermark image W saved by IPR and the scrambled feature image , then the disordered image can be obtained by Eq. (11).
Step 5: Then Cat map is used to reverse scramble the disordered image , and the meaningful copyright image can be recovered. Then compare the similarity between the recovered copyright image and the copyright image C saved by the copyright owner. If the ratio is greater than or equal to the set threshold, the copyright verification is successful; otherwise, it fails.
5 Experiments and Results
In this section, we conduct an attack test on the proposed scheme, and demonstrate the robustness of the scheme, and analyze the experimental results. We also determine the optimal parameters, and compare our scheme with other excellent schemes, and finally analyze the security proposed scheme. The color fundus images in the ODIR-5K data set  are chosen as the experimental images, and six of the images in the data set are shown in Fig. 4. In the experiment, we set the fixed size of the feature matrix to , and take different values for the number of features f, the radial frequency R, and the angular frequency T. Under the premise of ensuring good robustness, the proposed scheme is sought to protect the maximum number of images simultaneously, thereby reducing the time and storage costs, and improving the efficiency of copyright protection.
5.1 Robust Performance Against Various Attacks
In this paper, we use the normalized correlation (NC)  value to evaluate the robustness of the proposed scheme, and the calculation formula is shown in Eq. (12).
where W and represent the original copyright image and the recovered copyright image respectively. To find the optimal parameters, we set invariants and variations, and assign different values to f, R, and T. To test and demonstrate the robustness of the proposed scheme against various attacks, we select attacks such as noise, JPEG compression, and mosaic as common attacks. The parameter of Gaussian noise is the mean, and the variance is set to the default value of 0.01 in the experiment. Geometric attacks include such as rotation, scaling, translation, and mirroring. Several attacks from common attacks and geometric attacks are randomly selected to form a joint attack.
(1) Set f = 8, that is, the value of f remains unchanged, adjust the values of R and T, and test the robustness of the algorithm.
The experimental results show that the proposed algorithm can deal with most of the attacks in common, geometric, and joint attacks, and has good robustness, as shown in Tabs. 1 and 2. When dealing with image compression attacks and joint attacks (bold content), the algorithm's robustness against these two attacks also increases as the values of R and T increase. When , the robustness of the algorithm has achieved good results, as shown in Fig. 5. As the cropping ratio increases, the robustness of the proposed algorithm shows a downward trend, but it still maintains good robustness, as shown in Tab. 2.
(2) Set = 50 and = 60, adjust the value of and test the robustness of the algorithm.
Experimental results show that the algorithm can still resist most attacks by giving different values of f, as shown in Tabs. 3 and 4. However, when dealing with image compression, mosaic and joint attack (bold content) attacks, the robustness of the algorithm is not ideal. Especially when f is less than 13, the algorithm performance is average. However, as the value of f increases, the ability of the algorithm to deal with the above attacks is also enhanced, as shown in Fig. 6.
(3) Set f, R, and T all increase simultaneously to test the robustness of the algorithm.
From the experimental results in Tabs. 5 and 6, it can be clearly seen that the proposed algorithm can resist most attacks and has good robustness. We also find that when the values of f, R, and T are small, the robustness of the algorithm against JPEG attacks and joint attacks (bold content) is not ideal. However, as the values increase, the robustness also improves, and the best results are achieved when f = 12, R = 87, and T = 97, as shown in Fig. 7.
In summary, when , the proposed algorithm can simultaneously protect 512 images; when , the proposed algorithm can simultaneously protect 315 images; when , the proposed algorithm can simultaneously protect 341 images. Although the algorithm using the first group of parameters can simultaneously protect more images, the zero-watermark algorithm pays more attention to robustness, and the algorithm using the third group of parameters is more robust than the first group. Therefore, the optimal parameter of the proposed algorithm should be the third group. According to the results of the attack test, we set 0.9 as the threshold for the copyright verification of the color fundus image.
5.2 Comparison of Robustness and Running Time
Based on the optimal parameters obtained from the analysis of experimental results in Section 5.1, we compare the robustness and running time with three excellent zero-watermark schemes: Scheme I (), Scheme II (), and Scheme III (). The NC values and running time of the three schemes are obtained by averaging 341 images, the comparison results are shown in Tab. 7 and Fig. 8. It can be seen from the comparison results that the proposed scheme has stronger robustness in dealing with most attacks, especially in dealing with attacks such as image compression, rotation, and joint attacks. However, the robustness of the proposed scheme is weak when resisting a large-scale cropping attack, but it still has a good effect. It can be seen from Tab. 7 that compared with the three schemes, the execution time of the proposed scheme for each image is shorter. The main reason for the longer execution time of the other three schemes is that the computational amount will increase sharply when copyright protection is performed on larger-size images. In summary, compared with the other three excellent zero-watermark schemes, the proposed scheme has better robustness in dealing with various attacks and has higher operating efficiency in large-size image processing.
5.3 Algorithm Security Analysis
The security of the zero-watermark algorithm is as important as its robustness. If there is no scrambling encryption for the copyright or feature images, malicious attackers will likely reproduce a similar algorithm to generate specific feature images. The copyright image is obtained by performing the XOR operation on the generated feature image and the stolen zero-watermark image, thereby destroying the fairness of copyright verification and causing losses to the true copyright owner. Therefore, Cat map is used to scramble and reverse scramble the feature image and the copyright image, and the scrambling parameter is used as the key to be saved by the copyright owner. Even if the malicious attackers use the similar zero-watermark algorithm, the copyright image obtained is still a scrambled image, so it is impossible to pass the NC value verification. Only when the key is used for anti-scrambling can the copyright owner of the image be confirmed. Therefore, the security of the zero-watermark algorithm can be enhanced to some extent by using the Cat map.
Although existing zero-watermark algorithms can protect a single grayscale medical image, most algorithms will bring high time and storage costs when protecting a large number of images due to repetitive operation. Therefore, this paper proposes an efficient zero-watermark scheme for multiple color medical images based on QGFD and QR code. This method firstly uses QGFD to calculate the robust features of each image, and then select the representative features of each image from these robust features to form a feature matrix, and then binarize the feature matrix to obtain the feature image. Finally, the XOR operation combines the encrypted copyright image with the encrypted feature image to get a zero-watermark image. In the experiment, we divided the experiment into three aspects, namely, f is unchanged, R and T are assigned different values; R and T are unchanged, f is assigned different values; f, R, and T are all assigned different values. The optimal parameters are sought to make the algorithm have better robustness and can protect more images. The experimental results show that the proposed scheme has achieved good robustness in dealing with various attacks, and the optimal parameters have been determined according to the results. Comparative experiments show that the proposed scheme not only has stronger robustness and higher execution efficiency but also can greatly and effectively reduce the time and storage cost of medical image copyright protection. The future work is to improve the execution efficiency of the algorithm further and improve the algorithm's robustness against large-scale cropping attacks.
Funding Statement: This work is supported by the National Natural Science Foundation of China [Grant Numbers 61972207, U1836208, U1836110, 61672290]; the Major Program of the National Social Science Fund of China [Grant Number 17ZDA092], by the National Key R&D Program of China [Grant Number 2018YFB1003205]; by the Collaborative Innovation Center of Atmospheric Environment and Equipment Technology (CICAEET) fund, China; by the Priority Academic Program Development of Jiangsu Higher Education Institutions (PAPD) fund.
Conflicts of Interest: The authors declare that they have no conflicts of interest to report regarding the present study.
|This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.|