Abstract: The histogram digital watermark can resist local or global geometric attacks, and it has strong robustness. And it is a hotspot in digital watermarking. In this paper, a new digital watermarking algorithm based on histogram is proposed, and the watermark information composed of “-1,0, 1” is embedded in two bins of histogram (the histogram is composed of multiple bins). In the watermark embedding process, the following embedding rules should be followed. When the first bin is higher than the second bin, the embedded information is 1. When the difference between two bin is less than or equal to 1, the embedded information is 0. When the first bin is lower than the second bin, the embedded information is -1. The experimental results show that the new algorithm can increase the capacity of watermark information by 60% and had a high robustness.

Key words: histogram, digital watermarking, large capacity, robustness, invisibility

摘要： 直方图数字水印能抵抗局部或全局几何攻击，具有较强鲁棒性，是目前数字水印研究的热点.提出了一种新的基于直方图的数字水印算法，首次利用直方图的2个bin(其中直方图由多个bin组成)嵌入由“-1，0，1”组成的水印信息，提高了嵌入水印的容量.水印嵌入过程中，需遵循以下嵌入规则.当第1个bin高于第2个bin时，嵌入信息为1；2个bin相差小于等于1时，嵌入信息为0；第1个bin低于第2个bin时，嵌入信息为-1.实验结果表明：新算法嵌入水印信息容量增加60%，并具有较高的鲁棒性.

关键词: 直方图, 数字水印, 大容量, 鲁棒性, 不可见性