Abstract
V i s i b l e W a t e r m a r k i n g i s a n i n f o r m a t i o n h i d i n g t e c h n o l o g y b y w h i c h a n i m a g e
(watermark) can be "embedded" into another image(host) through some algorithms , and
the embedded image can be easily concerned with no visual difficult; compared with
stacking two images together simply, the embedded image can not be removed easily
and can resist to attack intentionally or unintentionally, in other words, it has a feature
of strong robustness.
To the digital watermark, no matter what is visible or invisible, only two methods
m a i n l y a r e e x i s t t o r e a l i z e d w a t e r m a r k a t p r e s e n t i f w e o n l y c o n s i d e r t h e a l g o r i t h m
theory itself, that is on the spatial transportation and on the frequent transportation.
Before an image is transported , it usually need to be divided into 8x8 and 16x16
pieces, then these pieces are transported one by one. There are these frequent
transportation such as DFT 、DCT、DLT、DWT ,etc.
A t p r e s e n t , v i s i b l e w a t e r m a r k i s m a i n l y u s e d i n t h e f i e l d s s u c h a s d i g i t a l
image(include video image) protection on the internet, and therefore, there is a need to
address issues related to the security and protection of data such as more and more
d i g i t a l l i b r a r i e s o n t h e We b , s o i t i s m o r e m e a n i n g f u l f o r u s t o s e a r c h a u s e f u l a n d
practical watermark realization method. The representation of this method practicability
is: 1) the embedded watermark using this method is more robust; 2) the algorithm of
this method is easier to be realized in computer relatively. All my done is as followed:
F i r s t l y , t h e W a v e l e t t r a n s p o r t a t i o n a n d i s s u e s r e l a t e d t o i t a r e d i s c u s s e d .
W a v e l e t t r a n s p o r t a t i o n i s m a i n l y r e a l i z e d b y w a v e l e t s c a l i n g f u n c t i o n a n d w a v e l e t
function. Any discrete image signal can be represented by their combination. If they are
all biorthogonal ,then the fast wavelet transportation can complemented.
Secondly ,an algorithm based on DHWT is presented in this thesis and its relative
program is also presented. To discrete wavelet transportation, two-dimensional image is
split into 4 fields. Because of the human visual system feature, people are usually not
the same sensitive to them. At these grounds, through research and computer
s i m u l a t i o n , a s o u n d f o r m u l a i s p r o p o s e d t o s e l e c t s c a l e o p t i o n s f o r v i s i b l e d i g i t a l
watermark.
Lastly ,the watermark realized using this algorithm is tested by some attack for its
r o b u s t n e s s a n d s o m e a t t a c k p r o g r a m s a r e g i v e n . T h e r e i s a m o s t m e n a c e f o r v i s i b l e
w a t e r m a r k , t h a t i s r e v e r s e o p e r a t i o n , s o i t h a s b e e n d i s c u s s e d a n d t e s t e d i n t h i s
disse rtat ion .At the sam e time ,w e al so s ay , the emb edded wa term ark is pract ical ly a
noise signal and in some senses ,the image smoothness process is for removing noise ,so
i t h a s a h e a v y i n f l u e n c e t o t h e w a t e r m a r k , t h e r e f o r e , i t h a s a l s o b e e n d i s c u s s e d a n d
tested in this dissertation.
K e y w o r d s : v i s i b l e d i g i t a l w a t e r m a r k,w a v e l e t t r a n s p o r t a t i o n, s c a l i n g c o e f f i c i e n t,
robustness
2