On the performance of multiplicative spread spectrum watermarking

Abstract

The performance of multiplicative spread spectrum watermarking algorithms are investigated under the simplifying assumption that host features are normally distributed, and attacks take the form of normally distributed additive noise. By relying on the obtained results, multiplicative spread spectrum watermarking is compared to its additive counterpart and to quantization based schemes.