Iteratively decodable codes for watermarking applications (2000) [15 citations — 6 self]
Download:
|
|
by Mustafa Kesal, Ralf Koetter, Pierre Moulin
Proc. 2nd Symposium on Turbo Codes and Their Applications
http://www.ifp.uiuc.edu/~moulin/Papers/WMbrest00.ps
Add To MetaCart
Abstract:
The problem of information hiding or watermarking is investigated. Based in an information theoretic analysis of the watermarking task we investigate a strategy to employ binary codes to robustly hide data in a given host signal. The central theme of the problem is the interplay of a vector quantization and a channel coding task. Turbo codes and other coding schemes are compared in terms of their performance in a watermarking application.
Citations
| 438 | Factor graphs and the sum–product algorithm – Kschischang, Frey, et al. |
| 149 | Information-Theoretic Analysis of Information Hiding – Moulin, O’Sullivan - 2003 |
| 22 | The Role of Information Theory in Watermarking and Its Application to Image Watermarking – Moulin - 2001 |
| 6 | The data-hiding capacity of image sources – Moulin, Mihcak - 2001 |
| 4 | An Information- Theoretic Approach to the Design of Robust Digital Watermarking Systems – Chen, Wornell - 1999 |
| 4 | The Parallel-Gaussian Watermarking Game," perprint – Moulin - 2000 |
| 2 | Pinsker,“Coding for Channel with Random – Gelfand, S - 1980 |
| 1 | The Parallel-Gaussian Watermarking Game,” perprint – Moulin - 2000 |
| 1 | The Data-Hiding Capacity of Image Sources,” preprint – Moulin, Mıhçak - 2000 |
