Papers
Topics
Authors
Recent
Search
2000 character limit reached

A constructive and unifying framework for zero-bit watermarking

Published 8 Jun 2006 in cs.MM and cs.CR | (0606034v2)

Abstract: In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in content. The watermark detector checks for the presence of this particular weak signal in content. The article looks at this problem from a classical detection theory point of view, but with side information enabled at the embedding side. This means that the watermark signal is a function of the host content. Our study is twofold. The first step is to design the best embedding function for a given detection function, and the best detection function for a given embedding function. This yields two conditions, which are mixed into one fundamental' partial differential equation. It appears that many famous watermarking schemes are indeed solution to thisfundamental' equation. This study thus gives birth to a constructive framework unifying solutions, so far perceived as very different.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.