96

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 15, NO. 1, JANUARY 2005

Transactions Letters________________________________________________________________
Image Adaptive Watermarking Using Wavelet Domain Singular Value
Decomposition
Paul Bao and Xiaohu Ma

AbstractIn this letter, we propose a novel, yet simple,

image-adaptive watermarking scheme for image authentication
by applying a simple quantization-index-modulation process
on wavelet domain singular value decomposition. Unlike the
traditional wavelet-based watermarking schemes where the watermark bits are embedded directly on the wavelet coefficients,
the proposed scheme is based on bit embedding on the singular
value (luminance) of the blocks within wavelet subband of the
original image. To improve the fidelity and the perceptual quality
of the watermarked image and to enhance the security of watermarking, we model the adaptive quantization parameters based
on the statistics of blocks within subbands. The scheme is robust
against JPEG compression but extremely sensitive to malicious
manipulation such as filtering and random noising. Watermark
detection is efficient and blind in the sense only the quantization
parameters but not the original image are required. The quantization parameters adaptive to blocks are vector quantized to reduce
the watermarking overhead.
Index TermsFragile watermarking, singular value decomposition (SVD), statistic modeling, wavelet.

I. INTRODUCTION

HE ADVENT of the Internet and the advancement of

digital technologies in the past decade have enabled
numerous applications in the areas of the multimedia communications and multimedia networking. While one of the
great advantages of digital data is that it can be reproduced
losslessly, it is also vulnerable to imperceptive modification
and malicious tampering. Thus, the authentication and the
copyright protection from unauthorized manipulation of digital
audio, image, and video data become an essential concern in
the digital multimedia era. Digital watermarking [1] has attracted considerable attention and seen numerous applications
recently. An effective authentication scheme should possess
the following characteristics: transparency, robustness to compressions, sensitivity (fragility) to malicious manipulation, and
blind detection of watermarks. Among the several categories
of watermarking schemes, the wavelet-based watermarking
schemes and image-adaptive watermarking schemes are of
great interest due to their impressive performance in transparency, robustness, sensitivity, and blind detection for the
various applications.

Manuscript received April 22, 2003; revised July 27, 2003. This paper was
recommended by Associte Editor E. Izquierdo.
P. Bao is with the School of Computer Engineering, Nanyang Technological
University, 639798 Singapore (e-mail: aspbao@ntu.edu.sg).
X. Ma is with the Department of Computer Science, Xuzhou Normal University, Xuzhou 221004, China (e-mail: maxiaohu@public.xz.js.cn).
Digital Object Identifier 10.1109/TCSVT.2004.836745

In 1997, Xia et al. [2] proposed a multiresolution watermarking method by inserting pseudorandom codes to the
large coefficients at the high- and middle-frequency bands
of the dicrete wavelet transform (DWT) of an image. Their
watermarking method is robust to some common image compressions and halftoning but the detection of the watermark
is dependent on the noise level in an image. Inoue et al.
[3] proposed a watermarking scheme by classifying wavelet
coefficients as insignificant or significant using zerotree and
then embedding a watermark in the location of insignificant
coefficients or in the location of the thresholded significant
coefficients at the coarser scales. Xie et al. [4] proposed a
scheme combining watermarking with wavelet compression by
engraving a watermark in the wavelet coefficients and encoding
the watermarked coefficients using SPIHT compression algorithm. Their method is nonadaptive and may alter the original
frequency correlations of the images. Tsai et al. [5] proposed
a watermarking scheme which utilizes the wavelet domain
image frequency components and the chaotic transformation to
select the location during the watermark embedding. Vehel et
al. [6] presented a digital image watermarking by modifying
certain subsets of the wavelet packet decomposition, determined from a secret key and an image dependent procedure. Hu
et al. [7] proposed a watermarking scheme using pixel-based
scaling, where the scaling factors for the pixel-based method
are adaptively determined by the effect of luminance and
local spatial characteristics. Taskovski et al. [8] presented a
low-resolution content-based watermarking scheme, where the
watermark is embedded in the lowest resolution of three-level
wavelet decomposition incorporated with a visual modeling
of the local image characteristics. Besides the aforementioned
watermarking schemes based on the structural distribution in
wavelet domain for watermark embedding, schemes based on
the human perceptual modeling of the wavelet coefficients were
also proposed. Wei et al. [9] introduced a perceptually based
watermarking technique where the watermark is inserted in the
wavelet coefficients so that watermark noise does not exceed
the just-noticeable difference of each wavelet coefficient. Barni
et al. [10] proposed a watermarking algorithm based on the
masking of the watermark according to the characteristics of
the human visual system (HVS).
In all the previous wavelet-based watermarking schemes, the
watermark bits would be directly embedded in the locations of
the wavelet coefficients determined by the various modeling.
While the watermarks embedded in the wavelet coefficients

