P.Deepika* et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 7, Issue No.

1, 048 - 053

Watermark- Based Multimedia Content Authentication

1

P.Deepika

S.Rajesh Ph.D
Lecturer

Dr.V. Srinivasa Rao Ph.D

PROFESSOR AND HOD drvsrao9@gmail.com

II Year M.Tech paladugudeepika@yahoo.com

1,2

rssingam99@gmail.com

IJ
1.INTRODUCTION
ISSN: 2230-7818

A semi fragile scheme is a method that is designed to break under all changes that exceed a user specified threshold. In this project we propose a new approach called MSB-LSB (most significant bit least significant bit) decomposition. By this approach we can decrease the authentication distortion and increase the efficiency of secure authentication. By simulating semi-fragile authentication methods on real images demonstrate the effectiveness of the MSB-LSB approach in simultaneously achieving security, robustness, and fragility objectives. So we implement this process by embedding data as pixels into the image and then provide authentication by comparing the original and the embed image. Index TermsDigital watermarking, lattice codes, multimedia authentication, semi-fragile Authentication

Abstract- In my project I am trying to improve the authentication system used in issuing of passports . Previously signature based authentication is followed where the efficiency is very low.So I introduce a watermark based authentication system to increase the security and efficiency .So We provide a design framework for semi-fragile watermark-based authentication such that both objectives of robustness and fragility are effectively controlled and achieved. Where robustness and fragility are two type of Authentication errors we face. Initially proposed digital watermarking technique for authentication was highly fragile like traditional digital signatures .To minimize the errors we implement semi- fragile schemes using lattice codes .One of the first approaches to semi fragile watermarking is tell tale tamper proofing proposed by kundur and Hatzinakos.

Many multimedia authentication systems have been proposed in the last few years for ensuring the integrity and origin of multimedia data such as images. These systems fall into two

@ 2011 http://www.ijaest.iserp.org. All rights Reserved.

ES

broad categories: label-based systems and watermark- based systems . In label-based systems, an authenticator is appended to the original signal for integrity verification of the protected signal. The authenticator can be a sensitive function of the signal (e.g., hash) or a set of coarser content features such as block histograms, or edge maps. In watermark-based systems, the authenticator is imperceptibly embedded in the signal rather than appended to it, reducing the extra storage requirements of labelbased methods. Another advantage of watermark-based systems is that lossless format conversion of the secured multimedia does not necessarily change its authenticity results. This paper focuses on watermark-based multimedia content authentication. In particular, we address the problem of content authentication using a coding-based scheme in which a source-dependent authenticator is invisibly embedded within the source itself. The goal of multimedia authentication is to authenticate the content, not its specific format representation. Thus, the embedding of the authenticator as an invisible watermark in a host signal has two main objectives: to alert a party to unacceptable distortions on the host and to authenticate the legitimate source. Possible distortions on a signal can be divided into two groups: legitimate and illegitimate distortions. One of the first approaches to semi-fragile watermarking called telltale tamper proofing was proposed by Kundur and Hatzinakos to determine the extent of modification both in the spatial and frequency domains of a signal using a statisticsbased tamper assessment function. In semi-fragile watermarking, the watermark, often a host-dependent signature message or feature vector, must survive legitimate distortions, but be destroyed by illegitimate modifications applied to the signal. Most proposed schemes to date are either designed for robustness to specific distortions (usually compression) using ad hoc development measures, or borrow from the robust watermarking literature and tune down the resilience of the watermark.

Department of Computer Science and Engineering V R Siddhartha Engineering College Vijayawada--522007

Page 48

P.Deepika* et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 7, Issue No. 1, 048 - 053

1.1. NEED AND IMPORTANCE OF PROJECT PROBLEM 1.1.1 Existing System

