ICA for watermarking digital images
The Journal of Machine Learning Research
ICA for watermarking digital images
The Journal of Machine Learning Research
An overview of scalar quantization based data hiding methods
Signal Processing
Circularly orthogonal moments for geometrically robust image watermarking
Pattern Recognition
MIMO transceiver design via majorization theory
Foundations and Trends in Communications and Information Theory
Topics in Multi-User Information Theory
Foundations and Trends in Communications and Information Theory
Channel Coding in the Presence of Side Information
Foundations and Trends in Communications and Information Theory
Multiaccess channels with state known to some encoders and independent messages
EURASIP Journal on Wireless Communications and Networking - Theory and Applications in Multiuser/Multiterminal Communications
Code design for MIMO broadcast channels
IEEE Transactions on Communications
Robust audio data hiding using correlated quantization with histogram-based detector
IEEE Transactions on Multimedia
Bounds and lattice-based transmission strategies for the phase-faded dirty-paper channel
IEEE Transactions on Wireless Communications
Random-coding lower bounds for the error exponent of joint quantization and watermarking systems
IEEE Transactions on Information Theory
Cognitive radio: an information-theoretic perspective
IEEE Transactions on Information Theory
Precoding for the AWGN channel with discrete interference
IEEE Transactions on Information Theory
On the tightness of Marton's regions for semi-additive broadcast channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
IWDW'02 Proceedings of the 1st international conference on Digital watermarking
Informed embedding for multi-bit watermarks
IWDW'02 Proceedings of the 1st international conference on Digital watermarking
Robust and high capacity image watermarking based on jointly coding and embedding optimization
IH'07 Proceedings of the 9th international conference on Information hiding
Lower bounds on the capacity of the relay channel with states at the source
EURASIP Journal on Wireless Communications and Networking
On the robustness of dirty paper coding
IEEE Transactions on Communications
Variations on information embedding in multiple access and broadcast channels
IEEE Transactions on Information Theory
Cooperative relaying with state available noncausally at the relay
IEEE Transactions on Information Theory
Joint source channel coding with side information using hybrid digital analog codes
IEEE Transactions on Information Theory
New hybrid digital/analog schemes for transmission of a Gaussian source over a Gaussian channel
IEEE Transactions on Information Theory
Comparison of Forbidden Zone Data Hiding and Quantization Index Modulation
Digital Signal Processing
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
On achievable regions of public multiple-access gaussian watermarking systems
IH'04 Proceedings of the 6th international conference on Information Hiding
Hi-index | 755.26 |
Watermarking models a copyright protection mechanism where an original source sequence or "covertext" is modified before distribution to the public in order to embed some extra information. The embedding should be transparent (i.e., the modified data sequence or "stegotext" should be similar to the covertext) and robust (i.e., the extra information should be recoverable even if the stegotext is modified further, possibly by a malicious "attacker"). We compute the coding capacity of the watermarking game for a Gaussian covertext and squared-error distortions. Both the public version of the game (covertext known to neither attacker nor decoder) and the private version of the game (covertext unknown to attacker but known to decoder) are treated. While the capacity of the former cannot, of course, exceed the capacity of the latter, we show that the two are, in fact, identical. These capacities depend critically on whether the distortion constraints are required to be met in expectation or with probability one. In the former case, the coding capacity is zero, whereas in the latter it coincides with the value of related zero-sum dynamic mutual information games of complete and perfect information. We also compute the capacity when the attacker is restricted to additive attacks. This capacity turns out to be strictly larger than the watermarking capacity, thus demonstrating that additive attacks are suboptimal. In fact, under the additive attack restriction, capacity turns out to coincide with the capacity of Costa's (1983) model for "writing on dirty paper," thus demonstrating that in Costa's model, the independent and identically distributed (i.i.d.) Gaussian "noise" is the most malevolent power-limited "noise". Additionally, Costa's observation that in the presence of i.i.d. Gaussian "noise," an i.i.d. Gaussian "dirt" process that is noncausally known to the transmitter (but not receiver) does not reduce capacity, is extended to general ergodic "dirt" and to stationary (but not necessarily white) Gaussian "noise"