Vectorised and Scaling Approach:For Hiding Data in Image (Steganography)
Vectorised and Scaling Approach:For Hiding Data in Image (Steganography)
:FOR
HIDING DATA IN IMAGE [STEGANOGRAPHY]
DIGITAL yes no
no
SIGNATURE
Cover Image
Channel
Key
Stego system
Estimation of
Decoder
Message
EXISTING SYSTEMS
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
Data loss
Cannot Be Rotated
Successive Projection
Quantization
Embedding
Data recovery
MULTISCALE EDGE DETECTION
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
The main purpose of this projection is selecting the initial block of the
image.
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.
The receiver performs the same process to recover the hidden information.
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
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.