Watermarking has been suggested to play an important role in securing the business, as it allows placing an imperceptible mark in the multimedia data to identify the legitimate owner and to prosecute the pirate .There are a number of requirements for watermarking techniques. Robustness: The embedded information is said to be robust if its presence can be reliably detected after theimage has been modified, but not destroyed beyond recognition. Invisibility: This concept is based on the properties of the human visual system or the human audio system. The embedded information is imperceptible if an average human subject is unable to distinguish between carries that contain the hidden information and those that do not. . Undetectability: The concept of undetectability is inherently tied to the statistical model of the image source. If an attacker has a more detailed model of the source, he may be able to detect the presence of a hidden image, but this does not imply the ability to read the hidden message. Security: The embedding algorithm is said to be secure, if the embedded information can not remove beyond reliable detection by targeted attacks based on a full knowledge of the embedding algorithm and the detector (except the secret key).Nowadays, computer involved in all life details.

proposed method consists of several algorithms. Each algorithm is responsible for one type of process. All the required validations processes will be taken inconsideration by the proposed method.

1.1.3 Objective
One of the serious problems is how to authenticate the passport document for its holder.The major factor of this authenticity is the corresponding of the Passport's photo with its holder. Mostof the Passport document contains a holder's signature in addition, of course, to the full name. We propose a firm authentication method by extracting some features for the original name of the holder with the passport number and digest them in a form, by applying some techniques, that can be hidden in the passport's photo. The modern method of issuing a passport now is by using a computer in fixing the passport's photo (imaging). In using this method we could hide the invisible watermark which contains the digest name and passport number inside the passport's photo. During the hidden process there are many techniques could be applied to disguise any color difference appears during the hidden process. After using this technique, it is very simple to use the computer in scanning and verifying, at check point, that the passport's photo has been not replaced and that by comparing the invisible watermark with the digest name of the holder and passport number

IJ
1.1..2 Proposed System
ISSN: 2230-7818

One of these issues is producing the passport document by using the computer application. To fill full this objective there are several requirements such as using a computerize photo for the passport holder with special colors (grey and white). Also most of the passport offices are connected through a network to exchange their information about the correctness of passport information and the authentication of the passport holder. It is possible to transfer the passport image between different offices to get information confirmation. Here, the main problem is how to confirm and authenticate the passport's photo with the information about the holder. There is no other way to tell if the photo been replaced with a new one ( for the current holder ) because there is no physical connection between the photo and the passport details.

The aim of the proposed method is to develop a firm connection between the passport's photo and the passport's details. In this case it is possible to use this method for confirmation of passport's information. The summery of this method is by converting the holder's name (1st, 2nd, 3rd and family name) in addition to the passport number into one form called an invisible watermark. This watermark will be disguised and distributed inside the passport's photo. This process will be done during the issue of the passport for the first time. Note that all the watermark requirements will be considered. The

@ 2011 http://www.ijaest.iserp.org. All rights Reserved.

ES

The system is divided into the following functional modules. 1. Compressing the details of the Passport 2. Hiding the details into the Image. 3. Comparing the images. In our project we produce an authenticated system by processing given details of the person into his/her photo or picture with minimum distortion in the picture during the process .The input data may be the first name, second name, third name and family name and passport number. The given data was first processed to respective values using the compute program.

2.1.Compressing the details of the Passport

The input data is taken and processed using a complex algorithm. This algorithm takes the string input and converts the string input into a numeric format. In the compute section we consider every string or name into a string which was then converted into numeric format by adding ascii value of each character of the string. The value for every character is taken as some integer values. For ex (a,b,c,dz)the integer values are taken as(1,2,3,4..26) together and every special character was ignored except 0 for space. In order to make the process easy we replace ascii values of the characters with random numbers (ex 1,2,3,4 .)this sum was then inserted or embeded into the photo or picture . Here an example is taken where we convert the given character paladugu deepika into integer format

T
2..METHODOLOGY

Page 49

P.Deepika* et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 7, Issue No. 1, 048 - 053

result=Integer.parseInt(val); sum=sum+i*result; where I varies from 1 to 5 Here initially sum value starts at 0 ex: paladugu deepika P a l a d u g u sum=0+1*16 sum=16+2*1 sum=18+3*12 sum=54+4*1 sum=58+1*4 sum=62+2*21 sum=104+3*7 sum=125+4*21 =16 =18 =54 =58 =62 =104 =125 =209 =213 =223 =238 = 302 =311 =333 =336

