A Combination of DWT and QR Decomposition for Color Image Watermarking

Phuong Thi Nha, Ta Minh Thanh
{"title":"A Combination of DWT and QR Decomposition for Color Image Watermarking","authors":"Phuong Thi Nha, Ta Minh Thanh","doi":"10.1109/KSE53942.2021.9648714","DOIUrl":null,"url":null,"abstract":"For the purpose of protecting copyright of digital images, many published articles indicate that combining DWT with matrix decomposition can improve robustness of watermark. In this paper, a hybrid image watermarking scheme is represented by using a combination of 1-level $DWT$ transform and $QR$ decomposition. The first, Haar transform is applied on the channel B of the host color image and $LL$ sub-band is partitioned in $4 \\times 4$ non-overlapping blocks. After that, $QR$ factorization is executed on each block where $Q$ matrix and $R$ matrix are calculated separately by our proposal. Watermark bits are embedded into the first element of $R$ matrix instead of the whole row as previous published articles to improve the quality of watermarked image. In addition, the original watermark image is permuted by Arnold transform and it helps the proposed method is more secure. In this study, we also perform experiments to select the most suitable sub-band for embedding information. The experimental results show that this combination gives a better invisibility of watermarked image which is compared to the $QR$ decomposition based approach. Furthermore, the proposed algorithm is more effective to against many common attacks.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KSE53942.2021.9648714","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

For the purpose of protecting copyright of digital images, many published articles indicate that combining DWT with matrix decomposition can improve robustness of watermark. In this paper, a hybrid image watermarking scheme is represented by using a combination of 1-level $DWT$ transform and $QR$ decomposition. The first, Haar transform is applied on the channel B of the host color image and $LL$ sub-band is partitioned in $4 \times 4$ non-overlapping blocks. After that, $QR$ factorization is executed on each block where $Q$ matrix and $R$ matrix are calculated separately by our proposal. Watermark bits are embedded into the first element of $R$ matrix instead of the whole row as previous published articles to improve the quality of watermarked image. In addition, the original watermark image is permuted by Arnold transform and it helps the proposed method is more secure. In this study, we also perform experiments to select the most suitable sub-band for embedding information. The experimental results show that this combination gives a better invisibility of watermarked image which is compared to the $QR$ decomposition based approach. Furthermore, the proposed algorithm is more effective to against many common attacks.
基于DWT和QR分解的彩色图像水印
为了保护数字图像的版权,许多已发表的文章表明,将DWT与矩阵分解相结合可以提高水印的鲁棒性。本文提出了一种混合图像水印方案,该方案采用1级DWT变换和QR分解相结合的方法。首先,对主彩色图像的通道B进行Haar变换,并将$LL$子带划分为$4 × 4$不重叠的块。之后,在每个区块上执行$QR$分解,其中$Q$矩阵和$R$矩阵由我们的建议分别计算。水印位嵌入到$R$矩阵的第一个元素中,而不是像以前发表的文章那样嵌入到整行,以提高水印图像的质量。此外,对原始水印图像进行阿诺德变换,提高了算法的安全性。在本研究中,我们还进行了实验,以选择最合适的子带来嵌入信息。实验结果表明,与基于$QR$分解的方法相比,该组合具有更好的水印图像不可见性。此外,该算法对许多常见的攻击更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信