On the intractability of inverting geometric distortions in watermarking schemes

Authors:
Maciej Liśkiewicz;Ulrich Wölfel
Affiliations:
Institut für Theoretische Informatik, Universität zu Lübeck, Germany;Institut für Theoretische Informatik, Universität zu Lübeck, Germany
Venue:
IH'05 Proceedings of the 7th international conference on Information Hiding
Year:
2005

Citing 5
Cited 1

Digital watermarking

Digital watermarking
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Elastic image matching is NP-complete

Pattern Recognition Letters
Attacks on Copyright Marking Systems

Proceedings of the Second International Workshop on Information Hiding
A Monotonic and Continuous Two-Dimensional Warping Based on Dynamic Programming

ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 1 - Volume 1

On the complexity of affine image matching

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

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.