By Topic

Development of a compression algorithm suitable for exercise ECG data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Uyar, K. ; Dept. of Electr. & Electron. Eng., Middle East Tech. Univ., Ankara, Turkey ; Ider, Y.Z.

Huge amount of data recorded during exercise electrocardiography may be stored for further analysis or be transferred to a remote physician through telephone lines. Due to channel limitations, data must be compressed prior to the transfer, In this study, an algorithm suitable for compression of exercise electrocardiography data is proposed. 2-D discrete cosine transformation is applied in the algorithm to make use of the pseudo periodic behavior of the data. To increase the correlation, data is aligned from the R peaks. QRS detection is performed using a fast dyadic wavelet transform. The success rate of the detection algorithm is found to be 99.78%. Uniform scalar quantization is used with a zonal coding method in the coding of 2-D discrete cosine transform coefficients. The performance of the compression algorithm is evaluated in terms of compression ratio, reconstruction error and by comparing the reports of the ST segment depression test applied before the compression and after the reconstruction to inspect whether vital information is preserved.

Published in:

Engineering in Medicine and Biology Society, 2001. Proceedings of the 23rd Annual International Conference of the IEEE  (Volume:4 )

Date of Conference: