IWDW 2005: Digital Watermarking pp 336-350 | Cite as

New Geometric Analysis of Spread-Spectrum Data Hiding with Repetition Coding, with Implications for Side-Informed Schemes

  • Félix Balado
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3710)

Abstract

In this paper we initially provide a new geometric interpretation of additive and multiplicative spread-spectrum (SS) watermarking with repetition coding and ML decoding. The interpretation gives an intuitive rationale on why the multiplicative scheme performs better in front of additive independent attacks, and it is also used to produce a novel quantitative performance analysis. Furthermore, the geometric considerations which explain the advantages of multiplicative SS with repetition afford the proposal of a novel side-informed STDM-like method, which we name Sphere-hardening Dither Modulation (SHDM). This method is the side-informed counterpart of multiplicative SS with repetition coding, in the same sense that STDM is the side-informed counterpart of additive SS with repetition coding.

Keywords

Geometric Analysis Decision Boundary Decision Region Host Signal Repetition Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chen, B., Wornell, G.W.: Quantization index modulation: A class of provably good methods for digital watermarking and information embedding. IEEE Trans. on Information Theory 47, 1423–1443 (2001)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Barni, M., Bartolini, F., Rosa, A.D.: Advantages and drawbacks of multiplicative spread spectrum watermarking. In: Procs. of the SPIE, San José, USA. Security and Watermarking of Multimedia Contents V, vol. 5020, pp. 290–299 (2003)Google Scholar
  3. 3.
    Barni, M., Bartolini, F.: Watermarking Systems Engineering. Enabling Digital Assets Security and Other Applications. Signal Processing and Communications Series. Marcel Dekker, New York (2004)Google Scholar
  4. 4.
    Barni, M., Bartolini, F., Rosa, A.D., Piva, A.: Optimum decoding and detection of multiplicative watermarks. IEEE Trans. on Signal Processing 51, 1118–1123 (2003)CrossRefGoogle Scholar
  5. 5.
    Balado, F.: Digital Image Data Hiding Using Side Information. PhD thesis, University of Vigo (2003)Google Scholar
  6. 6.
    Hamkins, J., Zeger, K.: Gaussian source coding with spherical codes. IEEE Trans. on Information Theory 48, 2980–2989 (2002)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Conway, J., Sloane, N.: Sphere Packings, Lattices and Groups, 3rd edn. Comprehensive Studies in Mathematics, vol. 290. Springer, Heidelberg (1999)MATHGoogle Scholar
  8. 8.
    Hamkins, J., Zeger, K.: Asymptotically dense spherical codes part I: Wrapped spherical codes. IEEE Trans. on Information Theory 43, 1774–1785 (1997)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Abramowitz, M., Stegun, I.: Handbook of Mathematical Functions. Dover (1974)Google Scholar
  10. 10.
    Pérez-González, F., Balado, F., Hernández, J.R.: Performance analysis of existing and new methods for data hiding with known-host information in additive channels. IEEE Trans. on Signal Processing 51, 960–980 (2003); Special Issue Signal Processing for Data Hiding in Digital Media & Secure Content DeliveryCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Félix Balado
    • 1
  1. 1.University College DublinDublin 4Ireland

Personalised recommendations