Wavelet Cryptography Using

SPIHT Algorithm

Presented By
Arun Unnikrishnan T 07409006
R Nandakumar 07409019
Vysakh G Pillai 07409032
What Is Cryptography and SPIHT

 Cryptography Is the practice of hiding

information in manner that it cannot be
deciphered.
 SPIHT stands for Set Partitioning In
Hierarchical Tree. It is basically a compression
scheme in which we establish parent child
relationship for wavelet packages.
 Wavelet Packages represent a generalized
form which adapts a transformation that is
best suited for a particular image
 SPIHT

 It is using a tree structure called SOT(spatial

orientation tree).
 In SOTree each node of the tree corresponds
to a pixel.
 Wavelet transform is applied
 There are levels of decomposition HH HL LH
LL where H stands for High and L for Low LL
will be merely a approximation of the image
Further Decomposition is possible for the
image resulting in a pyrimidical tree form
Wavelet Transfromation of Images
MODULAR APPROACH
1.COMPRESSION

 Compression : It is done while keeping

computational load reasonably low so we
need 2 entities
 A criterion for basic comparison
 A algorithm that finds best basis from set of
all possible bases.
Parent child relations are transformed
across sub bands using the algorithm
MODULAR APPROACH
2.Cryptology

 Encoding is Done by QCCSPITH encoder

which is defined in the SPITH Algorithm itself.
It is done in a bitplane .
 Coding of wavelet coefficients is done using
SO Tree structure. The output from SPITH
encoder is embedded as the buffer Image.
.

 Decoding it is done by the QCCSPITH

decoder which is also defined in the SPITH
algorithm
 The input bitstream is the buffer/embedded
image and it is returned to its higher quality
and non compressed state by the decoder
and its output is the output that is the
decrypted and uncompressed image.
 FUTURE ENHANCEMENTS

 The SPIHT algorithm can be modified to the

newer version d-SPIHT (dynamic SPIHT) in
which replaces SOTrees with REcon (rational
embedded coder trees) which has lesser
constraints.
 Image Compression could be applied to vidios
which is nothing but a stream of images with
audio.