1051-8215/$20.00 2004 IEEE

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 15, NO. 1, JANUARY 2005

may be able to preserve the visual perceptions of the original

images, it is vulnerable to compressions since the watermarked
coefficients may be subject to thresholding and quantization in
the compression process, thus damaging the watermark bits.
Aiming at the indirect watermarking embedding, Gorodetski et
al. [11] proposed a simple singular value decomposition (SVD)
domain watermarking scheme by embedding the watermark
to the singular values (SVs) of the images, to achieve a better
transparency and robustness. But the method is not image adaptive and unable to offer a consistent perceptual transparency of
watermarking for different images. Liu et al. [12] presented a
robust SVD domain watermarking scheme where a watermark
(in the form of a matrix) is added to the singular value matrix of
the watermarking image in spatial domain. Lius scheme offers
good security against tampering and common manipulations for
protecting rightful ownership. But since the scheme is designed
for the rightful ownership protection, where the robustness
against manipulations is desired, it is suitable for authentication.
The scheme is also nonadaptive thus unable to offer a consistent
perceptual transparency of watermarking for different images.
Chen et al. [13], [14] introduced a framework for charactering
the inherent tradeoffs between the robustness of the embedding,
the degradation to the host image, and the amount of data embedded and designed a framework of information embedding
systems, namely quantization index modulation (QIM), aiming at
optimizing the rate-distortion-robustness tradeoffs. They developed a method, the dither modulation, to realize and demonstrate
the QIM framework, where the embedded information would
modulate the dither signal of a dithered quantizer. The QIM
schemes can achieve an optimal tradeoff between the embedding
rate, the distortion and the robustness by freely adjusting the
number of quantizers, the quantization steps and the minimum
distance, respectively, for different requirements such as robustness to a known manipulation. But the QIM schemes manipulate
the quantization-index modulation directly in the original signal
domain and fail to take the advantages offered by wavelet-based
or other indirect watermarking schemes in achieving a better
performance in all the characteristics.
Synthetically, it seems that none of the schemes could simultaneously offer the characteristics of adaptive transparency,
robustness to compressions, sensitivity to malicious manipulation and blind detection of watermarks. To address this issue, we
design a novel image-adaptive watermarking scheme for image
authentication by applying a quantization-index-modulation
process on the SVs of the images in wavelet-domain in this
letter. In this scheme, the watermark bits are embedded on the
SVs in the SVD layers for each of the wavelet domain blocks,
with the quantization steps adaptive to the statistical model
of the block, which ensures that the overall luminance change
be minimized and perceptually unnoticeable. The block size,
together with the weighting parameters and the minimum and
maximum quantization steps, would determine how well a block
could be modeled statistically leading to a unified framework for
controlling the transparency, robustness against compressions,
fragility to malicious manipulations, and embedding rate. Since
the watermark is distributed at the luminance (the SVs) in all the
subbands where the relative luminance (thus,the watermark) in
wavelet domain would be well preserved during the coefficient

97

quantization, it is extremely robust to the JPEG compressions. On

