Skip to main content

On Achievable Regions of Public Multiple-Access Gaussian Watermarking Systems

  • Conference paper
Information Hiding (IH 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3200))

Included in the following conference series:

Abstract

A public multiple-access digital watermarking system is studied, in which two correlated Gaussian covertexts are watermarked independently and then sent to one authorized receiver via memoryless Gaussian attack channels. Given two distortion level pairs (D 1,D 2) and (D 1,D 2) with respect to the average squared error distortion measure, an achievable region is given in single-letter information quantities. An example is also utilized to illustrate the gain of correlated sources over uncorrelated sources.

This work was supported in part by the Natural Sciences and Engineering Research Council of Canada under Grants RGPIN203035-98 and RGPIN203035-02 and under Collaborative Research and Development Grant, by the Communications and Information Technology Ontario, by the Premier’s Research Excellence Award, by the Canadian Foundation for Innovation, by the Ontario Distinguished Researcher Award, and by the Canada Research Chairs Program.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barron, R.J., Chen, B., Wornell, G.W.: The duality between information embedding and source coding with side information and some applications. IEEE Trans. Inform. Theory 49, 1159–1180 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chen, B., Wornell, G.W.: Quantization index modulation: A class of provably good methods for digital watermarking and information embedding. IEEE Trans. Inform. Theory 47, 1423–1443 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Cohen, S., Lapidoth, A.: The Gaussian Watermarking Game. IEEE Trans. Inform. Theory 48, 1639–1667 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Costa, M.H.M.: Writing on dirty paper. IEEE Trans. Inform. Theory 29, 439–441 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, New York (1991)

    Book  MATH  Google Scholar 

  6. Cox, I., Miller, M., Bloom, J.: Digital Watermarking. Elsevier Science, Morgan Kaufmann Publishers (2001)

    Google Scholar 

  7. Gel’fand, S.I., Pinsker, M.S.: Coding for channel with random parameters. Probl. Contr. Inform. Theory 9(1), 19–31 (1980)

    MATH  MathSciNet  Google Scholar 

  8. Merhav, N.: On Random Coding Error Exponents of Watermarking Systems. IEEE Trans. Inform. Theory 46, 420–430 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Moulin, P., O’Sullivan, J.A.: Information-theoretic analysis of information hiding. IEEE Trans. Inform. Theory 49, 563–593 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Moulin, P., Mihcak, M.K.: The Parallel-Gaussian Watermarking Game. IEEE Trans. Inform. Theory 50, 272–289 (2004)

    Article  MathSciNet  Google Scholar 

  11. Slepian, D., Wolf, J.K.: Noiseless coding of correlated information sources. IEEE Trans. Inform. Theory 19, 471–480 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  12. Somekh-Baruch, A., Merhav, N.: On the Error Exponent and Capacity Games of Private Watermarking Systems. IEEE Trans. Inform. Theory 49, 537–562 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Somekh-Baruch, A., Merhav, N.: On the Capacity Game of Public Watermarking Systems. IEEE Trans. Inform. Theory 50, 511–524 (2004)

    Article  MathSciNet  Google Scholar 

  14. Somekh-Baruch, A., Merhav, N.: On the capacity game of private fingerprinting systems under collusion attacks, available at http://www-ee.technion.ac.il/~merhav/

  15. Su, J.K., Eggers, J.J., Girod, B.: Capacity of Digital Watermarks Subjected to an Optimal Collusion Attack. In: European Signal Processing Conference (EUSIPCO 2000), Tampere, Finland (September 2000)

    Google Scholar 

  16. Sun, W., Yang, E.H.: On the Capacity Regions of Public Multiple-Access Digital Watermarking Systems (in preparation)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sun, W., Yang, Eh. (2004). On Achievable Regions of Public Multiple-Access Gaussian Watermarking Systems. In: Fridrich, J. (eds) Information Hiding. IH 2004. Lecture Notes in Computer Science, vol 3200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30114-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30114-1_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24207-9

  • Online ISBN: 978-3-540-30114-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics