Image Data Encryption and Hiding based on Wavelet Packet Transform and Bit Planes Decomposition

By: Nikhil Jain Sachin Kumar Singh

Powerpoint Templates

Page 1

Introduction
Steganography :
A type of Hidden Communication the literally means covered writing. Here our goal is to hide an information message (c/a payload image) inside an harmless cover medium (c/a cover image) so that it is not possible to detect that there is a ssecret message. This technique is widely used for transmitting secret image codes in millitary application and secret services. In transform domain method, image hiding is realized by means of embedding or superimposing a the secret data on transform domain coefficients of the carrier image.

Commonly used transforms are DFT, DCT, and DWT.

Powerpoint Templates

Page 2

Definitions:
Cover Image: It is the original image into which the required secret message is embedded. Pay Load Image: It is the secret message that has to be embedded in the cover image. Sterio Image: It is the final image after embedded the payload into a given cover image.

Wavelet Transform: The wavelet transform is obtained by repetative filtering of the coefficients of the image row by row and col by col.
Inverse Wavelet Transform: It is applied over the sterio image to convert it from frequency domain to spatial domain.

Powerpoint Templates

Page 3

Wavelet Packet Data Decomposition of Carrier Image

Original Carrier Image Wavelet Packet Decomposition

Powerpoint Templates

Page 4

Wavelet Packet Decomposition

CA(j+1) approx.

Wavelet Packet Decomposition

CD (j+1) Horizontal

Wavelet Packet Decomposition Wavelet Packet Decomposition Wavelet Packet Decomposition

CD (j+1) Vertical

CD (j+1) Diognal

Powerpoint Templates

Page 5

Wavelet Packet Data Decomposition

Powerpoint Templates

Page 6

 Computation of Entropy of the sub band images of high frequency.

Since the most important visual information is contained in sub-band images of low frequency, so this visual information should not be modified to maintain the same fidelity the original image and encrypted image.
Compute entropy of the sub band images of high frequency

Arrange the Sub images in decreasing sequence of entropy values

Powerpoint Templates

Page 7

Encrypting of Secret Image

Chaotic Sequence: Arnold Cat Map

It is a special type of Chaotic Map which ca be represented by the the matrix as below:

Powerpoint Templates

Page 8

 And (Xn+1,Yn+1) are the transformed position after cat map. a and b are control positions are control parameters and positive integers.

The most important property of Arnold cat map is that it rearranges the position of image pixel, but after iterating a certain numbers it returns the same pixel position as before and thereby produces the original image.

By varying the size of the image and control parameters a and b, the image can be recovered after a certain number of iterations. So, the size of the image and control parameters of Arnold cat map serve as the keys for image encryption.

Powerpoint Templates

Page 9

B7 : High Bit Plane B0 : Low Bit Plane

Now we need to superimpose separately the bit plane images on the appropriate sub band images. The final resulting image will be the final transmitted image.

Powerpoint Templates

Page 10

Powerpoint Templates

Page 11

Conclusion:
Through this paper, we have discussed an image encryption algorithm based on chaotic map/arnold map.
Through the above theoretical analysis and experimental demonstrations, it is clear that the presented algorithm has high efficiency and strong satisfied security and can be used for various applications.

Thank You

Powerpoint Templates

Page 12