the other hand, the watermarks so embedded are very fragile to
any malicious manipulations such as filtering or random noising
since any manipulation attempt would most probably damage
watermark bits in all the subbands, thus destroy the authenticity
of the watermark. The watermark detection in our scheme is
blind, i.e., only the quantization parameters but not the original
watermark image are needed. Furthermore, since the watermark
embedding is based on the quantization of the SV of blocks where
the quantization parameters are modeled by the block statistics in
the wavelet domain, it is, thus, impossible to maliciously detect
the watermark without the quantization parameters.
II. WATERMARKING BASED ON SVD
matrix
A grayscale digital image is specified by an
. If a color image is represented in RGB then it
can be converted to the corresponding luminance matrix
. An arbitrary matrix
can be represented by its SVD in the following form:
(1)
where
and
are orthogonal
and
matrices,
respectively, and is a diagonal matrix with nonnegative eleof matrix are SVs of
ments. Diagonal terms
matrix and is the rank of matrix . SVD possesses several attractive mathematical properties, one of which is that each
SV specifies the luminance of the SVD image layer, whereas
the respective pair of singular vectors specifies intrinsic geometry properties of images. It was discovered that slight variations of SVs do not affect the visual perception of the cover
image, which motivates the watermarking embedding through
slight modifications of SVs in the segmented images.
The proposed scheme is briefly described as follows. An
image represented in matrix format is segmented into blocks
(in our experiment, is generally set to 4) and
of size
the SVD for each of the blocks is performed. Then, one bit of
data is embedded through a slight modification of the SV of
the block. Let be the current bit of the watermark image to
. The embedding algorithm is
be embedded into this block
described as follows.
1) Segment the image into blocks
of size
,
, where is the number of the blocks.
, where
,
2) Compute
is a vector formed by the SVs of each block
.
, where
is the
3) Compute integer number
corresponding to the block
.
quantization step for
4) Embed one bit of watermark image as follows.
, then
If
If is odd number, then
ELSE remains unchanged
If
, then
If is even number, then
Else remains unchanged.
and the modified
5) Compute the value
SV

98

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 15, NO. 1, JANUARY 2005

TABLE I
CONSTANT QUANTIZATION STEP d: THE QUALITY OF WATERMARKED IMAGE (PSNR) AND BER OF THE EXTRACTED WATERMARKS CORRESPONDING TO
SEVERAL JPEG COMPRESSIONS, RESPECTIVELY

6) Compute the matrix of the block using the modified SV

7) Reconstruct the watermarked image from all the blocks

.
It should be noticed that quantization step would be served
as a secret key to ensure the authorized access to the watermark.
be a
The extraction of the watermark is straightforward. Let
block with an embedded watermark bit.
1) Segment watermarked image into blocks
of size
,
, where is the number of the blocks.
,
,
2) Compute the value
of
where is a vector formed by the SV
.
each block
3) Compute
.
4) If is even number, then the embedded bit is 1. Otherwise, it is 0.
III. MODELING OF THE QUANTIZATION PARAMETERS
A. Quantization Parameters Based on Spatial Domain
Modeling
For a watermarking scheme, it is desired that the watermarked images achieve a high PSNR while the watermark can
be detected and extracted robustly against any compression
schemes, i.e., possessing a lower bit-error ratio (BER) against
compressions. In the aforementioned SVD-based watermarking
leads
scheme, it is obvious that the increase of the value
to more robust watermark embedding (lower BER) but poorer
transparency of the watermarked image (lower PSNR) and vice
versa. Table I gives the PSNRs of the watermarked images using
several constant quantization steps and their corresponding
BERs against JPEG compressions. Fig. 1 shows the visual
perceptions of the watermarked images for various quantization
steps, respectively.
From Table I, it can be observed that the perceptual quality of
watermarked image is reversely proportional to the robustness
against JPEG compression. In order to preserve the high perceptual quality of the watermarked image while retaining a good
robustness to JPEG compression, we propose an image-adaptive quantization for image watermarking. With this adaptive

quantization scheme, a watermarking scheme with high transparency and robustness to JPEG compressions can be obtained.
The method can be described as follows.
for each block
.
1) Calculate the standard deviation
and minimum value
2) Calculate the maximum value
for all the
.
for the block
as
3) Compute the quantization step
(2)
where
is the number of all blocks,
and
are
minimum and maximum quantization step values, respectively, specifiable by user.
Table II gives some comparison results with the basic algorithm
in Section III and Fig. 2 gives the visual examples of the water9 and
36 or 45.
marked images, where
Note from Table II that the BERs increase rapidly as the JPEG
compression ratios. This is because that the watermarking distribution is only adaptive to the standard deviation of each block in
the spatial domain. Thus, the SVs of a more spatially structured
block (larger deviation) would be significantly modified which
may be insignificant in wavelet domain and thus be thresholded.
On the other hand, the SVs of a less spatially structural block
(small deviation) would be slightly modified, which, however,
could be significant in wavelet domain allowing the embedding
of more watermark information. Thus, the aforementioned watermarking distribution scheme would result in a less satisfying
transparency and a poor robustness to compressions.
B. Adaptive Quantization Parameters Based on Wavelet
Domain Modeling
In view of this potential drawback, we propose a set of quantization parameters modeled adaptively to both the deviation and
the expectation of each block within the wavelet domain where
the SVs for the real structures will be largely modified with watermarking whereas that of the nonstructural background will be
slightly modified to ensure a high perceptual quality of watermarked image and a low BER of the detected watermark. The
scheme is detailed as follows.
1) An image is transformed into wavelet subbands. In each of
the subbands, the coefficients are segmented into blocks
and SVDs for each of the blocks are comof size
puted.

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 15, NO. 1, JANUARY 2005

99

Fig. 1. Visual appearances of the watermarked images obtained by constant quantization steps. (a) Watermark image. (b)(c) Two original images. (b1)(b3)
Watermarked images corresponding to the original image (b) when quantization steps d are set to 9,27, and 54, respectively. (c1)(c3) Watermarked images
corresponding to (c) when d
9, 27, and 54, respectively.

TABLE II
IMAGE ADAPTIVE QUANTIZATION STEP d : THE QUALITY OF WATERMARKED IMAGE (PSNR) AND BER OF THE EXTRACTED WATERMARK CORRESPONDING TO
SEVERAL JPEG COMPRESSION RATIOS, RESPECTIVELY

2) Calculate the standard deviation

and average value
for DWT coefficients of each block
.
for each block
3) Calculate the value
(3)
where
and
are the weight parameters for
and
.
and minimum value
4) Calculate the maximum value
from all the
.
5) Compute the quantization step for block
as follows:
(4)

is the number of the blocks, and

and
are the
where
minimum and maximum quantization step values, respectively,
specifiable by user.
We model the quantization parameters based on both the expectation and deviation of the block to capture both the structural and background statistics in quantizing the modification
and
of the SV. In our experiment, we set
or , and let
,
. The value
is formulated so that both the baseband and the high-pass bands can be
watermarked and the modifications of the SVs can be adjusted
and . Parameter
controls the quantiusing parameters
zation weighting for the background while for the structures.

100

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 15, NO. 1, JANUARY 2005

TABLE III
THE QUALITY OF WATERMARKED IMAGE (PSNR) AND BER OF THE EXTRACTED WATERMARK CORRESPONDING TO 40% JPEG COMPRESSION FOR DIFFERENT
VALUES OF PARAMETER c AND c , RESPECTIVELY

watermark extraction. The experiment shows that while the

transparency of watermarked images can be well preserved, the
number of the error bits detected in the detected watermark is
very small, an obvious advantage in watermarking applications.
However, these image-adaptive quantization parameters must
be transmitted as the secrete key for the correct extraction of
the embedded watermark from the watermarked image and thus
the size of the quantization parameters would be an overhead
concern if they were not efficiently encoded. In this section, we
propose using the vector quantization to compress the secrete
keys without affecting the effectiveness of the watermarking
scheme.
The vector quantization for the image-adaptive quantization
parameters is described as follows.
1) Create the new range [0,14] from the original range [9,36],
which can be describe as follows:

Fig. 2. Experimental results of the wavelet domain image-adaptive

SVD watermarking scheme. (a) Watermark image. (b) Original images.
(c)Watermarked images with PSNRs 38.6755, 38.3048, 39.3839, 38.9264, and
37.4773, respectively. (d) Detected watermark image from LL band, where
d
2 [9; 45] or d 2 [9; 36].

Table II presents the quality of the watermarked image (PSNR)

and the BER of the extracted watermark corresponding to several JPEG compression ratios, respectively. Table III gives the
quality of the watermarked image (PSNR) and the BER of the
extracted watermark corresponding to the different values of the
and .
parameter
C. Vector Quantization of the Quantization Parameters
In the proposed watermarking scheme, the image-adaptive
quantization parameters are adopted as the secrete keys for the

2) Divide the new quantization parameter matrix into 5 5

