Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources

From MaRDI portal
Publication:3604451

DOI10.1109/TIT.2007.911210zbMATH Open1304.94075arXiv0705.1919OpenAlexW2252282072MaRDI QIDQ3604451FDOQ3604451

Neri Merhav, Erez Sabbag

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/0705.1919




Recommendations





Cited In (11)





This page was built for publication: Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604451)