Skip to main content

Effectiveness of ST-DM Watermarking Against Intra-video Collusion

  • Conference paper
Digital Watermarking (IWDW 2005)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 3710))

Included in the following conference series:

Abstract

The impact of intra-video collusion on ST-DM watermarking is considered by analyzing the robustness of a constant watermark with respect to Temporal Frame Averaging (TFA). We theoretically show that, as opposed to spread spectrum watermarking, in the ST-DM case it is not sufficient that the same watermark message is inserted within each video frame to ensure resistance against TFA. However robustness can still be achieved by increasing the spreading factor r. Moreover the higher the correlation between video frames the better the performance of ST-DM. We also evaluate the impact of the dithering factor d upon watermark robustness. As a last contribution, we evaluate the impact of TFA on the quality of the attacked video, demonstrating that, unless motion compensated averaging is used, only a few frames can be averaged without introducing annoying artifacts.

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. Doerr, G., Dugeley, J.: Security pitfalls of frame-by-frame approaches to video watermarking. IEEE Trans. on Signal Processing 52, 2955–2964 (2004)

    Article  Google Scholar 

  2. Su, K., Kundur, D., Hatzinakos, D.: Statistical invisibility for collusion-resistant digital video watermarking. IEEE Trans. on Multimedia 7, 43–51 (2005)

    Article  Google Scholar 

  3. Su, K., Kundur, D., Hatzinakos, D.: Spatially localized image-dependent watermarking for statistical invisibility and collusion resistance. IEEE Trans. on Multimedia 7, 52–56 (2005)

    Article  Google Scholar 

  4. Chen, B., Wornell, G.: Quantization index modulation: a class of provably good methods for digital watermarking and information embedding. IEEE Trans. on Information Theory 47, 1423–1443 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Perez-Gonzalez, F., Balado, F., Hernandez, 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)

    Article  Google Scholar 

  6. Breiman, L.: Probability. SIAM, Philadelphia (1992)

    MATH  Google Scholar 

  7. Bartolini, F., Barni, M., Piva, A.: Performance analysis of ST-DM watermarking in presence of non-additive attacks. IEEE Trans. on Signal Processing 52, 2965–2974 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caldelli, R., Piva, A., Barni, M., Carboni, A. (2005). Effectiveness of ST-DM Watermarking Against Intra-video Collusion. In: Barni, M., Cox, I., Kalker, T., Kim, HJ. (eds) Digital Watermarking. IWDW 2005. Lecture Notes in Computer Science, vol 3710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11551492_13

Download citation

  • DOI: https://doi.org/10.1007/11551492_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28768-1

  • Online ISBN: 978-3-540-32052-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics