Abstract
The field of healthcare is considered to be the most promising application of intelligent sensor networks. However, the security and privacy protection of medical images collected by intelligent sensor networks is a hot problem that has attracted more and more attention. Fortunately, digital watermarking provides an effective method to solve this problem. In order to improve the robustness of the medical image watermarking scheme, in this paper, we propose a novel zero-watermarking algorithm with the integer wavelet transform (IWT), Schur decomposition and image block energy. Specifically, we first use IWT to extract low-frequency information and divide them into non-overlapping blocks, then we decompose the sub-blocks by Schur decomposition. After that, the feature matrix is constructed according to the relationship between the image block energy and the whole image energy. At the same time, we encrypt watermarking with the logistic chaotic position scrambling. Finally, the zero-watermarking is obtained by XOR operation with the encrypted watermarking. Three indexes of peak signal-to-noise ratio, normalization coefficient (NC) and the bit error rate (BER) are used to evaluate the robustness of the algorithm. According to the experimental results, most of the NC values are around 0.9 under various attacks, while the BER values are very close to 0. These experimental results show that the proposed algorithm is more robust than the existing zero-watermarking methods, which indicates it is more suitable for medical image privacy and security protection.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.