Skip to main content

On the Intractability of Inverting Geometric Distortions in Watermarking Schemes

  • Conference paper
Book cover Information Hiding (IH 2005)

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

Included in the following conference series:

Abstract

We examine the problem of watermarking schemes robust against geometric distortions from a complexity theoretic point of view. The main results presented are polynomial time reductions showing that the inversion of geometric distortions is computationally intractable.

Supported by DFG research grant RE 675/5-1.

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. Petitcolas, F.A.P., Anderson, R.J., Kuhn, M.G.: Attacks on copyright marking systems. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, pp. 219–239. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Petitcolas, F.A.P.: Watermarking schemes evaluation. IEEE Signal Processing 17, 58–64 (2000)

    Article  Google Scholar 

  3. Cox, I.J., Miller, M.L., Bloom, J.A.: Digital Watermarking. Academic Press, London (2002)

    Google Scholar 

  4. Dugelay, J.L., Petitcolas, F.A.: Possible counterattacks against random geometric distortions. In: Delp, E.J., Wong, P.W. (eds.): Proc. SPIE Security and Watermarking of Multimedia Contents II, vol. 3971, pp. 338–345 (2000)

    Google Scholar 

  5. Lichtenauer, J.F., Setyawan, I., Kalker, T.: Exhaustive geometrical search and the false positive watermark detection probability. In: Delp, E.J., Wong, P.W. (eds.): Proc. SPIE Security and Watermarking of Multimedia Contents V, vol. 5020, pp. 203–214 (2003)

    Google Scholar 

  6. Uchida, S., Sakoe, H.: A monotonic and continuous two-dimensional warping based on dynamic programming. In: ICPR 1998: Proceedings of the 14th International Conference on Pattern Recognition, vol. 1, p. 521. IEEE Computer Society, Los Alamitos (1998)

    Google Scholar 

  7. Keysers, D., Unger, W.: Elastic image matching is NP-complete. Pattern Recogn. Lett. 24, 445–453 (2003)

    Article  MATH  Google Scholar 

  8. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)

    MATH  Google Scholar 

  9. Loo, P., Kingsbury, N.G.: Motion estimation based registration of geometrically distorted images for watermark recovery. In: Delp, E.J., Wong, P.W. (eds.): Proc. SPIE Security and Watermarking of Multimedia Contents III, vol. 4314, pp. 606–617 (2001)

    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

Liśkiewicz, M., Wölfel, U. (2005). On the Intractability of Inverting Geometric Distortions in Watermarking Schemes. In: Barni, M., Herrera-Joancomartí, J., Katzenbeisser, S., Pérez-González, F. (eds) Information Hiding. IH 2005. Lecture Notes in Computer Science, vol 3727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558859_14

Download citation

  • DOI: https://doi.org/10.1007/11558859_14

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31481-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics