Blind Watermarking Technique

For Authentication
Guided By :Prof. Mita C Paunwala Prepared By :Sandhya Verma Poonam Yadav Disha Parmar Yesha Patel

Introduction
Digital Image Watermarking is defined as the process of

proving the intellectual property rights.

Digital watermarking is a technique, which secretly

embeds digital data into the material to identify the origin, owner, informal user, etc.

Digital watermarking techniques

Robust :- Malicious attacks, such as scaling, rotation,

filtering, and compression.

Fragile :- It can detect any unauthorized modification in an

image.
Semi-fragile :- Watermark is adopted to detect the

unauthorized modifications, and, at the same time, it must survive some authorized image processing operations.

Digital watermarking technique

Non-blind

Watermarking :- Systems require for extraction/detection the original cover-data.

Type I systems use the original cover-data to extract the

watermark from watermarked-data and use original coverdata to determine where the watermark is.

Digital watermarking technique

Type II systems require a copy of the embedded watermark

for extraction and just yield a yes/no answer to the question weather watermarked-data contains a watermark.
Blind Watermarking: Neither cover-data nor embedded

watermarks are required for extraction - this is the most challenging problem.

Digital watermarking techniques

Secret Message

Carrier Document

Embeddin g Algorithm

Transmissio n Via Network

Detecto r

Retrive Messag e

Digital watermarking technique

Basically watermarking can be done in lots many domain that are as below. 1)Spatial domain 2)Transform domain a. Discrete Fourier transform(DFT) b. Discrete cosine transform(DCT) c. Discrete wavelet transform(DWT) d. Hadamard Transform(HT) From above mentioned method DCT and DWT are robust against image processing. Their main drawback is requiring the original image to extract the watermark.

EMBEDDING TECHNIQUE
COVER IMAGE

EMBEDDING TECHNIQUE
DCT TRANSFORM COVER IMAGE

EMBEDDING TECHNIQUE
8x8

8x8

COVER IMAGE

DCT TRANSFORM

EMBEDDING TECHNIQUE
8x8

8x8

COVER IMAGE

DCT TRANSFORM

DC

AC(0,1) AC(0,2)

AC(1,0) AC(2,0)

AC(1,1)

 ESTIMATED ACS AC(0,1)=1.13884*(DC4 DC6) / 8; AC(1,0)=1.13884*(DC2 DC8) / 8; AC(0,2)=0.27881*(DC4 +DC6 -2* DC5) / 8; AC(2,0)=0.27881*(DC2 + DC8 2* DC5) / 8; AC(1,1)=0.16213*(DC1 + DC9 DC3 DC7) / 8;

EMBEDDING WATERMARK If watermark bit=1 Aci >=ACi + If watermark bit=0 Aci <=ACi +

BLOCK 1 BLOCK 2 BLOCK 3 DC 1 DC 2 DC3 BLOCK 4 BLOCK5 DC 4 DC5 BLOCK7 DC 7 BLOCK8 DC8 BLOCK 6 DC6 BLOCK 9 DC9

RETRIVING TECHNIQUE
8x8

8x8

WATERMARKED IMAGE

DCT TRANSFORM

AC(0,1) AC(0,2)

AC(1,0) AC(2,0)

If Aci> Aci extract bit 1 If Aci< Aci extract bit 0

AC(1,1)

MATCHING PARAMETERS TO PROOF WHICH TECHNIQUE IS BETTER

Similarity factor (SF):

SF=
Peak signal to noise ratio (PSNR):

PSNR= 10 log10

MATCHING OF OUR TECHNIQUES FOR PSNR AND SF

RESULT

COVER IMAGE

WATERMARK IMAGE

WATERMARKED IMAGE

RECOVER IMAGE

WATERMARKED IMAGE AFTER DIFFERENT ATTACKS

WATERMARKED AFTER COMPRESSION

WATERMARKED AFTER SALT AND PEPPER NOISE

WATERMARKED AFTER FILTERING

EXTRACTION OF WATERMARK AFTER COMPRESSION ATTACK

