Professional Documents
Culture Documents
Abstract: Steganography is a means of data hiding in images for covert transmission. In recent years, Steganography
and Steganalysis are two important areas of research that involve a number of applications. These two areas of
research are important especially when reliable and secure information exchange is required. Steganography is an
art of embedding information in a cover image without causing statistically significant variations to the cover image.
Steganalysis is the technology that attempts to defeat Steganography by detecting the hidden information and
extracting. In this paper we propose an image Steganography that can verify the reliability of the information being
transmitted to the receiver. This paper is based on the comparison of the DCT and DWT method. This paper presents
a novel technique for Image steganography based on DWT, where DWT is used to transform original image (cover
image) from spatial domain to frequency domain. The experimental results show that the algorithm has a high
capacity and a good invisibility as compare to DCT. Moreover PSNR of cover image with stego-image shows the
better results in comparison with existing Steganography approaches. Also DWT method is best when we have to
increase the pay load capacity.
Index TermsSteganography, Discrete Wavelet Transform (DWT), Discrete Cosine Transform (DCT).
1. INTRODUCTION
The
growing
possibilities
of
modem
to a receiver [1].
copyright
media,
With
protection
for
digital
the
existing
communication
methods,
30
communicate
completely
Transform.
security
by
securely
in
combining
with
cryptography.
image
people.
2.
IMAGE
TECHNIQUES
STEGANOGRAPHY
representation
into
frequency
64 DCT.
Steganography:
Spatial
Domain
Based
31
figure.
Hao-tian Wu,
low
data
hiding rate
and
high
and
tested
with
four
steganalytic
algorithms.
Mamta Juneja, Parvinder Singh Sandhu [11]
represented
Robust
image
steganography
and
RSA
encryption
technique.
32
steganography
stego
algorithmSVBA
algorithm,
image.
The
embedding algorithm is
payload.
the
block
sensitivity
experiment
algorithm
results
has
efficiency,
vectors.
onMatlab7.0
balanced
capacity,
Simulation
shows
this
requires
that
the
this
on
performance
imperceptibility
Essentially
and
and compression.
B. Error Analysis:
(i) Bit Error Rate: For the successful recovery
of the hidden information the communication
3. MODEL
A. Definitions
(i)Cover image: It is defined as the original
image into which the required information is
embedded. It is also termed as carrier image. The
channel
must
be
ideal
but
for
the
real
33
block
is
compressed
through
quantization table.
Step6:Calculate LSB of each DCT coefficient.
4. ALGORITHMS OF STEGANOGRAPHY
A.DCT Based Steganography
Algorithm to embed text message:Step 1: Read cover image.
Step 2: Read secret message and convert it in
binary.
Step 3: The cover image is broken into 88 block
of pixels.
Step 4: Working from left to right, top to bottom
subtract 128 in each block of pixels.
Step 5: DCT is applied to each block.
Step
6:Each
block
is
compressed
through
quantization table.
Step 7: Calculate LSB of each DC coefficient and
replace with each bit of secret message.
Step 8: Write stego image.
34
Fig(c)
image
Fig(c)
image
35
+
Fig (b) Histogram Analysis of Original image
and Stego Image
36
DCT
(8X8)
DCT(8
X8)
DWT
PSN MS
R
E
DESER
T
37. 11.
54 45
JELLT
39. 7.5
FISH
35 4
DESER 49. 0.6
T
76 8
JELLY
DWT
49. 0.6
FISH
85 7
Table1: Simulation results
PROCES
SING
TIME
(seconds)
Capacity(
Bits)
1.95
24576
1.63
24576
1.40
524288
1.25
524288
Method
6. CONCLUSION
The Steganography is covert communication to
protect confidential information. Here we
presented a comparative study of DCT and the
DWT Methods. Both come under transform
domain analysis. Both the methods have good
imperceptibility and also Robustness against
statistical attacks. But as we know the major aim
of the Steganography is to increase the robustness
against attacks and also to increase the payload
capacity. Our proposed method increases both the
PSNR and also the capacity which is less in DCT
Method.
Reliability
and
37