Abstract
The problem examined here is that of tailoring watermarks to survive given communications channels, where the channels are described by procedural simulations. To maximize generality, the embedder is not allowed to know anything about how the simulations work, so they are referred to as “black-box channel models”. The detector is assumed to have no knowledge of either the original cover work or the channel model.
A simple, iterative embedding algorithm is presented that addresses the problem. The algorithm repeatedly applies a black-box channel model to a work, modifying it slightly each time that the watermark does not survive. When the watermark survives 100 times in a row, the algorithm terminates. This algorithm is shown experimentally to produce good results with three different channel models.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Liang, T., Rodriguez, J.J.: Robust watermarking using robust coefficients. Security and Watermarking of Multimedia Contents II SPIE0-3971, 326–335 (2000)
Costa, M.: Writing on dirty paper. IEEE Transactions on Information Theory 29, 439–441 (1983)
Chen, B., Wornell, G.W.: An information-theoretic approach to the design of robust digital watermarking systems. IEEE Transactions on Acoustics, Speech, and Signal Processing (1999)
Chou, J., Pradhan, S.S., Ramchandran, K.: On the duality between distributed source coding and data hiding. In: Thirty-third Asilomar Conference on Signals, Systems, and Computers 2, pp. 1503–1507 (1999)
Ramkumar, M.: Data Hiding in Multimedia: Theory and Applications. PhD thesis, New Jersey Institute of Technology (1999)
Eggers, J.J., Su, J.K., Girod, B.: A blind watermarking scheme based on structured codebooks. IEE Seminar on Secure Images and Image Authentication, 4/1–4/21 (2000)
Miller, M.L., Doërr, G.J., Cox, I.J.: Applying informed coding and embedding to design a robust, high capacity watermark. IEEE Transactions on Image Processing (to appear)
Erez, U., Shamai, S., Zamir, R.: Capacity and lattice-strategies for canceling known interference. In: Proc. of the Cornell Summer Workshop on Information Theory (2000)
Cohen, A.S., Lapidoth, A.: Generalized writing on dirty paper. In: International Symposium on Information Theory (ISIT) (2002)
Corel Stock Photo Library 3. Corel Corporation, Ontario, Canada
Cox, I.J., Miller, M.L., McKellips, A.: Watermarking as communications with side information. Proceedings of the IEEE 87(7), 1127–1141 (1999)
Cox, I.J., Miller, M.L., Bloom, J.A.: Digital Watermarking. Morgan Kaufmann, San Francisco (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miller, M.L. (2004). Watermark Embedding for Black-Box Channels. In: Kalker, T., Cox, I., Ro, Y.M. (eds) Digital Watermarking. IWDW 2003. Lecture Notes in Computer Science, vol 2939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24624-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-24624-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21061-0
Online ISBN: 978-3-540-24624-4
eBook Packages: Springer Book Archive