基于提升小波变换和Hessenberg分解的强鲁棒性水印算法

IF 0.8 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Fan Li, Lin Gao, Junfeng Wang, Ruixia Yan
{"title":"基于提升小波变换和Hessenberg分解的强鲁棒性水印算法","authors":"Fan Li, Lin Gao, Junfeng Wang, Ruixia Yan","doi":"10.4018/ijwsr.314948","DOIUrl":null,"url":null,"abstract":"Watermark imperceptibility and robustness in the present watermarking algorithm based on discrete wavelet transform (DWT) could be weakened due to data truncation. To solve this problem, a strong robustness watermarking algorithm based on the lifting wavelet transform is proposed. First, the color channels of the original image are separated, and the selected channels are processed through lifting wavelet transform to obtain low-frequency information. The information is then split into blocks, with Hesseneberg decomposition performed on each block. Arnold algorithm is used to scramble the watermark image, and the scrambled watermark is transformed into a binary sequence that is then embedded into the maximum element of Hessenberg decomposed matrix by quantization modulation. The experimental results exhibit a good robustness of this new algorithm in defending against a wide variety of conventional attacks.","PeriodicalId":54936,"journal":{"name":"International Journal of Web Services Research","volume":" ","pages":""},"PeriodicalIF":0.8000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Strong Robustness Watermarking Algorithm Based on Lifting Wavelet Transform and Hessenberg Decomposition\",\"authors\":\"Fan Li, Lin Gao, Junfeng Wang, Ruixia Yan\",\"doi\":\"10.4018/ijwsr.314948\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Watermark imperceptibility and robustness in the present watermarking algorithm based on discrete wavelet transform (DWT) could be weakened due to data truncation. To solve this problem, a strong robustness watermarking algorithm based on the lifting wavelet transform is proposed. First, the color channels of the original image are separated, and the selected channels are processed through lifting wavelet transform to obtain low-frequency information. The information is then split into blocks, with Hesseneberg decomposition performed on each block. Arnold algorithm is used to scramble the watermark image, and the scrambled watermark is transformed into a binary sequence that is then embedded into the maximum element of Hessenberg decomposed matrix by quantization modulation. The experimental results exhibit a good robustness of this new algorithm in defending against a wide variety of conventional attacks.\",\"PeriodicalId\":54936,\"journal\":{\"name\":\"International Journal of Web Services Research\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Web Services Research\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.4018/ijwsr.314948\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Web Services Research","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.4018/ijwsr.314948","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

基于离散小波变换(DWT)的水印算法中,由于数据的截断,会削弱水印的不可见性和鲁棒性。针对这一问题,提出了一种基于提升小波变换的强鲁棒性水印算法。首先,对原始图像的颜色通道进行分离,并通过提升小波变换对所选通道进行处理,获得低频信息。然后将信息拆分为多个块,并对每个块执行Hessenberg分解。使用Arnold算法对水印图像进行加扰,并将加扰后的水印转换为二进制序列,然后通过量化调制将其嵌入到Hessenberg分解矩阵的最大元素中。实验结果表明,该新算法在抵御各种常规攻击方面具有良好的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Strong Robustness Watermarking Algorithm Based on Lifting Wavelet Transform and Hessenberg Decomposition
Watermark imperceptibility and robustness in the present watermarking algorithm based on discrete wavelet transform (DWT) could be weakened due to data truncation. To solve this problem, a strong robustness watermarking algorithm based on the lifting wavelet transform is proposed. First, the color channels of the original image are separated, and the selected channels are processed through lifting wavelet transform to obtain low-frequency information. The information is then split into blocks, with Hesseneberg decomposition performed on each block. Arnold algorithm is used to scramble the watermark image, and the scrambled watermark is transformed into a binary sequence that is then embedded into the maximum element of Hessenberg decomposed matrix by quantization modulation. The experimental results exhibit a good robustness of this new algorithm in defending against a wide variety of conventional attacks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Web Services Research
International Journal of Web Services Research 工程技术-计算机:软件工程
CiteScore
2.40
自引率
0.00%
发文量
19
审稿时长
>12 weeks
期刊介绍: The International Journal of Web Services Research (IJWSR) is the first refereed, international publication featuring the latest research findings and industry solutions involving all aspects of Web services technology. This journal covers advancements, standards, and practices of Web services, as well as identifies emerging research topics and defines the future of Web services on grid computing, multimedia, and communication. IJWSR provides an open, formal publication for high quality articles developed by theoreticians, educators, developers, researchers, and practitioners for those desiring to stay abreast of challenges in Web services technology.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信