Computer Science – Information Theory
Scientific paper
2007-05-14
Computer Science
Information Theory
36 pages, 5 figures. Revised version. Submitted to IEEE Transactions on Information Theory
Scientific paper
An information-theoretic approach is proposed to watermark embedding and detection under limited detector resources. First, we consider the attack-free scenario under which asymptotically optimal decision regions in the Neyman-Pearson sense are proposed, along with the optimal embedding rule. Later, we explore the case of zero-mean i.i.d. Gaussian covertext distribution with unknown variance under the attack-free scenario. For this case, we propose a lower bound on the exponential decay rate of the false-negative probability and prove that the optimal embedding and detecting strategy is superior to the customary linear, additive embedding strategy in the exponential sense. Finally, these results are extended to the case of memoryless attacks and general worst case attacks. Optimal decision regions and embedding rules are offered, and the worst attack channel is identified.
Merhav Neri
Sabbag Erez
No associations
LandOfFree
Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-365740