网络与信息安全学报 ›› 2023, Vol. 9 ›› Issue (3): 38-48.doi: 10.11959/j.issn.2096-109x.2023036

• 学术论文 • 上一篇    下一篇

基于块邻域的图像双脆弱水印算法

王艺龙, 李震宇, 巩道福, 刘粉林   

  1. 信息工程大学,河南 郑州 450001
  • 修回日期:2022-06-20 出版日期:2023-06-25 发布日期:2023-06-01
  • 作者简介:王艺龙(1991- ),男,河南郑州人,信息工程大学博士生,主要研究方向为信息安全和信息隐藏
    李震宇(1989- ),男,河南洛阳人,信息工程大学讲师,主要研究方向为多媒体安全和3D信息隐藏
    巩道福(1984- ),男,山东淄博人,信息工程大学副教授,主要研究方向为信息安全、信息隐藏
    刘粉林(1964- ),男,江苏溧阳人,信息工程大学教授、博士生导师,主要研究方向为数字图像取证和信息隐藏
  • 基金资助:
    国家自然科学基金(62002387);国家自然科学基金(61872448);国家自然科学基金(U1736214);国家自然科学基金(61772549)

Image double fragile watermarking algorithm based on block neighborhood

Yilong WANG, Zhenyu LI, Daofu GONG, Fenlin LIU   

  1. Information Engineering University, Zhengzhou 450001, China
  • Revised:2022-06-20 Online:2023-06-25 Published:2023-06-01
  • Supported by:
    TheNational Natural Science Foundation of China(62002387);TheNational Natural Science Foundation of China(61872448);TheNational Natural Science Foundation of China(U1736214);TheNational Natural Science Foundation of China(61772549)

摘要:

针对自嵌入水印技术固定偏移映射带来的安全隐患和单水印机制可恢复率受限的问题,提出了一种基于块邻域的图像双脆弱水印算法。将图像划分为不重叠的4×4图像块,并运用块截断编码生成基于块内容的恢复水印;对任一图像块,设置适当大小的块邻域,并在其邻域外和邻域内随机选择两个图像块作为映射块;同时将恢复水印分别嵌入对应的两个映射块中。算法的图像块邻域设置机制可确保图像块与其对应映射块保持一定的距离;图像块邻域内外映射块选取机制使两个映射块之间保持一定的距离,保证了水印的安全性。理论分析了在连续区域篡改情形下,篡改区域与图像块邻域之间的关系,分析表明存在合适的图像块邻域,使被篡改区域的平均恢复率优于随机映射嵌入算法。利用数值计算给出了篡改区域平均恢复率和篡改区域各图像块恢复率的分布趋势,趋势表明:当篡改参数固定时,图像块邻域与篡改区域相交面积越大,其篡改区域的平均恢复率越高;而当篡改参数与邻域参数满足:t≤(r-1)/2时,篡改区域图像块可 100%恢复;(r-1)/2<t≤r时,篡改区域中心的部分图像块可 100%恢复;t>r时,篡改区域图像块恢复率有所降低。实验结果验证了理论分析的合理性和有效性;与基于随机映射的双水印嵌入算法相比,在连续区域篡改情形下,邻域参数较大时,篡改区域的平均恢复率高于随机映射嵌入算法。

关键词: 图像水印, 自嵌入水印, 双水印, 邻域映射

Abstract:

To address the security risks associated with fixed offset mapping in self-embedded watermarking technology, as well as the limited recovery rate of single watermarking methods, an image double fragile watermarking algorithm based on block neighborhood was proposed.The image was divided into non-overlapping blocks of size 4×4 and block truncation coding was used to generate the recovery watermark based on the image block.For each image block, a neighborhood of a proper size was specified and two mapping blocks were randomly selected from the regions within and outside the neighborhood.Then the recovery watermark was embedded into the two mapping blocks simultaneously.The image block neighborhood setting mechanism of the algorithm ensured that the image block maintains a certain distance from its corresponding mapping block.Additionally, the selection mechanism of mapping blocks inside and outside the image block neighborhood ensured a certain distance between the two mapping blocks, thereby guaranteeing the security of the watermark.In the case of continuous region tampering, the relationship between the tampered region and the neighborhood of the image block was analyzed theoretically.The analysis showed that a suitable image block neighborhood can improve the average recovery rate of the tampered area compared with the random mapping embedding algorithm.Besides, the distribution trend of the average recovery rate of the tampered area and the recovery rate of each image block in the tampered area were given by numerical calculation.It was found that the tampered area image block can be recovered 100%, some image blocks in the center of the tampered area can be recovered 100%, and the recovery rate of image blocks in tampered area will be reduced.The experimental results verify the rationality and effectiveness of the theoretical analysis.Moreover, when the neighborhood parameters are large, the proposed algorithm achieves a higher average recovery rate of the tampered region than the random mapping embedding algorithm in the case of continuous region tampering.

Key words: image watermarking, self-embedding watermarking, dual watermarking, neighborhood mapping

中图分类号: 

No Suggested Reading articles found!