This work addresses the problem of optimum decoding and detection of a multibit, multiplicative watermark hosted by Weibull-distributed features: a situation which is classically encountered for image watermarking in the magnitude-of-DFT domain. As such, this work can be seen as an extension of the system described in a previous paper, where the same problem is addressed for the case of 1-bit watermarking. The theoretical analysis is validated through Monte Carlo simulations. Although the structure of the optimum decoder/detector is derived in the absence of attacks, some experimental results are also presented, giving a measure of the overall robustness of the watermark when attacks are present.
Optimum Decoding and Detection of Multiplicative Watermarks / M. BARNI; F. BARTOLINI; A. DE ROSA; A. PIVA. - In: IEEE TRANSACTIONS ON SIGNAL PROCESSING. - ISSN 1053-587X. - STAMPA. - 51, no. 4:(2003), pp. 1118-1123. [10.1109/TSP.2003.809371]
Optimum Decoding and Detection of Multiplicative Watermarks
DE ROSA, ALESSIA;PIVA, ALESSANDRO
2003
Abstract
This work addresses the problem of optimum decoding and detection of a multibit, multiplicative watermark hosted by Weibull-distributed features: a situation which is classically encountered for image watermarking in the magnitude-of-DFT domain. As such, this work can be seen as an extension of the system described in a previous paper, where the same problem is addressed for the case of 1-bit watermarking. The theoretical analysis is validated through Monte Carlo simulations. Although the structure of the optimum decoder/detector is derived in the absence of attacks, some experimental results are also presented, giving a measure of the overall robustness of the watermark when attacks are present.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
