m





 m
 






m
m 


i Introduction of Steganography
i Different types
i Image stegnography
i Stegnography system
i Data hiding properties
i Previous methods & its drawbacks
i Adaptive LSB substitution method
i Experimental results
i Applications
i Conclusion
i 
 covered from the Greek ³stegos´

i 
 ! writing from the Greek ³graphia

i Art and Science of hiding information such that its presence

cannot be detected and a communication is happening .

i Hiding one information in other information.

 


 

   

 

 

 

     
i It is the most widely used medium.

i This field is expected to continually grow as computer

graphics power also grows.

i Many programs are available to apply Steganography.

i Data Payload (Embedding capacityÔ

i Imperceptibility
 




i 
  
0
In this method the LSB of the cover image is directly replaced
by the secret bit to get a stego image.

i —
   "
Modifies the LSBs of the cover image for data hiding

i #$ 

"
It provides good imperceptibility by calculating the difference
of two consecutive pixels to determine the depth of the
embedded bits .
i Some simple LSB approaches equally change the LSBs of all
the pixels & have poor visible quality of the stego image.

i Cannot obtain good imperceptibility.

i Some data hiding methods follow the principle that the edge
area can tolerate more changes than smooth areas. This does
not differentiate the texture features from edge ones.

i Having the low data hiding capacity.

i The stego image has low quality when equally changing LSBs
of all pixels, to overcome this the HVS masking characteristics
& OPAP techniques are used.

i This method avoid abrupt changes in the image edge areas

during data embedding procedure.

i It can embed a large number of secrete data while achieving

high quality of stego image.
i Let I be the original 256-level grayscale image of size m*n
represented as

i W be the t-bit secret data represented as

W= {w (i) | 0 ” i < t, w (i) ¼ {0,1}}

iStep 10
Extract the highest r (say r= 3) bits of the original image I to
get the residual image Ir
where 1” r ” 6

iStep 20
Calculate the adaptive number k(i, j) of LSBs of each pixel
in the original cover-image based on the residual image Ir .
i The bit depth k¶ (i, j) can be obtained by formula0

Where
1” r ” 6, r represent the highest bits number of each pixel
used to calculate the hiding capacity in each pixel.
& 1 ” k¶ (i, j) ” 7- r
i k(i, j) obtained by applying histogram equalization to the bit
depth k¶(i, j).
 $% 


i Step 30
Generate a pseudo random sequence P with number 0 and
1 by a secret key defined as
P ={ p(i) |0 ” i < t, p(i) ¼ {0,1}}

Applying the element-wise XOR operation of the original

secret messages W and the pseudo random sequence P
represented as

W×= {w× (i) |w× (i) = w (i) p (i), 0 ” i D t}

i Step 40
or the (i, j) th pixel of original image I, k (i, j) bits binary
secret data are read from the ultimate secret data w× one by
one denoted as b (i, j), and then transform the binary number
b into Its decimal value d (i, j).
or example, assume b (i, j) = 1001(2), then d (i, j) =9.

i Step 50
Hide k(i, j) bits binary secret data b (i, j) into the cover-
image I by replacing the k(i, j) LSBs of the pixel value x (i, j)
with the integer d (i, j).
i Step 60
OPAP used for reduce the hiding error.
į(i, j) = x¶ (i, j) ± x (i, j)
Let į (i, j) be the hiding error between x (i,j) and x¶ (i, j)
 $
&


i Step 10
Extract the highest r (say r= 3) bits of the final stego-image S
to get the residual image Sr, note that Sr is the same as Ir since
data hiding is not applied to the highest r bits of each pixel.

i Step 20
Calculate the adaptive number k(i, j) of LSBs of each pixel in
the stego -image based on the residual image Sr .
i Step 30
Extract k(i, j) LSBs of the (i, j) th pixel value x´ (i, j) of
stego-image S directly. Let d¶ (i, j) denote the extracted secret
data.

i Step 40
Repeat Step 1-3 until all secret data W¶ is obtained.
inally, the final secret messages W´ can be obtained

W´ = {w´(i) |w´(i) = w¶(i) p(i) ,0 ” i t}

Cover image
Stego image
Embedded data are 757332 bits.
(r=4)

Difference between cover & stego image

 à



 
Õ  
à

r
 r  
   rr   

    rr  

  
r
  

r 
r
r  

 r  r
r r

Table0 The average hiding capacity and PSNR values of the

proposed method with r=1-6, for image size 512 * 512
i Smart IDs.

i Companies¶ secret data safe circulation.

i Banking application.

i Military Application.
i We have proposed a novel Steganographic method
by using human visual system (HVS) and LSB substitution,
This method avoid abrupt changes in the image edge areas
during data embedding procedure.

i This method improves the quality of the stego image

i The proposed method achieves higher embedding capacity and

imperceptibility.
i CHIN-CHEN CHANG, MIN-HUI LIN, YU-CHEN HU ³A fast and secure image
hiding scheme based on LSB substitution´. International Journal of Pattern
Recognition and Artificial Intelligence, 2002, vol. 16, no. 4, p. 399-416.

i JEN-CHANG LIU, MING-HONG SHIH ³Generalizations of pixel value

differencing steganography for data hiding in images.´ undamenta Informaticae,
2008, vol. 83, no. 3, p. 319-335.

i CHENG-HSING YANG, CHI-YAO WENG, SHIUH-JENG WANG, HUNG-MIN

SUN ³Adaptive data hiding in edge areas of images with spatial LSB domain
systems´. IEEE Transactions on Information orensics and Security, 2008, 2008,
vol. 3, no. 3, p. 488-497.
—