Watermarking on compressed/uncompressed video using communications with side information mechanism
Distributed multimedia databases
Practical Capacity of Digital Watermarks
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Proceedings of the 2004 workshop on Multimedia and security
Recognition in software watermarking
Proceedings of the 4th ACM international workshop on Contents protection and security
Fidelity-guaranteed robustness enhancement of blind-detection watermarking schemes
Information Sciences: an International Journal
A model for the assessment of watermark quality with regard to fidelity
Journal of Visual Communication and Image Representation
Approach to hide secret speech information in G.721 scheme
ICIC'07 Proceedings of the intelligent computing 3rd international conference on Advanced intelligent computing theories and applications
Transactions on data hiding and multimedia security III
Rights protection of trajectory datasets with nearest-neighbor preservation
The VLDB Journal — The International Journal on Very Large Data Bases
Oracle attacks and covert channels
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
G.711-Based adaptive speech information hiding approach
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
| Hi-index | 0.00 |
An information-theoretic analysis of watermarking is presented in this paper. We formulate watermarking as a communication problem with side information at the encoder and decoder and determine the hiding capacity, which upper-bounds the rates of reliable transmission and quantifies the fundamental tradeoff between three quantities: the achievable watermarking rates and the allowed distortion levels for the information hider and the attacker. The hiding capacity is the value of a game between the information hider and the attacker. The optimal attack strategy is the solution of a particular rate-distortion problem, and the optimal hiding strategy is the solution to a channel coding problem. For several important problems, the hiding capacity is the same whether or not the decoder knows the host data set. It is also shown that existing watermarking systems in the literature operate far below capacity.