My Project

VECTORISED AND SCALING APPROACH :FORHIDING DATA IN IMAGE [STEGANOGRAPHY]

GUIDED BY : Mr. K.KALIMUTHU

PROJECT MEMBERS : S.GAYATHRI

V.MADHAVAN

M.UDHAYA MOORTHI

N.SHANMUGA SUNDARAM

INTRODUCTION

Steganography is a Greek word derived from steganos,which means

Covered and graphia means writing that means covered writing.

It is a technique that allows two party to communicate with each other

with out knowing to others that the communication is actually taking place.

Here secret communication takes place by hiding the data in to a image by encryption and recovering it finally by decryption.

WHY STEGANOGRAPHY?

CONFIDENTIALITYCONFIDENTIALITY

[secured Format][secured Format]INTEGRITYINTEGRITY

[data received][data received]

UNREMOVABILITYUNREMOVABILITY

[ no loss of data][ no loss of data]

CRYPTOGRAPHYCRYPTOGRAPHY yesyes no no

yesyes

DIGITALDIGITAL

SIGNATURESIGNATURE no no yesyes nono

STEGANOGRAPHYSTEGANOGRAPHY yesyes yesyes yesyes

STEGANOGRAPHY:OVER VIEW

Cover Image

Stego systemEncoder

Message

Estimation ofMessage

Stego systemDecoder

KeyChannel

EXISTING SYSTEMS

LEAST SIGNIFICANT BITS

For hiding the data in to image LSBs are used but the main disadvantage found here is data can be hidden only in the first two bits.

WATER MARKING

For embedding a source file to an another media watermark embedding was used but the main disadvantage is it will reduce the quality of audio or image at certain level.

SPREAD SPECTRUM

Here the data is embedded by just expanding the image at the sender side due to this the main disadvantage is noise attack and loss of data at receiver side.

LIMITATIONS OF EXISTING

Not highly securable

Data loss

Difficult to extract data

Cannot Be Rotated

Cannot change the position after encryption.

PROPOSED SYSTEM

Embedding- Vector Algorithm.

High Security- Quantization.

Exhaustive search Technique - pre embedded training sequence For Locking to right shape.

Scaling and Rotation - Form the image to actual position

MODULES

Multi scale edge detection

Successive Projection

Quantization

Embedding

Data recovery

MULTISCALE EDGE DETECTION

Here in this module all the edges of the image is detected. Edges are detected by spatially correlating the estimated edges across the

various scales after decomposing the image by the wavelet transform. To identify the unwanted images wavelet transform is identified as below

Then the convolution process takes place between the filter and the wavelet transform value to avoid the redundancy.

Finally with the help of the wavelet maxima found we can identify the right edges as below.

if( Wf(u,2j) < Wf(u0,2j))

SUCCESIVE PROJECTION- VECTORISATION ALG

Here the images are just splitted to various parts by vectorisation algorithm.

The images divided into various subblocks.

we use blocks of size 8 *8.

The main purpose of this projection is selecting the initial block of the image.

Upper left edge is selected as the initial block.

This initial block is selected to identify at receiver side for any rotation operation.

QUANTIZATION

Even and odd quantization are used to represent “0” and “1,” respectively.

If the projection is quantized to an even number then this block represents “0” and if it is quantized to an odd number then it represents “1.”

Each block hides one bit in it by projecting it onto certain direction.

The receiver performs the same process to recover the hidden information.

In particular, each block is projected onto the corresponding subspace and a rounding operation is performed in order to recover the hidden bit.

EMBEDDING

Here we embed the data in to the image which is the main part of steganography.

In order to compute the embedded data rate, suppose that the image size is N*N and each 8 * 8 block hides one bit of information.

The number of bits that can be hidden = K The size of the Image = N

if(K<Image)

The data can be hided

Else

We cannot embed the data The main note is the initial block does not convey any information as it is

considered the initial subspace.

DATA RECOVERY

This is the last stage of our project where the data is recovered. It is the receiver side process and checks for the Initial block first. If the initial block is same as that of the sender side then the data can be

recovered easily with out any loss of data. If the initial position is changed then the rotation process is carried out. R=Rotation Angle.

If(R <= 5)

Data can be recovered

Else

Rotation can be processed only up to 5

Data cannot be recovered

COMPARISON BETWEEN EXISTING AND PROPOSED

Highly secured data[DATA BLOCKS]

Scaling and rotation procedure[ACTUAL IMAGE AT RECEIVER]

No need of actual image at sender and receiver[SCALABLE]

No loss of data even after many attacks such as noise as it can be scaled.

Other Methods At Receiver After Attack

Our Method After Attack

FUTURE DEVELOPMENT

Here in our project scaling in the sense just the rotation of the image

So in future one can develop our project with scaling technic.

Another development which can be made is in our project we can scale up to five degree in future one can develop by increasing the rotation angle.

CONCLUSION

Data is embedded by quantizing the projection of the 8* 8 blocks onto the eigensubspaces extracted from the image. The proposed system assumes blind detection.

THANK YOU

QUERIES????????????