[attachment=14178]
INTRODUCTION
EXISTING SYSTEM
Digital Watermark is an invisible mark inserted into the digital multimedia data so that it can be detected in the later stage of evidence of rightful ownership. A great deal of research efforts has been focused on digital watermark in recent years. The techniques proposed so far can be divided into two main groups of according to the embedding domain of the container imag
1) Spatial Domain Approach:
One group is SPATIAL domain approach .The earliest watermarking techniques are mainly this kind and the simplest example is to embed the watermark into least significant bits(LSB) of the image pixels. However, this technique has relatively low information hiding capacity and can be easily erased by lossy image compression.
2) FREQUENCY DOMAIN APPROACH
The other group is FREQUENCY domain approach. This can embed more information bits and is relatively robust to attacks. They embedded a Guassian distributed sequence into the perceptually most significant frequency components of the container image. Another technique embedded an image watermark into selectively modified middle frequency of discrete cosine transform coefficients. One more algorithm embedded watermark using Fourier transformations that is invariant to image manipulations or attacks due to rotation scaling and translation. Still several methods used to hide the data to the frequency domain such as HVS, JND.
DRAWBACKS OF EXISTING SYSTEM
The major problem with many of these watermarking schemas is that they are not very robust against different types of image manipulations or attacks. Moreover, some of these techniques are quite complicated to implement in real-time.
PROPOSED SYSTEM
Due to above mentioned failures a new technique has been proposed so that to cover and maintain the drawbacks prevailed in the previous system and hence a technique called Fast Hadamard Transformation is proposed
ADVANTAGES
The FHT embedding algorithm was found to provide a robust and efficient approach to perform digital watermarking of digital image data for copyright protection and proof of rightful ownership.
The simplicity of FHT offers a significant advantage in shorter processing time and ease of hardware implementation.
REQUIREMENTS 
Hardware Requirements:
-Processor entium4
-RAM :128MB
-Hard disk :4.2GB
Software Requirements:
-Operating system :Windows98
-Tool :JDK1.4.2
Needs of watermarking
Copies can be produced easily and inexpensively.
Copies are exact duplicates and therefore indistinguishable from the original.
Copies can be distributed rapidly,especially in today’s networked world.
AN INTRODUCTION TO WATERMARKING
Descendent of a steganography .
Watermark—an invisible signature embedded inside an image to show authenticity or proof of ownership.

Discourage unauthorized copying and distribution of images over the internet.

STEGANOGRAPHY
Steganography is a technique for concealed communication .
In steganography the very existence of the message that is communicated is a secret.
Techniques of steganography like use of invisible ink, word spacing patterns in printed documents, coding messages in music compositions, etc.,
WATERMARKING
Watermarking can be considered as a special technique of steganography where one message is embedded in another and the two messages are related to each other in some way.
Eg: Currency Notes and Logos
Digital Watermarking Process
FEATURES OF DIGITALWATERMARKING
Imperceptibility
Robustness
Inseparability
Security
Classifications of digital watermarking
Robust&Fragile Watermarking
Visible&Transparent Watermarking
Public&Private Watermarking
Symmetric&Asymmetric Watermarking
Stegnography&Non-steganography
Symmetric watermarking
The key for embedding and detection of the watermark are identical. The detector must know the required private key for extracting the watermark from the digital data.
Asymmetric Watermarking
This depicts a general asymmetric watermarking scheme. With aid of a private and a public key, the watermark is embedded into the host signal(Original data)
Applications of digital watermarking
Copyright Protection:
-Digital watermarks can be used to identify and protect copyright ownership.
Tracking:
-Digital watermarks can be used to track the usage of digital content

Applications of Digital watermarking
Tamper Proofing:
-Digital watermarks, which are fragile in nature, can be used for tamper proofing.
Broadcast Monitoring:
  -Digital watermarks can be used to monitor broadcasted content like television and broadcast radio signals.

Digital watermarking
 using
 FHT