Returns: array of RGB pixels. These pixel values are now used to find the red, blue, green color combinations ,using shift function . So once when we are familiar with how to shift the bits of an integer, you can easily get the RGB values from a 24 bit hexadecimal by moving the bits to the right by a certain amount using the bitwise right shift operator (>>). For example, getting the red, green and blue values from a 24 bit integer would look like: red=(pixels[row][col]>>16)&0xFF;(since red value starts at 17 so shift right 16) green=(pixels[row][col]>>8)&0xFF;(since green value starts at 9 shift right 8) blue=(pixels[row][col])&0xFF;(since blue value starts at 0 )

2.2 Hiding the details into the Image

The compressed details are then fed to an image in such a way that they are hidden into it as a watermark.

In this method we try to embed the produced result of compute method into the image with minimum distortion. In this process first we convert the given image into pixel format and save the data in a single dimensional array by the use of method getRGB getRGB(0,0,w,h,pixel,0,w)

getRGB(int startX, int startY, int w, int h, int[] rgbArray, int offset, int scansize)

IJ
Parameters:
ISSN: 2230-7818

Returns an array of integer pixels in the default RGB color model (TYPE_INT_ARGB) and default sRGB color space, from a portion of the image data. Color conversion takes place if the default model does not match the image ColorModel. There are only 8-bits of precision for each color component in the returned data when using this method. With a specified coordinate (x, y) in the image, the ARGB pixel can be accessed in this way: pixel=rgbArray[offset+(y-startY)*scansize+(x-startX)];

startX the starting X coordinate startY - the starting Y coordinate w - width of region hheight of region rgbArray - if not null, the rgb pixels are written here offset - offset into the rgbArray scansize - scanline stride for the rgbArray

@ 2011 http://www.ijaest.iserp.org. All rights Reserved.

ES

d sum=209+1*4 e sum=213+2*5 e sum=223+3*5 p sum=238+4*16 I sum=302+1*9 K sum=311+2*11 A sum=333+3*1 Total sum=336

So we know that by shifting the bits to the right, we can effectively break an unsigned integer representing a colour into its specific components, but what about changing these components back into an RGB or ARGB value? Well, its simply a matter of shifting the bits in the other direction, using the bitwise left shift operator, which looks like this << (two less than operators next to each other). Out of these produced value we now find the highest one ,the color which need to be to replaced by data and its position. These final RGB values which are modified by the result formed at stage1 are now inserted into the pixel array of the image. In this process of inserting the values the 1 dimensional pixel array was converted to three dimensioanal pixel array uing the method convertToThreeD The convertToThreeD program uses the row *column sized pixel array into a row by column sized pixel array and the third dimension was filled by the respective alpha ,red ,geen,and blue values of that pixel in the two dimensional array.Now the data was inserted into this three dimensional array to reduce the distortions .then the three dimensional array is converted to single dimensional pixel array using the function convertToOneDim The convertToOneDim function here we convert this three dimensional array with image column by image rows by 4 into colmn * row sized single dimensional array. Now with the modified data in one dimensional pixel array we create a picture using the function setRGB public void setRGB(int startX, int startY, int w, int h, int[] rgbArray, int offset, int scansize) Sets an array of integer pixels in the default RGB color model (TYPE_INT_ARGB) and default sRGB color space, into a portion of the image data. Color conversion takes place if the default model does not match the image ColorModel. There are only 8-bits of precision for each color component in the returned

Page 50

P.Deepika* et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 7, Issue No. 1, 048 - 053

data when using this method. With a specified coordinate (x, y) in the this image, the ARGB pixel can be accessed in this way: pixel=rgbArray[offset+(y-startY)*scansize + (x-startX)]; Parameters: startX - the starting X coordinate startY - the starting Y coordinate wwidth of the region height of the region hrgbArray - the rgb pixels offset - offset into the rgbArray scansize - scanline stride for the rgbArray Thus we form an image with some passport details embeded into the image

first convert the generated picture into the pixel format and follow the procedure as we done to find the rgb values in hide function.Now both the generated rgb values generated in hide function and compare were compared with one another.if the result is not matched in both the any of the case ,it means the a perfect authentication was done.

3. Input parameters/Size of Sample Input Format:

