New Efficient Fractal based Compression Method
for Electrocardiogram Signals
A.Khalaj and H. Miar Naimi
Electrical and Computer Engineering Faculty,Babol university of Technology
P.B.O: 484, Telfax: +98-111-3239214
E_mail:h_miare@nit.ac.ir,alikhalaj2006@gmail.com
Abstract- In this paper a new efficient fractal based
compression algorithm is proposed for electrocardiogram
signals. The self-similarities in the ECG signals make
them suitable to be compressed efficiently using fractal
based methods. In the proposed method, as in the basic
fractal based compression method, each part of the signal
is mapped to another part with a reasonable error. The
transformed maps are then stored instead of the original
signal samples. The signal is built up using these
transforms in an iterative process using an arbitrary
initial signal. Here, the morphological information of
ECG is incorporated to improve the compression
algorithm in Compression Ratio, PRD and CC. As a
novel point and in contrary to other methods there is no
need to detect ECG complexes, this makes the algorithm
more robust and accurate. The fixed size of blocks with
rotated transformed blocks and optimal coefficients for
the maximum similarity between blocks are employed.
The proposed algorithm was tested on a reasonable set of
MIT-BIH database signals. The experiments all showed
that the proposed algorithm outperforms all reported
Fractal-Based methods.
Keywords: Data Compression, Electrocardiogram Signal,
Fractals.
1. Introduction
Electrocardiogram is one of the most important biological
signal representing muscular activities of the heart and
vessels. This signal is recorded by contacting two or more
electrodes on the human body, detecting electrical potentials
resulting from body heart breathing. ECG exhibits special
complexes named P,Q,R,S,T wavelets. Because of the close
relationship between the shape of the signal and systematic
operation of organs, such as heart and vessels, several
syndromes affect the shape of the ECG . This fact lends itself
to the significance of the processing and storing of the ECG
signals. To ensure the accuracy of ECG signal recordings
they are generally digitized in high resolutions. The large
amount of recorded data results in problems such as storage
space and bandwidth limitations. Thus, the necessity of
efficient compression schemes is readily understood. The
main goal of any compression technique is to achieve
maximum data volume reduction while preserving the
significant signal morphological features. A broad spectrum
978-1-4244-3508-1/09/$25.00 ©2009 IEEE
Authorized licensed use limited to: Univ Rey Juan Carlos. Downloaded on April 07,2010 at 11:48:41 EDT from IEEE Xplore. Restrictions apply.
of research has been performed to find evermore algorithms
for compressing the ECG.[1] which can be classified into
three main categories:
a) Direct Data Compression: for this class we can address
the following methods: Turning Point (TP) method [2], Time
Epoch Coding (AZTEC) method [3], Encoding System
(CORTES) method [4], delta coding algorithm [5], Sample
Skipping SLOPE the scan-along polygonal approximation
(SAPA) [6], (DPCM) [7] and entropy coding [8].
b)Transform based Methods like Fourier Transform (FT)
[9], Karhunen–Loeve transform (KLT) [10], Wavelet
Transform (WT) [11], Wavelet Packet-Based Transform
(WPT) [12], SPHIT[13],JPEG2000[14].
c)Parameter Extraction Techniques like syntactic methods,
linear prediction methods [15] and neural networks methods.
Direct compression and transform-based methods contain
actual and transformed data respectively. Whereby, the
original data are reconstructed by an inversed process. The
direct data compressors are based on the detection of
redundancies within the original signal using direct analysis.
In contrast, transformation compression methods mainly
utilize spectral and energy distribution analysis for detecting
redundancies. Parameter extraction methods are irreversible
processes with which a particular characteristics or
parameters of the signal is extracted.
2. Electrocardiogram Signals
The theory of chaos represents that in any irregularity there
is a regularity. There are many similarities among different
parts of ECG signals, on the basis of quasi-periodicity,
making it suitable to be compressed by fractal based methods.
Fractal based methods have received a great deal of
attention, because they are capable of producing complicated
and various functions with as little as few maps. In addition,
these methods are able to produce structures with non integer
dimension. Since Fractal based methods can model
complicated functions with only a few maps.,an active area
of research is the inverse problem i.e., determination of the
map parameters needed to model a given function. It is
hoped that if the inverse problem is solved then this theory
could be used to model arbitrary functions and achieve high
compression ratios.
3. Fractal Structures
983
As we know fractals are inherently self-similar structures
where there is a set of transforms map it to its different parts.
It was shown that the mentioned transforms can represent
fractals so that having the transforms; one can rebuild the
original fractal in an Iterative Function System (IFS), with an
arbitrary start structure [16].
Assume X is a fractal and T is the transform describing it,
based on discussion above. Equation(1) holds:
T(X)=X (1)
As (2) shows, X is the fixed point of T, being mapped on
itself under T. We say that fractal X is self similar. Having
only T, we can rebuild X using following recursive equation
shown in (2).
Ref. [17] introduced mathematical proof for convergence
of (2) and showed that after enough number of iterations X(n)
converges to X; the fixed point of T.
X (0 ) = X 0 a n a rb itra ry in itia l in p u t
(2)
X ( n + 1) = T ( X ( n )) n = 0,1, 2, ...
Regarding to above algorithm, we can store and rebuild the
initial structure having only the related transforms and gain a
high compression ratio. Here performing the iterations
infinitely, we can rebuild the initial fractal without any error.
This is the base of fractal compression methods. To apply
this method to data sets such as images and one dimensional
data, we must note that these types of data are not fully self-
similar. A solution here is to exploit the similarities among
different parts of the data. So we compute a set of transforms
that map different parts of the data. Since in natural data,
different parts are not fully similar, the fractal compression is
not a lossless compression methods.
4. The proposed method
To introduce the proposed method we start looking at
figure.1 as a typical one dimensional signal. Considering
samples in figure.1, the similarity among different parts is
evident. As the traditional fractal compression method, we
segment the ECG into equal length non-overlapped parts
named range blocks(Rs) and for each we search for block of
signal ,domain block(Ds), that can be transformed to it with
minimum error. The transform along with the address of
related domain block is saved for each range block.
Figure.1. Range (Ri) and Domain (Di) blocks.
As shown in figure.1 the domain block DK+2 is mapped to
range block R2 under T2 and …. Usually the length of
domain blocks is twice of ranges. So to map to range blocks,
domain blocks should be down sampled. Performing this
step makes their length equal to n .The larger length of
984
Authorized licensed use limited to: Univ Rey Juan Carlos. Downloaded on April 07,2010 at 11:48:41 EDT from IEEE Xplore. Restrictions apply.
domain block provides more chance for finding
transforms with smaller error. Consider a range block of
size n and a domain block of size 2n. Now the aim is
finding a transform to map these two blocks with
minimum error. The distance between the transformed
domain block and the range blocks is the objective
function that should be minimized.
The mapping is performed between the two blocks after
omitting their mean. Thus the mean of range block should
directly be stored.
Assume that R is the range and D is the domain block.
For the optimal mapping we find a real number k, which
minimizes the following distance function:
n 2
E ( D, R) = ∑ ( Ri − kDi ) (3)
i =1
Differentiating on k yields:
n
∑ Di Ri
dE n
= 0 ⇒ − ∑ 2 Di ( Ri − kDi ) = 0 ⇒ kopt = i =n1
dk i =1 2 (4)
∑D
i =1 i
To enrich the mapping, in addition to each domain block,
four rotations are considered as well, these are obtained
by rotating the domain block 0, 90, 180 and 270 degrees
clockwise. Each range block is represented and stored by
a triple as ( m, kopt , j ) , in which m represents the related
domain block, kopt is the optimum coefficient and j
denotes rotation amount.
a c
b
Figure.2. a) A typical one dimensional range block, b) Related
domain block, c)Four rotated forms of the domain block (It is clear
the best transform is the bolded case)
To find the best domain block related each range block,
the best block is accepted if the related mapping error is
less than a predefined threshold. Otherwise the range
block is split into two smaller blocks and the mapping
continues in a smaller scale. Entering into a smaller scale
may continue for several (normally four) times and the
best domain found in the smallest scale is accepted
unconditionally.
Each range block is coded by the data structure shown
in figure.3. One first bit represents the rotations code 0 or
1 for 0 or 180 degrees, respectively. The other bit
allocation is X bytes for domain address calculated by:
where DN is the maximum value of domain address.
Since we limit our algorithm in a very small block length,
just 2bits is sufficient for step storage that yields 4 steps. For best role in 32 samples size for all the mentioned domains'
Kopt and mean values ,DC , just 5 and 4 bits is needed, length equally, making no difference.
respectively. This is explained later. 3.Transition areas:
Transform Domain Kopt Step Range Mean As shown before high amount of distortion occurs in
transition areas containing QRS complexes, noting that
1bits X bits 5 bits 2 bits 4 bits S,T encode in first step normally. Distortion in
mentioned complexes are due to two main factors:
Figure.3. The data structure describing a range block a-A limitation of block lengths since a limited number
The reconstruction process starts with an arbitrary signal of lengths are considered to match the range and domain
and an iterated operation converges into the original signal. blocks .This makes unbalanced peaks in related domain
converges very fast and after a few steps of iterative process and range blocks resulting the main proportion of errors.
the coded signal is recreated with a reasonable error. b-Down sampling in domain blocks for high slope
areas remains unpredictable fluctuations that similar
5. Results & Discussions leaves unpredictable fluctuations that similar areas don’t
know each other. In rapidly varying parts this cause
1. Quantization: lowering altitudes.
In signal compression we aim for describing a signal in a Table.1 represents some of achieved experimental
compact form that consist of a small set of numbers results by our scheme.
Table.1-Average Experimental Results in Proposed Method on MIT-
representing the significant parameters. Separate encoding of BIH Database
magnitudes such as DC, Kop, will disable a significant
signal CC PRD CR
portion of our compression capabilities. Without much loss
100 97.29 11.06 13.79
of similarity, we can quantize them as store them by codes
assigned to each magnitudes. The maximum and minimum 102 98.71 10.17 14.2
values of DC and Kop should be stored. Then by M-bits we 103 98 11 13.78
M 104 99 11.2 13
can make 2 intervals(codes),assigned to the closest values.
Experimental results showed us the best bit allocation for 105 98.56 12 15.13
mean values(DC),varying less, 4bits and for Kop 6bits, 108 98.37 8.22 15.42
yields 16 intervals and 64 intervals, respectively. In 109 98.27 11 17.39
reconstruction progress it is just sufficient to reproduce 117 98.48 4.5 14.64
intervals before performing the decoding algorithm AVE 98.33 9.80 14.66
according to the codes that calculates the main magnitudes. Table.2 represents some of the proposed algorithm like
The calculated values is embedded in codes. SPIHT[13] a wavelet transform with layers in a
2. Transforms: hierarchical tree for coefficients. Then it is filtered to
a-In all our tested signals just two transforms is utilized in generate low-pass & high-pass signals and utilizes down-
representing rotations. On the basis of eliminating mean sampling by a factor of two, SVD[18](Singular Value
values, self-similarity describes itself just with itself and Decomposition) which considers ECG signal to be a
symmetric to the origin(rotation by 180). So by ignoring the periodic one, utilizes periodic segmentation and
two other not used it is sufficient to store just one of the normalizing periods, JPEG2000[14] a scheme as an image
other two unused versions, it is sufficient to store just one of compression of ECG signals and Fractal Interpolation
the two required bits. with a contraction factor for mapping that is constrained
b-All ranges are encoded in the first step except those to be real and lie in the interval (-1,1) . Our method
containing QRS complexes. In steps more than one ,each proves more efficient than the previous algorithms with
range maps to its corresponded domain by itself (rotation by fixed range blocks methods. The peak error is
0),hence no other transform is needed. So if we know that significantly lower than aforementioned algorithms, with
our step is higher than one the transform should be the a superior compression ratio.
domain block itself with no transform, undoubtedly. Table.2-Comparison Of Different Coding on ECG-117
As shown before different parameters in compression rate Methods CR PRD CC
and error value these signals can be compressed widely, in SPIHT[13] 8:1 1.18 >=99
a high spectrum, with low CR and high CC in short block SVD[18] 10:1 3.14 >=99
lengths consequently. Experimental results in acceptable JPEG2000[14] 10:1 1.03 >=99
results recommend the length of 64 samples size for domain Fractal
blocks, there is no relation to signal length ,protecting high 7.4:1 3.50 >=99
Interpolation[19]
CR and CC, that has declared its efficiency in 128 samples Proposed
size too. So each signal has different factors. Overlapping 14.64:1 4.5 >=98
Algorithm
acts its best role in 32 samples size for all the mentioned its 6.Conclusion

