Error exponents for one-bit watermarking
نویسندگان
چکیده
Quantization index modulation (QIM) is a powerful hostinterference rejecting method for data hiding. This paper applies QIM to one-bit watermarking and proposes a simple but powerful watermark detector. We derive lower bounds on the error exponents for the detector under a quadratic distortion constraint for the watermarker and additive white Gaussian noise attacks. These bounds are independent of the host-signal distribution and are substantially better than recently derived bounds for public (blind) spread-spectrum watermarking.
منابع مشابه
On achievable error exponents for watermarking
Probability-of-error exponents have recently been derived for watermarking systems based on spread-spectrum and quantization-index modulation methods. This paper takes this work one step further and presents minmax error exponents for any embedding scheme and any attack (subject to distortion constraints) at all rates below capacity. The decoders used are universal: they do not know the attack ...
متن کاملOptimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling
This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...
متن کاملComparative performance of watermarking schemes using M-ary modulation with binary schemes employing error correction coding
A common application of digital watermarking is to encode a small packet of information in an image, such as some form of identification that can be represented as a bit string. One class of digital watermarking techniques employs spread spectrum like methods where each bit is redundantly encoded throughout the image in order to mitigate bit errors. We typically require that all bits be recover...
متن کاملPerformance Analysis of Scalar DC-QIM for One-Bit Watermarking
Quantization-based schemes, such as scalar DC-QIM, have demonstrated performance merits for data-hiding problem, which is mainly a transmission problem. However, a number of applications are stated in terms of watermark detection problem (also named one-bit watermarking), and this situation has been seldom addressed in the literature for quantization-based techniques. In this context, we carry ...
متن کاملAsymptotically optimum embedding strategy for one-bit watermarking under Gaussian attacks
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 secon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003