Professional Documents
Culture Documents
PERCEPTUAL MASKING
M. V. Rama Krishna
ECE Department
IIT Guwahati - 781039
ramakrishna mv1@yahoo.com
D. Ghosh
ECE Department
IIT Guwahati - 781039
ghosh@iitg.ernet.in
ABSTRACT
This paper presents a new oblivious technique for em-
bedding watermark into digital audio signals, which
is based on the patchwork algorithm in the FFT do-
main. The proposed watermarking scheme exploits a
psychoacoustic model of MPEG audio coding to en-
sure that the watermark does not affect the subjective
quality of the original audio. The audio is watermarked
by modifying selected FFT coefcients of an audio
frame under a constraint specied by the psychoacous-
tic model. Experimental results show that our scheme
introduces no audible distortion and is robust against
some common signal processing attacks.
1. INTRODUCTION
The outstanding progress in digital technology has not
only led to easy reproduction and retransmission of
digital data but has also helped unauthorized data ma-
nipulation. Consequently, the necessity arises for copy-
right protection of digital data (audio, image and video)
against unauthorized recording attempts. Recently, there
is a large interest in audio watermarking techniques
that are largely stimulated by the rapid progress in au-
dio compression algorithms and wide use of Internet
for compressed music distribution over the Globe. A
fewof the earliest audio watermarking techniques have
been reported in [1]. They include approaches such as
phase coding, echo coding and spread spectrum tech-
nique. In phase coding technique, watermark is em-
bedded by modifying the phase values of the Fourier
transform coefcients of audio segments. In the other
two approaches, watermark is embedded by modifying
the cepstrum at a known location using multiple de-
caying echoes or spread spectrum noise. Another au-
dio watermarking technique is proposed in [2] where
Fourier transformcoefcients over the middle frequency
bands are replaced with spectral components of the
watermark data. In [3], watermark for an audio is gen-
erated by modifying the least signicant bit of each
sample. Reports in [4, 5] discuss watermarking meth-
ods in audio by exploiting the characteristics of the hu-
man auditory systemso as to guarantee that the embed-
ded watermark is imperceptible. However, the disad-
vantage of these schemes is that the original audio sig-
nal is required in the watermark detection process, i.e.,
the algorithms are non-oblivious. Audio watermark-
ing using patchwork algorithm is developed in [6, 7].
This algorithm is based on statistical methods in the
transform domain, e.g., DCT, FFT, etc. Patchwork al-
gorithm has the advantage that it satises the security
constraint. But, here the watermark is not guaranteed
to be inaudible. Furthermore, robustness is not max-
imized. This is because the amount of modication
made to embed the watermark is estimated and not
necessarily the maximum amount possible.
In this paper, we present an oblivious audio water-
marking algorithm wherein the earlier proposed patch-
work algorithm in the FFT domain [6] is modied by
incorporating the concept of perceptual masking pro-
posed in [4]. Perceptual masking is based on the char-
acteristics of human auditory system and hence, it is
guaranteed that the embedded watermark in our pro-
posed algorithm will be inaudible. As the perceptual
characteristics of individual audio signals vary, the mag-
nitude of modication made to each coefcient adapts
to and is highly dependent on the audio being water-
marked. This is described in the sections to follow.
2. THE PATCHWORK AND MASKING
MODELS
2.1. Patchwork algorithm
The patchwork algorithm articially modies the dif-
ference (patch value) between means of samples in two
randomly chosen subsets called patches. The modi-
cation incorporated depends on the watermark data to
be embedded and is detected with a high probability by
comparing the observed patch value with the expected
one.
The two major steps in the patchwork algorithm
are: (1) Choose two patches A and B pseudo-randomly,
and (2) for watermark bit equal to 1, add a small con-
stant value d to the samples of patch A and subtract the
same value d from the samples of patch B, i.e.,
a
i
= a
i
+d
b
i
= b
i
d (1)
where a
i
, b
i
are sample values of the patches A and B,
respectively, and a
i
, b
i
are the modied samples. The
mean difference of the watermarked patches, hence, is
given as
e =
1
n
n
i=1
(a
i
b
i
) = a
, b
i
= a
i
+|Re(c
i
)|
b
i
= b
i
|Re(d
i
)|
(5)
If w
j
= 0,
i
= a
i
|Re(c
i
)|
b
i
= b
i
+|Re(d
i
)|
(6)
where is the watermark strength parameter.
Step 9. Dene newpatches A and B with a
i
= S
N/2+I
2i1
and b
i
=S
N/2+I
2i
, i=1,...,n. Also, dene C and D as c
i
=
P
N/2+I
2i1
and d
i
=P
N/2+I
2i
, i=1,...,n. Apply watermark
embedding process following the rule given in Step 8.
Step 10. Finally, replace the selected elements a
i
and
b
i
by a
i
and b
i
, respectively, and then apply IFFT. The
output is the watermarked audio frame.
We repeat the above steps to the next frame until
no watermark bits are left for embedding. To have a
safe communication between the embedding and de-
tection of watermarks, the watermark bit code may be
repeatedly and consecutively embedded several times.
Repeated embedding of the same information and de-
tection based on majority voting play error correcting
functionality.
3.2. Watermark detection
Step 1. Map the secret key to the seed of a random
number generator and then generate the index set I
same as that in the embedding process.
Step 2. For a watermarked audio frame, obtain the
subsets A and B from the FFT coefcients and then
compute the means of the two patches as
a
=
1
n
n
i=1
Re(a
i
)
b
=
1
n
n
i=1
Re(b
i
) (7)
Step 3. Calculate the mean difference (patch value) e=
a