Abstract
We describe a new binning technic for informed data hiding problem. In information theoretical point of view, the blind watermarking problem can be seen as transmitting a secret message M through a noisy channel on top of an interfered host signal S that is available only at the encoder. We propose an embedding scheme based on Low Density Parity Check(LDPC) codes, in order to quantize the host signal in an intelligent manner so that the decoder can extract the hidden message with a high probability. A mixture of erasure and symmetric error channel is realized for the analysis of the proposed method.
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
Moulin, P., Koetter, R.: Data-Hiding Codes. Proceedings of IEEE 93(12), 2083–2127 (2005)
Cox, I.J., Miller, M.L.: The first 50 years of electronic watermarking. EURASIP JASP 2, 126–132 (2002)
Gel’fand, S., Pinsker, M.: Coding for channel with random parameters. Problems of Control and Information Theory 9, 19–31 (1980)
Costa, M.: Writing on dirty paper. IEEE Trans. on Information Theory 29, 439–441 (1983)
Cox, I.J., Miller, M.L., McKellips, A.L.: Watermarking as communications with side information. Proceedings of the IEEE 87, 1127–1141 (1999)
Chappelier, V., Guillemot, C., Marinkovic, S.: Turbo Trellis Coded Quantization. In: Proc. of the Intl. Symp. on Turbo Codes (September 2003)
Miller, M.L., Dodrr, G.J., Cox, I.J.: Applying informed coding and informed embedding to design a robust, high capacity watermark. IEEE Trans. on Image Processing 3(6), 792–807 (2004)
Eggers, J., Buml, R., Tzschoppe, R., Girod, B.: Scalar costa scheme for information embedding. IEEE Trans. Signal Processing (2002)
Bastug, A., Sankur, B.: Improving the Payload of Watermarking Channels via LDPC Coding. IEEE Signal Proc. Letters 11(2), 90–92 (2004)
Marcellin, M.W., Fisher, T.R.: Trellis-coded quantization of memoryless and gauss-markov sources. IEEE Trans. Comm. 38, 82–93 (1990)
Gallager, R.G.: Low density parity check codes, Ph.D. dissertation. MIT, Cambridge (1963)
Martinian, E., Yedidia, J.S.: Iterative Quantization Using Codes On Graphs. In: Proc. of 41st Annual Allerton Conference on Communications, Control, and Computing (2003)
MacKay, D.J.C., Neal, R.M.: Near Shannon limit performance of low density parity check codes. Electronics Letters 33, 457–458 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dikici, Ç., Idrissi, K., Baskurt, A. (2006). Dirty-Paper Writing Based on LDPC Codes for Data Hiding. In: Gunsel, B., Jain, A.K., Tekalp, A.M., Sankur, B. (eds) Multimedia Content Representation, Classification and Security. MRCS 2006. Lecture Notes in Computer Science, vol 4105. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11848035_17
Download citation
DOI: https://doi.org/10.1007/11848035_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39392-4
Online ISBN: 978-3-540-39393-1
eBook Packages: Computer ScienceComputer Science (R0)