International Journal of Engineering Trends and Applications (IJETA) Volume 4 Issue 2, Mar-Apr 2017
RESEARCH ARTICLE OPEN ACCESS
Comparison of Image Compression Techniques for MRI Brain
Image
N.Senthilkumaran, M. Vinodhini
Department of Computer Science and Applications
The Gandhigram Rural Institute- Deemed University, Dindigul
Tamilnadu - India
ABSTRACT
Run length encoding (RLE) is the method that allows the data compression for information in which pixels are replaced
constantly. This paper examines the performance of the RLE algorithm. To compression the image is evaluate and
compared. Medical image compression techniques irrelevance and redundancy of the image data in order to be able to
store or transmit data in an efficient form. Its useful process to save a lot of space and resources while sending images
from one place to another.
Keywords : Image compression, Run length coding, Lossless compression.
due to extensive digitization of data and increasing
I. INTRODUCTION telemedicine use. If we look inside the medical image
processing, we can see that there are many medical issues
A. Compression being treated through this processing. These issues
Compression is a method that reduces the size of files. comprise subjects related to heart, brain, lungs, kidney,
The aim of compression is to reduce the number of bits cancer diagnosis, stomach etc. An effort has been done to
that are not required to represent data and to decrease the provide effective storage of medical images with patient
transmission time. Achieve compression by encoding medical record for future use and also for effective
data and the data is decompressed to its original form by transfer between hospitals and health care centers. In the
decoding. A common compressed file extension is .sit, following, the most important medical image
.tar, .zip; which indicates different types of software used compression techniques that have been proposed are
to compress files (e.g. Fig. 1). reviewed (e.g. Fig. 2, Fig. 3,Table 1).
TABLE 1
B. Decompression RESULTS OF IMAGES COMPRESSION USING RLA AND DWT
The compressed file is firstly decompressed and then
used. There are many softwares used to decompress and Imag Original Compressio Compr TC for GC for
it depends upon which type of file is compressed. For e image size n image size ession DWT DWT
example WinZip software is used to decompress .zip file name Ratio
[1]. IMG1 1572864 1105024 1.4234 10.40 90.3891
49
IMG2 131072 84592 1.5495 2.733 63.4216
9
IMG3 998784 764416 1.3066 6.632 84.9232
7
IMG4 998784 889312 1.1231 12.30 91.8737
57
IMG5 131072 87136 1.5042 8.650 88.4403
8
Original Decompre Decompre
Fig. 1 Block Diagram of image compression image ssion ssion(DWT
image(RLC )
II. MEDICAL IMAGE COMPRESSION )
Most hospitals store medical image data in digital
form using picture archiving and communication systems
ISSN: 2393-9516 www.ijetajournal.org Page 56
International Journal of Engineering Trends and Applications (IJETA) Volume 4 Issue 2, Mar-Apr 2017
used in artificial images. Basically, it uses low bit rate. In
the Lossy compression techniques, there is the possibility
of losing some information during this process. While
lossless compression is basically preferred in medical
images and military images, owing to the lesser
possibility of loss of information. The explanation of
these methods.
C. Lossy Compression
In compression technique, accuracy is very important
in compression and decompression. There will be a
possibility of data information loss but it should be under
the limit of tolerance. It should be good enough for
application of image processing. This kind of
compression is used for sharing, transmitting or storing
multimedia data, where some loss of data or image is
allowed. JPEG is examples of lossy processing methods.
When the receiver is human eye, lossy data is allowed,
because human eye can tolerate some imperfection in
data/information. Some lossy compression techniques are
explained as follow [2].
Memory less source an information source that is
independently distributed. Namely, the value of the
current symbol does not depend on the values of the
previously appeared symbols. Instead of assuming
memory less source, Run-Length Coding (RLC) exploits
memory present in the information source. Rationale for
RLC: if the information source has the property that
symbols tend to form continuous groups, then such
symbol and the length of the group can be coded.
Fig. 2 Image compression using run length algorithm
D. Lossless Compression
Lossless compression is a class of data
compression algorithms that allows the original data to
be perfectly reconstructed from the compressed data. By
contrast, lossy compression permits reconstruction only
of an approximation of the original data, though this
usually improves compression rates (and therefore
reduces file sizes).
Lossless data compression is used in many
applications. For example, it is used in the ZIP file
format and in the GNU tool zip. It is also often used as a
component within lossy data compression technologies
Fig.3 Comparison between discrete wavelet transform (e.g. lossless mid/side joint stereo pre-processing by
and run length the LAME MP3 encoder and other loss audio encoders)
[3].
IV. OVERVIEW OF RUN LENGTH
III. TYPES OF IMAGE COMPRESSION CODING
TECHNIQUES Simplest form of lossless image compression
There are two categories of image compression i.e. technique. Fig. 4 represents long sequences of same data
lossless and lossy compression. Lossless compression is by shorter form. Long runs of redundant data are stored
ISSN: 2393-9516 www.ijetajournal.org Page 57
International Journal of Engineering Trends and Applications (IJETA) Volume 4 Issue 2, Mar-Apr 2017
as a single data value and count. Can be even more H = entropy of pixel source = mean number
efficient if the data uses only two symbols (for example 0 of bits required to encode information of this source
and 1) in its bit pattern and one symbol is more frequent The entropy of a pixel source with equally probable
than the other. Images with repeating grey values along grey values is equal to the number of bits required for
rows (or columns) can be compressed by storing "runs" coding.
of identical grey values in the format:
E. Lossless Image Compression
Grey repetition Grey repetition
value 1 value 2 In the decompression phase of lossy image
1 2
compression, the output images are almost the same as
input images. In addition, this method is useful where a
For B/W images (e.g. fax data) another run little information from each pixel is important. The
length code is used: lossless method is also called as wavelet technique. The
example of lossless compression methods are RLE,
colum column column column LZW, Entropy coding, Bhammar M.B et al,
row n# # # #
# run1 run1 run2 run2 Some of the lossless compression techniques are
begin end begin end
Run Length Encoding
0 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 Run Huffman Encoding
0 1 2 3 4 5 length LZW Coding
coding Area Coding
0 03599 Arithmetic Coding
1 11799
F. Run Length Encoding
2
3 344668
810101
Run Length Encoding (RLE) is a simplest
214 compression technique which is most commonly used.
This algorithm searches for runs of bits, bytes, or pixels
Fig. 4 Gray value of run length of the same value, and encodes the length and value of
the run. RLE achieves best results with images
V. PROBABILISTIC DATA containing large areas of contiguous colour, and
especially monochrome images (e.g. Fig. 5), For example
COMPRESSION
The string is aaaaaaaabbbbbcc would have representation
A discrete image encodes information redundantly if as (a; 8)(b; 5)(c; 3) Then compress each (char; length) as
a unit using, say, Huffman coding. Clearly, this technique
The grey values of individual pixels are not works best when the characters repeat often,
equally probable
The grey values of neighboring pixels are
correlated Information Theory provides limits
for minimal encoding of probabilistic
information sources.
Redundancy of the encoding of individual pixels with G
grey levels each:
r=bH
b = number of bits used for each pixellog2G
Fig. 5 Example of RLE
Steps of algorithm for RLE are as follows.
Step 1: Input the string.
ISSN: 2393-9516 www.ijetajournal.org Page 58
International Journal of Engineering Trends and Applications (IJETA) Volume 4 Issue 2, Mar-Apr 2017
Step 2: From first symbol or character give a unique
value. [5] P.A. van den Elsen, D.P. Evert-Jan, and M.A.
Step 3: Read the next character or symbol, if character is Viergever, Medical image matching-A review with
last in string then exit otherwise. classification, IEEE Engineering in Medicine and
A: If: next symbol is same as the previous symbol then Biology, Mar 1993, p. 26.
give same unique value as pervious.
B: Else if: next symbol is not same, than give its new [6] N.M. Nasrabadi, and R.A. King, Image coding
value that is unmatched from previous value. using vector quantization: a review, IEEE
Step 4: Read and count additional symbols Ttransactions on Communications, vol. 36, no. 8,
Step 5: Go to step 3 until a non-matching value to the not August 1988, p. 957.
same symbol from previous[4][7].
[7] L. Shen, Rangaraj, and M. Rangayyan, A
VI. CONCLUSION segmentation-based lossless image coding method
for high-resolution medical image compression,
Using the optimized run length coding to compress IEEE Transactions on Medical Imaging, vol. 16, no.
the MRI medical image has to helped greatly reduce the 3, June 1997, p. 301.
size of compressed image. This algorithm is used
transform the data or image. The image compression
techniques and it comparison between run length and
discrete wavelet transform. The future work two different
categories of compression have discussed enlarge on
advantages and disadvantages. After we have to brief
overview of some medical image compression techniques
and provided descriptive comparison between them and
the performance for image compression and the
computational complexity can be enhanced.
REFERENCES
[1] P. Gupta, G.N Purohit, and VarshaBansal, A survey
on image compression techniques, International
Journal of Advanced Research in Computer and
Communication Engineering, vol. 3, Issue 8, August
2014, p. 7762, 7764.
[2] Qamar-ul-Islam and M.B. Akhtar, Open source
algorithm for storage area and temporally optimized
run length coding for image compression technology
used in biomedical imaging, International
Conference on Open Source Systems and
Technologies (ICOSST), December 2012, p. 16.
[3] V. Bansal, P. Gupta, and S. Tomar, The
Implementation of Run Length Encoding for RGB
Image Compression, International Journal of
Advanced Research in Computer Engineering &
Technology (IJARCET), vol. 3, issue 12, December
2014, p. 4397.
[4] S.B. Gokturk, C. Tornas, B. Girod, and C. Beaulied,
Medical image compression based on region
of interest, with Application to colon ct images
2001 Proceedings of the 23rd Annual EMBS
International Conference, October 2528, Istanbul,
Turkey, Oct 2001, p. 2453.
ISSN: 2393-9516 www.ijetajournal.org Page 59
