Capacity of the watermark-channel: How many bits can be hidden within a digital image?

被引：55

作者：

Barni, M ^{[1
]}

Bartolini, F ^{[1
]}

De Rosa, A ^{[1
]}

Piva, A ^{[1
]}

机构：

[1] Univ Siena, Dept Informat Engn, I-53100 Siena, Italy

来源：

SECURITY AND WATERMARKING OF MULTIMEDIA CONTENTS | 1999年 / 3657卷

关键词：

digital watermarking; image watermarking; frequency-domain watermarking; watermark capacity; copyright protection; DCT DFT coefficient modeling;

D O I：

10.1117/12.344694

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

An evaluation of the number of bits that can be hidden within an image by means of frequency-domain watermarking is given. Watermarking is assumed to consist in the modification of a set of full-frame DCT (DFT) coefficients. The amount of modification each coefficient undergoes is proportional to the magnitude of the coefficient itself, so that an additive-multiplicative embedding rule results. The watermark-channel is modeled by letting the watermark be the signal and the image coefficients the noise introduced by the channel. To derive the capacity of each coefficient, the input (i.e. the watermark) and the output (i.e. the watermarked coefficients) of the channel are quantized, thus leading to a discrete-input, discrete-output model. Capacity is evaluated by computing the channel transition matrix and by maximizing the mutual input/output information. Though the results we obtained do not take into account attacks, they represent a useful indication about the amount of information that can be hidden within a single image.

引用

页码：437 / 448

页数：4

共 16 条

[1] A DCT-domain system for robust image watermarking [J].