{"title":"Image Robust Watermarking Method Based on DWT-SVD Transform and Chaotic Map","authors":"Weishuai Wu, Yujiao Dong, Guangyi Wang","doi":"10.1155/2024/6618382","DOIUrl":null,"url":null,"abstract":"<p>The existing watermarking algorithms make it difficult to balance the invisibility and robustness of the watermark. This paper proposes a robust image watermarking method based on discrete wavelet transform (DWT), singular value decomposition (SVD), and chaotic maps. This method is a semiblind watermarking method. First, a chaotic logistic-tent map is introduced, employing an extensive chaotic parameter domain. This map is amalgamated with Arnold’s transformation to encrypt the watermark image, thereby bolstering the security of the watermark information. Subsequently, the frequency domain is obtained by applying DWT to the carrier image. Embedding watermarks in the frequency domain ensures the invisibility of the watermark, with a preference for a high-frequency subband after the DWT of the carrier image for enhanced watermark robustness. SVD is then applied to both the high-frequency subband of the carrier image after DWT and the encrypted watermark image. The final step involves embedding the singular values of the encrypted watermark image into the carrier image’s singular values, thereby completing the watermark information embedding process. In simulation experiments, an invisibility test was conducted on various carrier images, yielding peak signal-to-noise ratio (PSNR) values consistently exceeding 43, and structural similarity (SSIM) close to 1. Robustness testing against various types of attacks resulted in normalized correlation (NC) values consistently surpassing 0.9, with bit error rate (BER) values approaching 0. In conclusion, the proposed algorithm satisfies imperceptibility requirements while demonstrating formidable robustness.</p>","PeriodicalId":50653,"journal":{"name":"Complexity","volume":"2024 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complexity","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/2024/6618382","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
The existing watermarking algorithms make it difficult to balance the invisibility and robustness of the watermark. This paper proposes a robust image watermarking method based on discrete wavelet transform (DWT), singular value decomposition (SVD), and chaotic maps. This method is a semiblind watermarking method. First, a chaotic logistic-tent map is introduced, employing an extensive chaotic parameter domain. This map is amalgamated with Arnold’s transformation to encrypt the watermark image, thereby bolstering the security of the watermark information. Subsequently, the frequency domain is obtained by applying DWT to the carrier image. Embedding watermarks in the frequency domain ensures the invisibility of the watermark, with a preference for a high-frequency subband after the DWT of the carrier image for enhanced watermark robustness. SVD is then applied to both the high-frequency subband of the carrier image after DWT and the encrypted watermark image. The final step involves embedding the singular values of the encrypted watermark image into the carrier image’s singular values, thereby completing the watermark information embedding process. In simulation experiments, an invisibility test was conducted on various carrier images, yielding peak signal-to-noise ratio (PSNR) values consistently exceeding 43, and structural similarity (SSIM) close to 1. Robustness testing against various types of attacks resulted in normalized correlation (NC) values consistently surpassing 0.9, with bit error rate (BER) values approaching 0. In conclusion, the proposed algorithm satisfies imperceptibility requirements while demonstrating formidable robustness.
期刊介绍:
Complexity is a cross-disciplinary journal focusing on the rapidly expanding science of complex adaptive systems. The purpose of the journal is to advance the science of complexity. Articles may deal with such methodological themes as chaos, genetic algorithms, cellular automata, neural networks, and evolutionary game theory. Papers treating applications in any area of natural science or human endeavor are welcome, and especially encouraged are papers integrating conceptual themes and applications that cross traditional disciplinary boundaries. Complexity is not meant to serve as a forum for speculation and vague analogies between words like “chaos,” “self-organization,” and “emergence” that are often used in completely different ways in science and in daily life.