本文证明了在一个m×n的二值图像块中至多改变1个像素时所能隐藏的比特数的上界为[(log_2(mn+1)],并实际构造了达到此上界的信息隐藏算法.文中归纳了一些选择修改像素位置的规则,较好地保持了数据嵌入后图像的质量.对算法的鲁棒性和安全性进行了分析.用3个例子一数字手写签名中认证信息的嵌入、二值电子文档的窜改检测和卡通图像中注释信息的嵌入说明了本文算法可能的应用.%This paper proposes a method to embed data in binary images with high embedding capacity. It is proved that,given an m × n image block of the host image, the upper bound of the amount of bits that can be embedded in that block is L[(log_2(mn + 1)] ]by changing at most 1 pixel in the block. An algorithm whose embedding capacity can reach the bound is then constructed. We also summarize some rules for selecting pixels to be changed in order to maintain higher quality of the host image after data hiding. The robustness and security of the proposed algorithm is analyzed. Three examples,data hiding in digital handwritten signature, temper detection of digital binary documents, and invisible annotation for cartoon image are tested to illustrate the potential applications.
展开▼
