MEDICAL IMAGE COMPRESSION USING A NOVEL 3D LISTLESS EMBEDDED BLOCK
PARTITIONING ALGORITHM
ABSTRACT
In this paper we present a listless variant of
modified 3D- block coding algorithm suitable for
medical image compression. A high degree of
correlation is achieved by using 3-dimensional
(3D) hybrid transform. The 3D hybrid transform is
generated by taking wavelet transform along spatial
dimension and Karhunen-Loueve transform (KLT)
along the spectral dimension. Then, the 3D
transformed coefficients are then arranged in a 1-
dimensional (1D) fashion keeping in view of
hierarchical nature of coefficient distribution
strategy. A novel listless block coding is applied on
the 1D coefficient. The algorithm encodes the
coefficients in a bit plane wise fashion that
originate from the most significant bit plane and
end at the least significant bit plane. This generates
an embedded bit stream like 3D SPIHT and 3D
SPECK. The proposed coder coined as 3D
hierarchical listless block (3D-HLCK) exhibits
compression performance significantly higher 3D
SPIHT and 3D SPECK on a wide range of bit rates
for magnetic resonance and CT-images. Like 3D
SPIHT and 3D SPECK, 3D HLCK provides rate
and resolution scalability. Further, significant
memory reduction is achieved owing to the listless
nature of 3D-HLCK.It is used in satellite and
medical applications. For simulation MATLAB
tool is employed.
INTRODUCTION:
Many advanced medical imaging
technologies like Computer Tomography (CT) and
Magnetic Resonance Imaging (MRI) are 3D images
and are important in biomedical field. They are
multiple images or sequence of images taken at
different cross section leading to very high volume
of data. Increase in volume of the data to be stored
calls for compression techniques. In medical field,
the objective of medical image compression is that
the compressed image has to be both diagnostically
lossless and less bandwidth in addition to visual
quality. For teleradiological applications, quality of
reconstructed medical images plays a crucial role in
diagnosis as well as treatment of patients. The loss
of clinical data results in compromising in the value
of medical examination of the patients.Progressive
lossy to lossless compression from a unified bit
string is highly desirable in medical imaging. Lossy
compression is tolerated as long as the required
diagnostic quality is preserved. Lossless to lossy
com-pression techniques are primarily used in
telemedicine, teleradiology and the wireless
monitoring of capsule endoscopy.
A compression technique using wavelets provides
better image quality compared to joint
photographic experts group compression (JPEG) It
also provides a rich set of features such as a
progressive in quality and resolution, the region of
interest (ROI) and optimal rate-distortion perfor-
mance with a modest increase in computational
complexity. The JPEG standard uses an 8 × 8
discrete cosine transform (DCT) and the JPEG2000
standard uses two dimensional discrete wavelet
transform (2D-DWT). The Karhunen–Loueve
transform (KLT) is an optimal method for encoding
images in the mean squared error (MSE) sense.
Fig:Block Diagram
DISCRETE WAVELET TRANSFORM
A wavelet is a waveform of the limited
duration that has a mean value of zero. Basically in
Discrete Wavelet Transform, wavelets are sampled
discretely. It has an edge over the Fourier transform
in that it captures both frequency and location
information. It provides a multi resolution
representation using a fixed set of analyzing
functions that are expansions and translations of
few functions [10].A wavelet cuts up data into
distinct frequency components and studies every
component with a resolution matched to
corresponding scale, also defined as multi
resolution analysis. The distribution value for
wavelet coefficients is usually around zero, with
very few large coefficients and this defines that
almost all information is focused in a small portion
of coefficients and therefore can be efficiently
compressed.
 A 2-D discrete wavelet transform can be