subblocks, and arrange each of the subblocks as 5 5 4
vectors.
is established using the Gen3) A codebook with size
can be
eralized Lloyd algorithm. In our experiment,
generally set to 64 or 32.
4) Encode the index of each 5 5 quantization parameter in
the codebook.
The compression ratio and the perceptual quality of the watermarked image are illustrated in Fig. 3 using 200 200 Lena,
Peppers, and Baboon with different codebook sizes. The file size
of the original image Lena (200 200) is 118 KB in bitmap uncompressed format or 37 KB in JPEG compressed format. From
the Fig. 3, it can be observed that the high quality of the waterand the wamarked image can been preserved when
termark key is sized at
kB or at a compression ratio of 80:1 (0.4517:37).
IV. EXPERIMENTAL RESULTS AND DISCUSSIONS
In this section, experimental results are given to illustrate
the transparency, robustness against JPEG compression and
fragility against malicious manipulation of the proposed watermarking scheme. The perceptual quality of images after
the watermarking insertion is showed. The tolerance of the
scheme against compressions and the fragility to the various
malicious manipulations is experimented. Table II and Fig. 2
give the respective results. From the Table II and Fig. 2, it can

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 15, NO. 1, JANUARY 2005

101

TABLE IV
COMPARISONS BETWEEN THE PROPOSED METHOD AND WAVELET BASED WATERMARKING SCHEMES ON 512 512 IMAGES: BER OF THE EXTRACTED
WATERMARK CORRESPONDING TO SEVERAL JPEG COMPRESSION RATIOS, RESPECTIVELY

Fig. 3. (a)(b) Watermarked image Lena when S is set to 64 and 32,

respectively. (c)(d) Peppers when S is set to 64 and 32, respectively.
64,
(e)(f) Baboon when S is set to 64 and 32, respectively. (a) S
PSNR = 38:7383. (b) S = 32, PSNR = 38:6065. (c) S = 64,
PSNR = 38:8181. (d) S = 32, PSNR = 38:7204. (e) S = 64,
PSNR = 37:0850. (f) S = 32, PSNR = 36:9575.

be observed that the proposed hybrid wavelet domain SVD

watermarking scheme preserves not only the high perceptual
quality of the watermarked image, but also possesses an excellent robustness against the JPEG compression with various
compression ratios. Compared with the spatial domain SVD
scheme, the proposed scheme achieves extremely low BERs
while retaining high PSNRs even against a compression ratio
as low as 20%. For example, for image Shore, the wavelet SVD

produces virtually no errors for the extracted watermark while

the simple SVD scheme has a BER between 1.87 and 15.24. For
the compression ratios at 40% or lower, the proposed scheme
starts to generate some errors for the extracted watermarks
and , we could
but by varying the weight parameters
minimize the BER for a given PSNR range. Table III shows the
PSNR measurement of the watermarked images at 40% JPEG
compression and different BERs corresponding to different
and , respectively, where the optimal
values of parameter
BERs are boldfaced.
Obviously, the transparency of the watermarked images
and the robustness against JPEG compression are closely
related to the number of the embedded bits, thus the size
of blocks. The larger
is set, the fewer bits are embedded
resulting in the better transparency (higher PSNR) and robustness
is set
(lower BER). Table IV gives some results when
to 8 and the watermark bits are only inserted into the LL
subband, in comparisons with other watermarking schemes
[3], [11]. It can be seen that the proposed scheme significantly
outperforms the simple SVD scheme [11] in BER for various
compression ratios while achieving better visual perceptions
of the watermarked images. And the proposed method also
outperforms the two wavelet-based watermarking schemes [3]
and the QIM method [13] in BERs for various compression
ratios with comparable PSNRs. Note that the PSNR values
achieved are lower compared to those by the wavelet schemes
but the perceptual differences are unnoticeable (PSNRs at 40
dB or higher usually lead to excellent visual perceptions).
Table IV also shows that the proposed scheme could achieve
a higher embedding rates than SVD-based, wavelet-based and
QIM watermarking schemes. It should be clarified that in
Table IV, the data by the proposed method and the simple SVD
method are produced by experiment but the corresponding
data by the wavelet and QIM methods are taken directly
from [3], [13]. The PSNR measurements and the robustness
(BER) against JPEG compressions may vary for different
wavelets and thus the comparison should be served as a
reference.
It is also shown that in the proposed scheme the watermark
extracted is very fragile to the malicious manipulations such
as cropping, random noising (Gaussian), and filtering, etc.

102

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 15, NO. 1, JANUARY 2005

Fig. 4. (a1)(a2) Modified watermarked images. (b1)(b2) Detected watermark images corresponding to the LL band. (c1)(c2) Enlarged detected watermark
images for detecting the malicious modification operation.

Fig. 4 shows that the proposed wavelet domain SVD-based