985

Authorized licensed use limited to: Univ Rey Juan Carlos. Downloaded on April 07,2010 at 11:48:41 EDT from IEEE Xplore. Restrictions apply.
 The proposed algorithm, modeled by MATLAB computing construction of fractal” Proc.Roy.Soc.London A ,vol.399 .pp.243-
275, 1985.
environment, was tested on ECG arrhythmia databases. in
[17] Kreyszig, Introductory Functional Analysis with Application, John
MIT-BIH. Evaluating each algorithm is tested in results with Wiley & Sons, New York , NY USA,1978
PRD<10% and CC>95% ,maintaining arrhythmic [18] J.-J.Wei,C,-J, Chang,N,-KChou and G,-JJan ” ECG data
information. Compression using truncated singular value decomposition ”
IEEE Trans. on Information Technology in Biomedicine , vol.5,
In this method each signal is compressed generally with
pp.290-299,2001
no necessity to find transition areas. On account of self- [19] Y.IL.Jun,Y.R.Yoon and H.R.Yoon”ECG Data Compression Using
similarities in electrocardiogram signals, they are the best Fractal Interpolation ” IEEE Trans. on Biomed . Eng .vol .47, pp.
suitable choice to based on chaos theory. 161-162,1994
In practice, mapping the whole of a signal with a
transformation proves unworkable. Therefore, we split it in
domain and range blocks. Then we seek for the best related
domain block for the range block with an error lower than
predefined threshold. Each higher threshold causes the
further splitting of range block. The seeking process is
repeated unless the best mapping is found or the last scale is
reached. For the best mapping the DC value and optimum
coefficient Kopt is stored separately.
In order to reconstruct the initial signal, an arbitrary signal,
(say zero) is assumed. The reverse algorithm is utilized in the
reconstruction progress.

