Coefficient selection methods for scalable spread spectrum watermarking

Angela Piper*, Reihaneh Safavi-Naini, Alfred Mertins

*Corresponding author for this work
9 Citations (Scopus)


With the increasing use of mobile and internet technology as a means of content distribution, we see a move towards scalable content distribution mechanisms, which allow the adaptation of content to the requirements of the target system. Adequate protection of scalable content requires the adoption of scalable watermarking algorithms. Many of the existing algorithms are based on the spread spectrum techniques, first presented in a watermarking context by Cox et al. [2]. The various algorithms often use quite different methods for coefficient selection, resulting in different watermark properties. We examine the effect of the coefficient selection method on watermark scalability by considering the quality and resolution scalability of seven simple selection methods when used as part of a spread spectrum watermarking algorithm.

Original languageEnglish
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages (from-to)235-246
Number of pages12
Publication statusPublished - 01.12.2004


Dive into the research topics of 'Coefficient selection methods for scalable spread spectrum watermarking'. Together they form a unique fingerprint.

Cite this