Lossy Medical Image Compression

Using Huffman Coding and Singular

Value Decomposition

Guided by : Dr. SHANKARAIAH

Presented by
-Manu p
-Saima Irfan
-Vikas hallikeri
-M Pawan kumar
 INTRODUCTION
 Day-today With the enormous amount of digital images generated by medical applications such as CT,
MRI, PET and X-Ray there is a need to employ efficient image compression techniques in order to save
on cost of storage and time of transmission of these images.

 In this research work, we propose a new lossy compression technique by using singular value
decomposition (SVD) followed by Huffman coding.

 The input medical image is first compressed using the SVD technique which is actually a quantization
technique. Then Huffinan coding is carried out to further compression of the image

 The proposed technique is tested on several medical images The obtained results were also compared with
those of conventional techniques like JPEG2000.

 The quantitative and visual results are showing the superiority of the proposed compression technique over
the conventional compression technique.
IMAGE COMPRESSION
 Image compression deals with reducing the number of bits needed to
represent an image by removing redundant data.
 Image compression is broadly cassified into two categories

1)lossless Image compression : original image can be recovered perfectly

from the compressed image.

2)lossy Image compression :original image cannot be recovered from the

compressed image as some noise is deliberately introduced to encode the
image.
Why SVD and HUFFMAN
coding???
 Conventional image compression like JPEG2000 is based on the discrete
wavelet transform which refers to the partitioning of the original image
into rectangular non-overlapping blocks.
 So JPEG2000 may not be suitable for all applications as it involves many
complicated procedures.
 The SVD is simple algorithm which uses a smaller rank to approximate
the matrix representing an image.
 Huffman coding is based on the frequency of occurrence of symbols and it
uses shorter binary symbols to represent code-words which appear
frequently.
 Combing these two new medical image compression technique is
proposed in which it uses SVD and Huffman coding..
Singular Value
Decomposition
 An image is actually a matrix of numbers whose elements are the
intensity value of corresponding pixels of the image.
 Singular value decomposition is used in order to decompose a
given matrix into three matrices.

 The number of non-zero elements on the diagonal of determines

the rank of the input matrix.
 Compression is done by using a smaller rank obtained by
eliminating small singular values
Huffman coding
 The Huffman coding is a lossless image compression technique. lt uses
'variable length coding', which means that symbols in the data are
converted to binary symbols based on how often each symbol occurs.
 The character with the highest probability is represented by a shorter binary
symbol.
THE PROPOSED LOSSY IMAGE COMPRESSTON
TECHNIQUE
 SVD based compression is lossy due to the nature of the process .However
the qualitative loss is not psychovisually noticeable up to some point for
the human eye.
 The proposed compression technique is benefiting from cascading SVD
based compression followed by Huffman based compression

Block Diagram
EXPERIMENTAL RESULTS
 Table below is showing the quantitative comparison between the proposed
techniques and JPEG2000 by use of PSNR for compression ratio of 60:1
 Peak signal-to-noise ratio is the ratio between the maximum possible
power of a signal and the power of corrupting noise that affects the fidelity
of its representation.
 The quantitative and visual results were showing the superiority of the
proposed compression technique over JPEG2000.