watermarking scheme can effectively detect the malicious
manipulations made on the watermarked image, including
and
, and median
cropping, Gaussian
filters (3 3) and (4 4), where the watermarks extracted are
seriously damaged for all the manipulations. Thus any attempt
to manipulating the watermarked images would be detected
and the content associated with the images would be effectively
authenticated.
V. CONCLUSION
In this letter, a novel, yet simple, hybrid wavelet domain
SVD-based watermarking scheme for image authentication
is presented, where the watermark bits are embedded on the
SV (luminance) of the blocks within each wavelet subband of
the original image. The quantization parameters of the watermarking are modeled based on the statistics of block images
within different subbands in wavelet domain thus adaptive to
the individual image. The parameters can be automatically
determined for the enhanced perceptual quality of the watermarked images. While the proposed scheme preserves high
perceptual quality of the watermarked image (high PSNR)
and possesses an excellent robustness to JPEG compression
(low BER), it also possesses an excellent fragility to various
malicious manipulations, thus enabling a variety of the authenticated networked multimedia applications. The watermark
detection is also efficient and blind, i.e., only the compressed
quantization parameters but not the original image are needed.
Since the watermark embedding is solely determined by the
quantization parameters, the malicious detection of the watermark would not be possible without knowing the quantization
parameters. The scheme also achieve higher embedding rates
than other methods.

REFERENCES
[1] G. L. Friedman, The trustworthy digital camera: restoring credibility to
the photographic image, IEEE Trans. Consumer Electron., vol. 39, pp.
905910, Nov. 1993.
[2] X. Xia, C. G. Bonceletand, and G. R. Arce, A multiresolution watermark for digital images, in Proc. Int. Conf. Image Processing, vol. 1,
Santa Barbara, CA, Oct. 1997, pp. 548551.
[3] T. Inoue, H. Miyazaki, A. Yamamoto, and A. Katsura, A digital watermark based on the wavelet transform and its robustness on image compression, in Proc. Int. Conf. Image Process., vol. 2, Chicago, IL, Oct.
1998, pp. 391395.
[4] L. Xie and G. R. Arce, Joint wavelet compression and authentication
watermarking, in Proc. Int. Conf. Image Process., vol. 2, Chicago, IL,
Oct. 1998, pp. 427431.
[5] M. Tsai, K. Y. Yu, and Y. Z. Chen, Joint wavelet and spatial transformation for digital watermarking, IEEE Trans. Consumer Electron., vol.
46, no. 1, p. 237, Feb. 2000.
[6] J. L. Vehel and J. L. Manoury, Wavelet packet-based digital watermarking, in Proc. 15th Int. Conf. Pattern Recognit., vol. 3, Barcelona,
Spain, Sept. 2000, pp. 413416.
[7] Y. Hu and S. Kwong, Wavelet domain adaptive visible watermarking,
Electron. Lett., vol. 37, no. 20, pp. 12191220, Sep. 2001.
[8] D. Taskovski, S. Bogdanova, and M. Bogdanov, A low resolution content based watermarking of images in wavelet domain, in Proc. 2nd Int.
Symp. Image and Signal Process. Analysis, Pula, Croatia, Jun. 1921,
2001, pp. 604608.
[9] Z. H. Wei, P. Qin, and Y. Q. Fu, Perceptual digital watermark of images
using wavelet transform, IEEE Trans. Consumer Electron., vol. 44, no.
4, pp. 12671272, Nov. 1998.
[10] M. Barni, F. Bartolini, and A. Piva, Improved wavelet-based watermarking through pixel-wise masking, IEEE Trans. Image Processing,
vol. 10, no. 5, pp. 783791, May 2001.
[11] V. I. Gorodetski, L. J. Popyack, and V. Samoilov, SVD-based approach
to transparent embedding data into digital images, in Proc. Int. Workshop, MMM-ACNS, St. Petersburg, Russia, May 2001, pp. 263274.
[12] R. Liu and T. Tan, An SVD-based watermarking scheme for protecting
rightful ownership, IEEE Trans. Multimedia, vol. 4, no. 1, pp. 121128,
Mar. 2002.
[13] B. Chen and G. W. Wornell, Achievable performance of digital watermarking systems, in IEEE Int. Conf. Multimedia Computing and Systems, June 1999, pp. 1318.
[14]
, Quantization index modulation: a class of provably good
methods for digital watermarking and information embedding, IEEE
Trans. Inform. Theory, vol. 47, no. 4, pp. 14231443, May 2001.