We describe a number of applications of digital watermarking and examine the common properties of robust-ness; tamper resistance, fidelity, computational cost and false positive rate. We observe that these properties vary greatly depending on the application. Consequently, we conclude that evaluation of a watermarking algorithm is difficult without first indicating the context in which it is to be applied.
Citation:
Ingemar J. Cox, Matt L. Miller, Jeffrey A. Bloom, "Watermarking applications and their properties," itcc, pp.6, The International Conference on Information Technology: Coding and Computing (ITCC'00), 2000