By Topic

Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Merhav, N. ; Technion - Israel Inst. of Technol., Haifa ; Sabbag, E.

An information-theoretic approach is proposed to watermark embedding and detection under limited detector resources. First, the attack-free scenario is considered under which asymptotically optimal decision regions in the Neyman-Pearson sense are proposed, along with the optimal embedding rule. Later, the case of zero-mean independent and identically distributed (i.i.d.) Gaussian covertext distribution is explored with unknown variance under the attack-free scenario. For this case, a lower bound on the exponential decay rate of the false-negative probability is proposed. It is proven 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.

Published in:

Information Theory, IEEE Transactions on  (Volume:54 ,  Issue: 1 )