seen as a 1-dimensional wavelet technique which
transform on the rows and then a 1-dimensional
wavelet transform along the columns. The 2-D
DWT works in the straight forward manner by
introducing array transpose between the two one
dimensional DWT. The rows of the array are
refined first with only single level of
decomposition. It fundamentally divides the array
into two vertical halves, with a first half storing the
mean coefficients, while the next vertical half
stores the detailed coefficients. This process is
repeated again with columns, resulting in four sub
bands. This is two dimensional wavelet
decomposition along X and Y dimensions (i.e.
rows and columns)[6].
The maximum level of decomposition is calculated
by the nearest and lower power of 2 to the size of
the image. Thus, when we go for second level of
decomposition, the approximation coefficient in the
one-level decomposed image if further decomposed
into approximation and detailed coefficients.[7]
The more the level of decomposition, more is the
energy compaction. The DWT has two important
properties which are important for image
compression: Energy packing , Self-similarity:
Fig.3.2.3.Bands in wavelet decomposition
As shown above, this is three-level decomposition
and the level is given as superscript to the band
name and the 𝐿𝐿3 band has most of the energy
concentrated.
Karhunen-Loueve Transform (KLT):
KLT is a representation of a theoretical process as
an infinite linear combination of orthogonal
functions and a dependent transform. The
transformed image matrix consists of eigen vectors
calculated from the co-variance matrix of the input
image matrix.KLT is an optimal linear orthogonal
transform becauseof the eigenvectors matrix
derived from the covariance matrix of the data. It
also provides higher decorrelation and contraction
than remaining wavelet transforms [8]. By applying
KLT transform redundant data is removed and
highest energy of the transformed band is allocated
to its biggest Eigen vectors of covariance matrix.
Eigen values give a degree of how energy of a
transform is distributed, and so indicates how well
the energy of the transformed signal will be
redistributed in the transform. It is mostly used
algorithm for image compression.
The KLT minimizes the theoretical bound
on bit rate as given by the signal entropy. The use
of eigenvectors as the basis vectors ensures that the
variance of the first coefficient is maximized, and
subject to the ortho normality of basic vectors, all
subsequent coefficient variances are maximized in
order. Maximizing each variance defines the
product of all the variances is minimized because
the energy preserving nature of any orthonormal
transformation. Since the total differential entropy
for the blocks increases with the product of the
variances, the KLT minimizes the entropy there by
minimizing the bound on the bit rate.
ALGORITHM
1. Read an image and convert into matrix
2. Find mean matrix of image matrix
1
Mj = ∑𝑁−1
𝑖=0 𝑋 [i][j] J=0….L-1
𝑁
3. Find co-varience matrix using equation
Cx = E[(x − m)(x − m)T
the covariance matrix can be estimated from n data
samples as
1 𝑛
[C]x = ∑𝑖=1 xiT xi
𝑁
4. 4.In the next step Eigen vectors are
calculated
[C]x 𝑊𝑖 = wi λi (3.1.2.4)
The eigenvectors of the KLT form a nonsingular
matrix and can be factorized as A = PLUS where L
and S are lower Triangular Elementary Reversible
Matrices (TERM), U is upper TERM, and P is a
reversible permutation matrix. P defines the row
interchanges to guarantee diagonal elements that an example of 2 planes with 2 level decomposition
are not zero. is shown.

5. The vector A is formed by using Eigen

vectors
6. By applying K-L Transform

Y=A(X-ux)

Then, Eigen vectors are computed the

next step is to order them by Eigen values, highest
to lowest. It gives you the components in the order
of significance. If applying the ordered Eigen
vectors to the image, two essential features are
presented in the spectral dimension they are the
decor-related spectral data, and the energy
contraction. In order to attain the near lossless
compression, the reversible KLT is utilized because
it is able to map pixel values.[9] Fig 4.4 One Dimensional Arrangement

3-D LISTLESS EMBEDDED BLOCK

PARTITIONING

The coefficient is accessed using linear indexing

scheme. Two type of marker state table is used.
These are: (i) Dynamic marker table, (ii) Constant
marker table. Dynamic markers updates their
values indicate partitioning. [3] The partitioning
can be Octal (8), Tri (3) or Quad (4). Octa Fig3.3.2 The one to one correspondence between
partitioning takes place while the search for MV [k] values and coefficient values X(k). For
significant coefficient in a composite wavelet level. k=0,1,2,.....
Tri partitioning takes place while search for
significant coefficient in a wavelet level. Quad
partitioning takes place if a coefficient is found
significant in a wavelet sub band of sub block
inside a sub band.
Constant marker table is only used for skipping
large cluster of areas, e.g., entire composite
level/wavelet sub band. The length of the dynamic
marker table is same as that of image array length.
If each marker in the dynamic state table is 4 bit,
then the memory consume I/4 bits for holding the
state table. There are only 3 fixed markers per
wavelet sub band. For 5 levels 15*3=45 markers in
the constant marker table. The values of markers
depend on the image size and level of
decompositions. The lowest marker value is log2N
− L + 1 and final value is log2N + 1. [4]. The
coefficients in each slice undergo Z-scanning
which maps two dimension to one dimension Fig.3.3.3 Partitioning of (a)Combined coarsest
One Dimensional Arrangement sub band (b) Combined wavelet level

Now, the z-scanned coefficients are arranged in a

one-Dimensional arrangement. In the figure below,
The Pseudo code of 3D-HLCK Algorithm 30: Test the significance of single pyramid
Pass1: Insignificant pixel pass level, send output (’d’)
1: Initialize k=0, k ≤ I 31: if d==‘1’ then
2: if M V [k] ← SIP then 32: TriSplit()
3: output(d = val[k] AN D s) 33: else
4: if d == ‘1′ then Move to the next pyramid level
5: send output(sign[k]) 34: end if
6: M V [k] ← SNP 35: else if (M V [k] =6 M F [k])&(M V [k] =6
7: else SIP ) then
move to next pixel 36: Test the significance of a subband, send
8: end if output (’d’)
9: else 37: if d==‘1’ then
go to insignificant set pass 38: QuadSplit()
10: end if 39: else
Move to the next subband
Pass2: Insignificant set pass 40: end if
41: end if
1: if k ∈ Coarsest level then 42: end if
2: if (M F [k] = M V [k])&(M V [k] =6 SIP )
then
3: Test significance of combined coarsest Pass3: Refinement pass
level, send output(’d’)
4: if d==’1’ then 1: if M V [k] ← SSP then
5: OctalSplit( ) 2: send output(d=val[k] AND s)
6: else 3: move past the pixel
Move past combined coarsest level 4: else if M V [k] ← SN P then
7: end if 5: M V [k] ← SSP
8: else if (M V [k] = M F [k] − 1)&(M V [k] =6 6: move past the pixel
SIP ) then 7: else if check all the steps of insignificant set
9: Test significance of single subband level, pass then
send output(’d’) 8: skip the block/set
10: if d==’1’ then 9: else
11: TriSplit( ) 10: skip pixel
12: else 11: end if
Move past the next subband level
13: end if 4.2 IMPLEMENTATION
14: else if (M V [k] =6 M F [k])&(M V [k] =6
SIP ) then 4.2.1 At the encoder
15: Test significance of a single subband,
send output (’d’)  A symmetric medical image of multiple
16: if d==’1’ then planes is taken and read as a matrix in
17: QuadSplit()
MATLAB.
18: else
Move to the next subband  Five level Discrete Wavelet Transform
19: end if (DWT) is applied for individual planes.
20: end if The type of wavelet used is Cohen
21: else Daubechies Feauveau (CDF) with 9 low
22: K € coarsest level pass coefficients and 7 high pass
23: if (M F [k] = M V [k])&(M V [k] =6 SIP ) coefficients.
then
 Now, the resultant image is permuted such
24: Test the significance of combined pyramid
level, send output (’d’) that the columns become rows, planes
25: if d==’1’ then become columns and rows become planes.
26: OctaSplit() This can be interpreted as [X Y Z]
27: else becoming [Y Z X].
Move to the next combined pyramid  Karhunen-Loueve Transform (KLT) is
level
performed for each of the plane containing
28: end if
29: else if (M V [k] = M F [k] − 1)&(M V [k] =6 Y and Z coefficients.
SIP ) then
  Coefficients of each plane are subjected to
Z-scanning.
 Now, the coarsest band coefficients (LL)
of all the planes are arranged in a 1-D
manner. Then, the LH, HL, HH sub bands
of each plane at a wavelet level are
combined and added. Thus, all the
Coefficients are arranged in a 1-
Dimesional string.
 Now, bit rate is fixed and the 3-D listless
block partitioning algorithm is applied
differentiating the significant coefficients
from insignificant in each bit plane
resulting in a binary string which is
feasible for transmission.

4.2.2 at the decoder

 From the bit string, the decimal values are

retrieved for each bit plane and using the
bit string obtained from refinement pass at
the encoder, the original coefficient values
are retrieved.
 The 1-D string obtained is rearranged into
a 3-D matrix and reverse Z-Scanning is
performed.
 Now, inverse KLT and inverse DWT are
performed respectively resulting in the
retrieval of the original image.
 Mean Square Error is calculated between
(a)
the retrieved and the original image for
(b)
each plane.
 Further, Peak Signal to Noise Ratio
(PSNR) is calculated for each plane and
they are compared with those obtained
from image compression using Set
Partitioning In Hierararchial Trees
(SPIHT).
 The PSNR values of the proposed
algorithm and those of SPIHT are plotted
for different bit rate values and studied.

RESULTS:

(c)
(d)
Fig 5.1.2 PSNR Vs Slice number for bit rate= (a)
0.25 (b) 0.5 (c) 1.0 (d) 2.0
5.2 DISCUSSIONS
The comparison of performance (psnr vs. slice no.)
for keeping bit rate constant is shown in Figures
4.1.2 (a),(b),(c),(d). It is observed that the proposed
3D HLCK algorithm exhibit PSNR improvement
between 0.1-0.4 dB for 0.25-2.0 bpp. The
significant PSNR improvement is because of
following reasons:
(i) 3D DWT used in 3D SPIHT where as
Hybrid transform (2D DWT+KLT) is
used by 3D HLCK.
(ii) Efficient coding (both inter and intra)
of large clusters of zeros by 3D
HLCK.
(iii) Efficient arrangement of coefficients
among different sub bands of slices.
The proposed 3D HLCK will occupy a fixed
memory irrespective of the number of bit plane
passes because the number of state table markers is
fixed. Partitioning takes place by updating the
marker values. Each marker holds maximum 4 bit.
However, in 3D SPIHT the linked lists (LIP, LIS
and LSP) add/remove/move additional nodes for
every bit plane pass. Therefore, memory grows
exponentially. Like 3D SPIHT both rate and
resolution scalability is achieved in 3D HLCK. Due
to recent advancement of memory technology, the
cost of memory is reducing. Though memory
saving is not an issue for most of the applications,
applications such as progressive transmission of
DICOM (digital imaging and communications in
medicine), lossless archrivals, telemedicine etc. 3D
HLCK can be a better candidate over 3D SPIHT.
Further reduction of complexity can be achieved by
using Fractional wavelet transforms (FrWT)[11]
The drawback of 3D HLCK is that the encoding
and decoding times are more than that of 3D
SPIHT. The program for 3D HLCK can be
optimized to reduce the encoding and decoding
times. Mathematically, the computational
complexity of 3D HLCK will be O (N) operation,
whereas 3D SPHIT has O(N log N) operation[12]
A new 3D coder called 3D HLCK is proposed in
this thesis. Owing to the listless nature, significant
memory reduction over 97% is achieved compared
to 3D SPIHT; because, 8KB of memory in 3D
HLCK opposed to 324KB of memory in 3D
SPIHT. 3-D HLCK have features like rate and
resolution scalability. In MRI images, PSNR
improvement of 0.1-0.4 dB is also achieved
compared to 3D SPIHT. Therefore, the proposed
coder can used in applications such as
telemedicine, DICOM etc. The future research
direction is to incorporate additional features such
as region of interest coding, random access coding,
and 3D video coding in 3D HLCK.
REFERENCES:
1. Santa-cruz D., Grosbois R.,Ebrahimi T.,
JPEG 2000 performance evaluation and
assessment, Signal Process. Image
Commun., 17, pp. 113-130, 2000.
2. Shapiro, J. M., ‘Embedded image coding
using zero trees of wavelet coefficients’,
IEEE Transactions on signal processing,
41(12), pp. 3445-3462, 1993.
3. Said, A., Pearlman, W. A., ‘A new fast Circuits and Systems for Video
and efficient image codec based on set Technology’, vol.16, issue 6, pp. 762-770,
partitioning in hierarchical trees’, IEEE June 2005.
Transactions on circuits and systems for 14. Kai-jen Cheng, and Jeffrey Dill, Lossless
video technology, 6, pp. 243-250, 1996. to Lossy Dual-Tree BEZW Compression
4. Servetto, S., Ramchandran, K., Orchard, for Hyperspectral Images, IEEE
M. T., ‘Image coding based on Transactions On Geoscience And Remote
morphological representation of wavelet Sensing, Vol. 52, No. 9, September 2014
data’, IEEE Transactions on image
processing, 8, pp. 1161-1174, 1999.
5. Wheeler, F., Pearlman, W. A., ‘SPIHT
image compression without lists’, IEEE
International conference on Acoustics,
Speech and Signal processing (ICASSP),
4, pp.2047-2050, 2000.
6. Latte, M., Ayachit, N., Deshpande, D.,
‘Reduced memory listless SPECK image
compression’, Elsevier Science, Digital
Signal Processing, 16, pp. 817-824, 2006.
7. Moinuddin, A. A., Khan, E., and
Ghanbari, M., ‘Efficient algorithm for
very low bit rate embedded image coding’,
IET image processing, 2(2), pp. 59-71,
2008.
8. Kim, B. J., Xiong, Z., and Pearlman,
W.A., ‘Low bit-rate scalable video coding
with 3-D set partitioning in hierarchical
trees (3-D SPIHT)’, IEEE Trans. Circuits
Sys. Video Tech., vol. 10, pp. 1374-1387,
2000.
9. Moinuddin, A. A., Khan, E., and
Ghanbari, M., ‘Low Complexity, efficient
and embedded color image coding
technique,’ IEEE Trans. on Consumer
Electronics, vol. 54, pp.787-794, 2008.
10. Sweldens, W., ‘The Lifting Scheme: a
new philosophy in biorthogonal wavelet
constructions’ Wavelet applications in
signal and image processing III, Proc.
SPIE 2569,pp. 68-79, 1995.
11. Daubechics, I., Sweldens, W., ‘Factoring
wavelet transforms into lifting steps’ J. of
Fourier Anal. Appl.’ vol. 4, pp. 267-345,
1998.
12. Antonini, M., Barlaud, M. M., Mathieu,
P., Daubechies, I., ‘Image coding using
wavelet transform’, IEEE Trans. on Image
Processing, vol. 1, pp. 205-220, 1992.

13. Xie, G., Shen, H., ‘Highly scalable, Low-

complexity image coding using zero block
of wavelet coefficients’, IEEE Trans. on