Hierarchical watermarking depending on local constraints

Author

Coltman, Christopher D. ; Bors, Adrian G.

Author_Institution

Dept. of Comput. Sci., York Univ., UK

Volume

3

fYear

2001

fDate

6/23/1905 12:00:00 AM

Firstpage

1011

Abstract

We propose a new watermarking technique where the watermark is embedded according to two keys. The first key is used to embed a code bit in a block of pixels. The second is used to generate the whole sequence of code bits The watermark is embedded in spatial domain by adding or subtracting a random digital pattern to the given image signal. The embedding depth level depends on the spectral density distribution of the DCT coefficients and on the JPEG quantization table. The label consists of a set of bits which are embedded locally in a rectangular set of blocks and it is repeated over the entire image. After detecting individual bits, the retrieved label is verified by performing a XOR operation to the watermark code

Keywords

copy protection; copyright; data compression; discrete cosine transforms; image coding; quantisation (signal); security of data; spectral analysis; telecommunication security; transform coding; DCT coefficients; JPEG quantization table; XOR operation; code bits sequence; embedding depth level; hierarchical watermarking; image signal; local constraints; multimedia copyright protection; pixels; random digital pattern; retrieved label; spatial domain; spectral density distribution; watermark code; Computer science; Copyright protection; Discrete cosine transforms; Filtering; Frequency domain analysis; Image coding; Quantization; Robustness; Testing; Watermarking;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Processing, 2001. Proceedings. 2001 International Conference on

Conference_Location

Thessaloniki

Print_ISBN

0-7803-6725-1

Type

conf

DOI

10.1109/ICIP.2001.958297

Filename

958297