Robust lossless image watermarking

based on -trimmed mean algorithm

and support vector machine
H.-H. Tsai, H.-C. Tseng and Y.-S. Lai

Main Topics

A robust lossless watermarking

technique
A zero-watermarking Method
SVM is trained to memorize relationship
between the watermark and the imagedependent watermark
The robustness enhancement using
-trimmed and SVM
2

W
signature
(Watermark)

X
Main Image

Image-dependent

Memoriz
ed
pattern

Memorize

Received ImageImage-dependent

W
Extracted
watermark
3

Lossless robust:
1.

2.

It Losslessly recover in the absence of

attacks.
It is Robust against attacks.
Robust

Lossless Robust
Attacks

Attacks and Tampers

Robust until
watermark is
detectable

Robust until a
threshold (fragile for
more attacks)

Lossy / lossless

lossless

Question:

?
Lossless Robust ~ Semi-fragile

Zero-watermark

Wen Quan, Digital watermarking technologybased zero-watermark , september, 2001.

Zero-watermark maps the watermark

image to the private key using
image's specific characteristics, but
does not make any revision to the
main image.
6

Lossless Methods
categories:
Reversible watermarking

1.

Image authentication (fragile)

Host image can be recovered
completely

Zero-watermarking

2.

Copyright protection (robust) (?)

the watermark is not embedded into
the host image
7

Zero-watermarking
considerations:

Verification code should receive

correctly.
An individual key should be sent
for any images.
Every one can selects some
features of the image for his own
watermark.
(Copyright protection?)
8

10

4 8

16

32

64

11

12

13

14

Feature Selection

scramble

XLK
Main Image

LK
Image-dependent
15

(?)

Binary vector expansion

16

PRN
G

17

training pattern collection

(TPC)

Seed is used
for block
selection.

18

v=3 3x3
v=4 4x4

9
16

possible: N=
possible: N=
19

Classification

Example: AND

0
0
0
1

0
1
0
1

0
0
1
1

20

Support Vector Machine

(SVM)

Linear separable

21

Support Vector Machine

(SVM)

Non-Linear separable

kernel function

X
22

SVM

the
trained
SVM
possesses
acceptable generalization ability to
correctly estimate the watermark
bits even some error bits existing in
the input vectors.

23

SVM

24

Extraction

25

26

Results

Bit correct
rate:

The average
BCR indicates
the average
of six BCR
values for six
images.

27

28

Attacks

29

30

Description

Zero watermark
Methods

Spatial domain feature selection

SVM

SVMLIW (Tsai 2007)

visual cryptography
wavelet domain.

Shieh et al. (2005)

wavelet domain
LL compares with average
coefficients
XOR
trained neural network (TNN)
spatial domain

Chen et al. (2005)

edge information
spatial domain

Sang and Alam

(2005)
Chang and Lin
(2008)

31

32

33

34

TBCR
compares the test input vector of

test pattern with the training input vector

of training pattern .
Error bit rate of is in [0, 12.5] percent, for
the six test images.
The highest error bit rate reaches 12.5% for
Baboon because of its more complex
features which reduce the performance of
a-trimmed mean operator.
35

36

37