arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.10272cs.CRcs.MM
收藏

基于邻域映射的图像脆弱水印算法

Image Fragile Watermarking Algorithm Based on Deneighborhood Mapping

Yilong Wang, Zhenyu Li, Daofu Gong, Haoyu Lu, Fenlin Liu

摘要:

针对图像水印中固定偏移量映射所带来的安全风险和随机映射可恢复性有限的问题,提出了一种基于去邻域映射的图像自嵌入脆弱水印算法。首先将图像分成若干个2 × 2的块,根据块的平均值生成认证水印和恢复水印。然后,denighborhood映射被实现为,对于每个图像块,其映射块在其邻域之外被随机选择,其大小由参数指定。最后将认证水印和恢复水印嵌入到图像块本身及其对应的映射块中。理论分析表明,在连续区域篡改的情况下,与基于随机映射的方法相比,该方法能够获得更好的篡改图像块恢复率。实验结果验证了理论分析的合理性和有效性。此外,与现有的基于随机映射、混沌映射和Arnold映射的嵌入算法相比,在连续区域篡改的情况下,该算法实现的篡改区域平均恢复率更高。

英文摘要:

To address the security risk caused by fixed offset mapping and the limited recoverability of random mapping used in image watermarking, we propose an image self-embedding fragile watermarking algorithm based on deneighborhood mapping. First, the image is divided into several 2*2 blocks, and authentication watermark and recovery watermark are generated based on the average value of the image blocks. Then, the denighborhood mapping is implemented as, for each image block, its mapping block is randomly selected outside it's neighborhood whose size is specified by a parameter. Finally, the authentication watermark and the recovery watermark are embedded in the image block itself and its corresponding mapping block. Theoretical analysis indicates that in the case of continuous region tampering, the proposed watermarking method can achieve better the recovery rate of the tampered image block than the method based on the random mapping. The experimental results verify the rationality and effectiveness of the theoretical analysis. Moreover, compared with the existing embedding algorithms based on random mapping, chaos mapping and Arnold mapping, in the case of continuous region tampering, the average recovery rate of the tampered region achieved by the proposed algorithm is higher.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