Asymptotically optimum embedding strategy for one-bit watermarking under Gaussian attacks

@inproceedings{Alfaro2008AsymptoticallyOE,
  title={Asymptotically optimum embedding strategy for one-bit watermarking under Gaussian attacks},
  author={Pedro Comesa{\~n}a Alfaro and Neri Merhav and Mauro Barni},
  booktitle={Security, Forensics, Steganography, and Watermarking of Multimedia Contents},
  year={2008}
}
The problem of asymptotically optimum watermark detection and embedding has been addressed in a recent paper by Merhav and Sabbag where the optimality criterion corresponds to the maximization of the false negative error exponent for a fixed false positive error exponent. In particular Merhav and Sabbag derive the optimum detection rule under the assumption that the detector relies on the second order statistics of the received signal (universal detection under limited resources), however the… CONTINUE READING
10 Citations
14 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Sabbag, “Optimal watermark embedding and detection strategies under limited detection resources,

  • E. N. Merhav
  • IEEE Transactions on Information Theory
  • 2008

Similar Papers

Loading similar papers…