REFRENCES:
[1] S .Jalaleddine, C.Hutchens , R.Strattan, and W.Coberly “ ECG
data compression techniques_ A unified approach ” IEEE Trans.
on Biomed. Eng., vol.BME-37, pp.329-343 , Apr 1990.
[2] W.C.Mueller,”Arrhythmia detection program for an ambulatory ECG
monitor. ” Biomed. Sci. Instrument , vol.14, pp.81 -85,1978
[3] J.R.Cox.F.M.Nolle, H.A.Fozzard,and G.C.Oliver”AZTEC ,a preproc-
essing program for real-time ECG rhythm analysis”IEEE Trans.
on Biomedical Engineering,vol.BME-15,pp.128-129 , Apr..1968
[4] J.P.Abenstein and W.J.Tompkins,” New data-reduction algorithm for
real-time ECG analysis” IEEE Trans. on Biomedical Engineering,
vol. BME-29,pp.43-48,Jan.1982
[5] D.Stewart ,G.E.Dower and O.Seurnyi,”An ECG compression code.”
J.Electrocardiol,vol.6, no.2 , pp.175- 176,1973
[6] L.W.Grdenhire.” Redundancy reduction the key to adaptive
telemetry.’in Proc.1964Nat .Telemetry Conf.1964,pp.1-16
[7] A. S.Krishnakumar , J.L.Karpowicz, N.Belic D.H.Singer and
J.M.Jenkins,” Microprocessor-Based data compression scheme for
enhanced digital transmission of Holter reco-rding ” Computers
Crdiol.Long Beach, CA pp.435-437, 1980
[8] U.E.Ruttimann and H.V.Pipberger’Compression of ECG by prediction
interpolation and entropy encoding.” IEEE Trans. on Biomedical
Engineering, vol.BME-2, pp.613-62 Nov.1979
[9] B.R.S.Reddy and I.S.N.Murthy .” ECG data compression using Fourier
descriptors” IEEE,Trans. on Biomedical Engineering, vol. BME 33, pp.
428- 434,Apr.1986
[10] N.Ahmed, P.J.Milne and S.G.Harris ” Elecrocardiographic data
compression via orthogonal transforms” IEEE Trans. on Biomedical
Engineering, vol.BME-22, pp.484-487, Nov.1975
[11] M.Abo-Zahhad and B.A Rajoub,” An effective coding technique
for the compression of one-dimensional signals using wavelet transfor-
m” Medical Engineering Physics, vol. 24 ,pp.185-199,2002
[12] Bradie B. ” Wavelet packet-based compression of signal lead ECG”
IEEE Trans. on Biomedical Engineering 1996; 43(5):493-501
[13] Z.Lu,D.Y.Kim and W.A.Pearlman ” Wavelet Compression of ECG
Signals by the set partitioning in hierarchical tree algorithm ”
IEEE Trans. on Biomed .Eng .,vol .47,pp. 849-856, 2000
[14] A.Bilgin , M.W.Marcellin and M.I.Altbach ” Compression of
electrocardiogram signals using JPEG2000” IEEE Trans. on
Consumer Electronics,vol.49,pp,833-840, 203
[15] G.Nave,A.Cohen,” ECG compression using long-term prediction,”
IEEE Trans .Biomed .Eng. vol.BME-40, pp.877-885, Sept. 1993.
[16] M.F.Barnsley and S.Demko.”Iterated function systems and the global

986

Authorized licensed use limited to: Univ Rey Juan Carlos. Downloaded on April 07,2010 at 11:48:41 EDT from IEEE Xplore. Restrictions apply.