WEL-COME TO POWER POINT

PRESENTATION
Presented by
JYOTHI R
( 1GG11EC017)

Under guidance
prof.REVANNA

Seminar co-ordinator
prof. NOORFATHIMA
CONTENTS

Introduction
Chaotic systems
The proposed system
Simulation results
Conclusion
Reference
INTRODUCTION
Steganography is the art and science of hiding secret data by
embedding them within other information.
The two most popular techniques used today to hide secret
information inside digital images are spatial
domain and transform domain.
The spatial domain technique embeds the bits of the secret
message straight to the least significant bits of the cover image.
This results in high
vulnerability to attacks such as formatting and image changes
The transform domain technique on the other hand hides
information in the significant parts of the cover
image in order to be more robust against attacks such as
filtering, cropping and lossy compression but still staying
imperceptible to the human sensitive system
 CHAOTIC SYSTEMS
The equations of chaotic systems change over time because
they are dynamical systems. These equations are either
differential equations, which are called flows, or difference
equations, which are called maps.
there are two types of chaotic systems: chaotic flows and
chaotic maps.
Some of the well-known chaotic flows are the Lorenz
system and the Rössler system
some of the well known chaotic maps are the Logistic
map,the Hénonmap and the Arnold´s cat map.
 A.Logistic Map
The logistic map is one of the popular and simplest chaotic
maps used for generating random sequences, it is a one
dimensional chaotic map. It has the following difference
Eqation:

where n is the state number, is the initial condition and r is

the control parameter. The value of should be in the
interval [0,1]. According to reference [4] the maximum
randomness is achieved when the control parameter is in
the interval
 B. Hénnon Map
The Hénon map is a two dimensional chaotic map. It
depends on two variables: and . It has the following
difference equations:


where a and b are the control parameters. In order to
generate iterations of chaotic sequence, the value of a and
b must be 1.4 and 0.3 respectively .
 C. Arnold's Cat Map
Arnold´s cat map is a two dimensional chaotic map. The pixels of
a digital image will be scrambled and the image looks noisy when
this chaotic map is applied to it. Arnold`s
cat map or as it is sometimes called Arnold´s transform has the
following equation:

where is the pixel location in the original image and is the new
pixel location in the scrambled image after Arnold´s
transformation, is the size of the image. The iteration of pixel
location in the image will result in scrambling the pixel location,
which means that the
image is encrypted using this chaotic map. Only the pixels
locations are changed not their values in this scrambling process .
THE PROPOSED SYSTEM
The proposed system hides a colored secret image of
different sizes into a color cover image of size
(512x512).The proposed system consists of two parts:
the transmitter and receiver part.
The Transmitter Part
cntd

The transmission process in the proposed system

contains many stages and algorithms in order to
achieve the main aim of steganography.
cntd
Since we are dealing with colored images, the cover and secret images are
separated to three layers at the transmitter part: red, green and blue.
Then a two level DWT is applied to each layer of the cover image and
three chaotic systems generated: ch1, ch2 and ch3.
Each layer of the secret image is embedded in the corresponding layer of
the cover image.
After the embedding process is successfully completed and all
coefficients of the secret image are embedded in the coefficients of the
cover image, an Inverse Discrete Wavelet Transform (IDWT) is applied
to each layer of the cover image: red, green and blue.
The final step is concatenating the three layers to obtain the stego image
as shown in Fig. 4. The stego image is very similar to the cover image.
The Receiver Part
The receiver cannot extract the secret information without
knowing the secret keys that have been used in the
embedding process (ch1, ch2 and ch3). By applying a two
level DWT to the stego image, the secret image is extracted
from the coefficients of the stego image using replicas of
ch1 and ch2 that were used at the transmitter side.
The resulting scrambled or encrypted image will be
decrypted using the replica of ch3.
The secret image is then
successfully extracted by the inverse processes that have
been used for embedding the secret image.
SIMULATION RESULTS
To evaluate the quality of the proposed system, many tests have
been carried out.
. First, the Mean Square Error (MSE), which represents the
difference between the cover image and the stego image, is
calculated. Then, the Peak Signal to Noise Ratio (PSNR), which
is used for measuring the quality of the stego image as
compared to the original cover image, was determined.
Another test is the correlation test which is used to compare the
similarity between the cover image and the stego image.
The final test is the Signal to Noise Ratio (SNR) test, which is
used as a measure
to determine the distortion by noise
CONCLUSIONS
In this paper, an efficient, robust and secure approach
for image steganography using DWT and chaotic
systems has been proposed. Both cover and secret
images are decomposed using DWT to increase the
invisibility of the proposed system.
 
REFERENCES

[1] S. Thakar and M. Aggarwal, "A review –steganography, "International Journal of Advanced Research in
Computer Science and Software Engineering, Vol.3, No.12, December 2013, pp.528-532.
[2] J. Ashok, Y. Raju, S. Munishankaralah and K. Srinivas, "Steganography: An overview," International
Journal of Engineering Science and Technology, Vol.2, No.10, November 2010, pp.5985- 5992.
[3] S. Atawneh, P. Sumari, "Hybrid and blind steganographic method for digital images based on DWT
and chaotic map," Journal of Communications, Vol.8, No.11, November 2013, pp.690-699.
[4] D. Bandyopadhyay, K. Dasgupta, J. Mandal and P. Dutta, "A Novel secure image steganography
method based on chaos theory in spatial domain," International Journal of Security, Privacy and Trust
Management, Vol.3, No.1, February 2014, pp.11-22.
[5] L. Jia, S. Shin and K. Yoo, "A reversible data hiding scheme using inverse embedding methods in
double-embedding strategies," IEEE International Conference on Informatics and Systems (INFOS 2010).
[6] M. Boora and M. Gambhir, "Binary text-image steganography," International Journal on Recent
Technology and Engineering, Vol.2, No.5, November 2013, pp.126-131.
[7] Z. Abdulhameed and M. Mahmood, "Steganography based on chaos and contourlet transform for
hiding multimedia data," International Journal of Electronics and Communication Engineering &
Technology, Vol.5, No.1, January 2014, pp.26-42.
[8] P. Manju and H. Rohil, "Optimized image steganography using discrete wavelet transform,"
International Journal of Recent Development in Engineering and Technology, Vol.2, No.2, February 2014,
pp.75-81.
[9] A. Mummert, S. Sara and J. Silver, "Numerical calculation of Lyapunov
exponents for three-dimensional systems of ordinary differential equations," M.Sc.
Thesis, The Graduate College of Marshall University, 2011.
[10] P. Addison, Fractals and chaos. Institute of Physics Publishing, Dirac House,
Temple Back, Bristol, UK, 1997.
[11] M. Alwa, T. El-Tobely, M. Fahmy, M. Nasr and M. Abd El-Aziz, "Fidelity and
robust digital watermarking adaptivity pixel based on medial pyramid of embedding
error gray scale images," International Journal of Computer Science and Network
Security, Vol.10, No.6,
June 2010, pp.284-314.
[12] Z. Ruimei, W. Mei, H. Boning and L. Hua, "Digital image watermarking based
on wavelet transform," Proceedings of third IEEE International Symposium on
Intelligent Information Technology Applications, 2009, pp.437-440.
[13] A. Verma, A. Nolkha, A. Singh and G. Jaiswal, "Implementation of image
steganography using 2-level DWT technique," International Journal of Computer
Science and Business Informatics, Vol.1, No.1,May 2013, pp.1-14.