Images QF 90 80 70 60 Lena 90 80 70 60 Mandrill 90 80 70 60 SF Cameraman 0.7431 0.7401 0.6820 0.6789 0.8869 0.8746 0.8624 0.8563 0.9174 0.8931 0.8379 0.8073

AFTER SALT AND PEPPER NOISE ATTACK

Images Cameraman Density 0.002 0.003 0.005 Lena 0.002 0.003 0.005 Mandrill 0.002 0.003 0.005 SF 0.8624 0.8349 0.7951 0.9235 0.9052 0.8624 0.9358 0.8838 0.8593

Application
Automatic monitoring and tracking of copy-write material

on WEB. (For example, a robot searches the Web for marked material and thereby identifies potential illegal issues.) Automatic audit of radio transmissions: (A robot can listen to a radio station and look for marks, which indicate that a particular piece of music, or advertisement , has been broadcast.)

Contd

Fingerprinting applications (in order to distinguish

distributed data)
Actually, watermarking has recently emerged as

the leading technology to solve the above very important problems.

All kind of data

can be watermarked: audio, images, video, formatted text, 3D models, model animation parameter

CONCLUSION
Nowadays multimedia products are digitized but it has many disadvantage like copyright, unauthorized modification, hence we have to protect from such problem. Mostly all the non-blind technique require original image for recovering at the receiver, but it is not desirable to have original image at the recevier side. There are many applications of watermarking like broadcasting, TV, news serial in which watermark image is visible like logo of the channel. So for that non-blind technique is used.

But in case of finger print security, valuable companies image data no original image is present so for that case blind watermarking technique is necessary. So looking about the above interest we are using blind watermarking technique in which original image is not require.

REFRENCE
[1] Katzenbeisser, S., Petitcolas, F. A. P., Information Hiding Techniques for Steganography and Digital Watermarking, Artech House Editions, 2000. [2] Cox, I. J., Kilian, J., Leighton, F. T., Shamoon, T., Secure Spread Spectrum Watermarking for Multimedia, IEEE Trans. On Image Processing, No. 6, Vol. 12,pp 1673-1687, 1997. [3] Hsu, C. T., Wu, J. L., Multi-resolution Watermarking for Digital Images, IEEE Trans. On Circuits & Systems: Analog & Digital Signal Processing, Vol. 45, No. 8, 1998. [4] Hsu, C. T., Wu, J. L., Hidden Digital Watermarks in Images, IEEE Trans. On Image Processing, Vol.8, No. 1, 1999. [5] Wang, Y., Pearmain. A., Blind Image Data Hiding Based on Self Reference, Pattern Recognition Letters, Vol. 25, Issue 15, pp. 1681-1689, November 2004. [6] B.J. Falkowski, L. Lim, Image watermarking using Hadamard transform, Electron. Lett. 36 (3), pp. 211213, 2000.

 [7] Ho, A., Shen, J., Soon, H. T., Kot, A. C., Digital Image-in-image watermarking for Copyright

Protection of Satellite Images using the Fast Hadamard Transform, IEEE Int. Geosciences and Remote Sensing Symp., pp. 3311-3313., 2002. [8] Gilani, S. M., Skodras, A. N., Watermarking by Multi-resolution Hadamard Transform, Proc. of European Conf. On Electronic Imaging and Visual Arts (EVA 2001), Florence, Italy, March 2001. [9] Fei, C., Kundur, D., Kwong, R. H., The Choice of Watermark Domain in the Presence of Compression, Proc. Of IEEE Int. Conf. On Information Technology: Coding & Computing, pp 7984, Las Vegas, Nevada, April 2001. [10] Prat, W. K., Digital Image Processing, John Wiley Editions, 1991. [11] Gonzales, C. A., Allman, L., Mccarthy, T., Wendt,P., "DCT Coding for Motion Video Storage Using Adaptive Arithmetic Coding ",Signal Processing: Image Communication,No.2,1990. [12] Kim, C., Li, Q., Kuo, C., J., "Fast Intra-Prediction Model Selection for H- 264 Codec", Proc. of ITCOM03, 2003.