It provides a GUI through which first name, second name, third name and family name are to be entered along with the passport number. It also takes an Image of formats like JPEG,BMP etc.

2.3.Comparing the images

The watermarked image can then be compared with another image.The result is then displaying in a window.

We assume that the first, second, third and family names of the passport are valid and are to be entered only in text format.We also assume that the passport number is of 8 characters length of which the first character is a letter and the next 7 characters are numeric

Before entering into this compare function we have two images with us.The first image provided by the user while the second one formed by embedding the data into the image.Now these images are compared by generating the defined red,green,blue values at specified locations of both images. For doing this we

IJ
Figure1:Image and text entered
ISSN: 2230-7818 @ 2011 http://www.ijaest.iserp.org. All rights Reserved. Page 51

ES

4.1The output of the system is a watermarked image. 4.2 It also produces a comparison result of the watermarked image and another image of choice

T
4.RESULTS

Size of Sample:

P.Deepika* et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 7, Issue No. 1, 048 - 053

Figure 2:Watermarked image and another image in a frame

IJ
Figure 3:Comparison result as images not matched
ISSN: 2230-7818 @ 2011 http://www.ijaest.iserp.org. All rights Reserved. Page 52

ES

P.Deepika* et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 7, Issue No. 1, 048 - 053

5.CONCLUSION
This research has suggested a new method for authentication. An invisible watermark has been suggested to authenticate the passport's holder. All the requirements for the watermark technique have been taken into account.The suggested invisible watermark has satisfied the Invisibility, undetectibility, and Security requirements. Because the proposed technique has used a small area for hiding (one pixel), so it satisfied the robustness against image compression. The security requirement is achieved by the random distribution of the watermark over the entire image, which makes the watermark detection is time consuming. To preserve the undetectibility requirement, the invisible watermark has a small capacity comparing to the image size (1/2117025) which is unnoticeable even if we use the statistical comparison for the images (before and after hiding). One additional factor has been used to make the watermark undetectable and that by changing the pixel color to be compatible with RGB color for the original image. The proposed method is secure and effective, but it works for one National State and could be used between more than two States and that by transmitting copy of the passport between them for authentication. It is possible to make the suggested method works globally and that by using a public key for each Country to hide the watermark and a private key to open it by different countries. [9].E. Martinian, G. W. Wornell, and B. Chen, Authentication with distortion criteria, IEEE Trans. Inform. Theory, vol. 51 [10].Y.Zhao, P. Campisi, and D. Kundur, Dual domain watermarking for authentication and compression of cultural heritage images, IEEE Trans. Image Process., vol. 13, no. 3, pp. 430448, Mar. 2004.

6.REFERENCES

[1] Chuhong Fei,Deepa kundur and Raymond H.kwong ,Analysis and Design of Secure water mark Based Authentication systemIEEE , vol 1 , March 2006 [2] C.-Y. Lin and S.-F. Chang, Semi-fragile watermarking for authenticating JPEG visual content in proc .SPIE ,Security and Watermarking of Multimedia Content II ,jan 2000

[3]. C. W. Wu, On the design of content-based multimedia authentication systems, IEEE Trans. Multimedia, vol. 4, Sep. 2002. [4]. P.W.Wong, A public key watermark for image verification and authentication, in Proc. IEEE Int. Conf. on Image Processing, vol. I, May 1998. [5].M. Schneider and S.-F. Chang, A robust content based digital signature for image authentication, in Proc. IEEE Int. Conf. on Image Processing, vol. 3 [6]. J. Dittmann, A. Steinmetz, and R. Steinmetz, Contentbased digital signature for motion pictures authentication and content-fragile watermarking,in Proc.IEEE Int. Conf. Multimedia Computing and Systems, vol. 2. [7].M.M.Yeung and F. Mintzer, An invisible watermarking technique for image verification, in Proc. IEEE Int. Conf. on Image Processing, vol. 2, Oct. 1997, [8].F.Alturki and R.Mersereau, Secure fragile digital watermarking technique for image authentication, in Proc. IEEE Int. Conf. on Image Processing, vol. 3, 2001

IJ
ISSN: 2230-7818

@ 2011 http://www.ijaest.iserp.org. All rights Reserved.

ES
Page 53