2D-Hadamard Transform of Signal
Let [U] represents the original image and [V] the transformed image, the 2D-Hadamard transform is given by
Hn [U] Hn
[V]= ----------------
N

Hn represents N * N Hadamard matrix

2D-IFHT
Hn [V] Hn
[U]= ----------------
N

where
Hn = Hn-1 * H1



Hn-1 Hn-1
Hn =
Hn-1 - Hn-1

In our algorithm, the processing is performed based on 8x8 sub-blocks of the whole image, the third order Hadamard transform matrix H3 is used.

Watermark Insertion Process
Watermark Extraction Process
MODULES IN OUR PROPOSED SYSTEM
INSERTION OF WATERMARK INTO ORIGINAL IMAGE

EXTRACTION OF WATERMARK FROM WATERMARKED IMAGE



METHODS USED

ImageBuild (Original,Watermark)
performFHTOnWatermark()
randomGenerator()
insertWatermark()
performFHTOnOriginal()
performIFHTOnOriginal()
loading()



METHOD DETAILS

METHODS USED FOR INSERTION OF WATERMARK
performFHTOnWatermark() : In this function the FHT algorithm is applied on the watermark image according to the size of it. If it is 16 X 16 image then we use a H4 Hadamard coefficient in the algorithm. The coefficient is selected in such a way that the size of the image is converted to the power of 2 and the power obtained is selected as the suffix of H.

Let [U] represents the original image and [V] the transformed image, the 2D-Hadamard transform is given by
[V]= Hn [U] Hn
N



Where Hn represents and NxN Hadamard matrix, N=2n, n=1, 2, 3….with element values either +1 or -1.

Also in this method the AC and DC components are separated after applying FHT on watermark image.

randomGenerator() : An m-sequence random generator is applied on the original image which is divided into sub blocks. These random points are used for inserting ac components of the watermark image into original image.

insertWatermark() : In this method firstly the original image is divided into sub blocks in such a way that if the original image is of the size 256 X 256 be sub divided into 8 X 8 sub blocks. Now the AC components of the watermark image are inserted into randomly selected points of the sub blocks. The dc components are stored in a Keyfile.dat.

performFHTOnOriginal() : In this method after inserting the AC components into random positions of original image,the resultant image is subjected to application of FHT algorithm individually on each sub-block.
Let [X] represents the original image and [Y] the transformed image, the 2D-Hadamard transform is given by
[Y]= Hn [X] Hn
N
Where Hn represents and NxN Hadamard matrix, N=2n, n=1, 2, 3….with element values either +1 or -1.


METHOD USED FOR EXTRACTION

performIFHTOnOriginal(): In this method the reverse process of insertion of watermark into original image is carried on. Firstly it gets the values of random points selected for insertion of AC components of watermark image from Keyfile.dat. Next,it gets the values of DC components stored in Keyfikle.dat. Now,the watermarked image is sub-divided in blocks and from the positions of AC inserted points the AC components are retrieved.On combination of these AC and DC components the watermark image is obtained.

[X]= Hn [Y] Hn
N



OVERALL USECASE DIAGRAMS

OVERALL SEQENCE DIAGRAMS


OVERALL ACTIVITY DIAGRAMS


OVERALL DATA FLOW DIAGRAMS


WORKING PROCESS



SCREENSHOTS










This paper has presented a robust hybrid watermarking technique for Embedding characters or grayscale image watermark into a container image based on the FHT. The embedding and extracting processes have been described in detail. The experimental results show that the proposed method is robust against approximately 70% of attacks.

When compared with the DCT ,it is found to be more robust against various attacks. It also refers significant advantage in terms of shorter processing time and the ease of hardware implementation than many common transform techniques.

FUTURE SCOPE
The future scope of this project includes

In this project we use a gray scale image for watermark image to insert into original image. In future, we may use a color image instead of the gray scale image.
In this proposed algorithm,according to the size of the image we have to multiply the hadamard coefficient(Hn).In future we may use an algorithm which provides the same formula for embedding different sizes of water mark image to different sizes of original image