Lossless compression schemes for ECG signals using neural network predictors


Kannan, R. and Eswaran, C. (2007) Lossless compression schemes for ECG signals using neural network predictors. EURASIP Journal on Advances in Signal Processing, 2007. p. 1. ISSN 1687-6172

[img] Text
Lossless compression schemes for ECG signals using neural network predictors.pdf
Restricted to Repository staff only

Download (2MB)


This paper presents lossless compression schemes for ECG signals based on neural network predictors and entropy encoders. Decorrelation is achieved by nonlinear prediction in the first stage and encoding of the residues is done by using lossless entropy encoders in the second stage. Different types of lossless encoders, such as Huffman, arithmetic, and runlength encoders, are used. The performances of the proposed neural network predictor-based compression schemes are evaluated using standard distortion and compression efficiency measures. Selected records from MIT-BIH arrhythmia database are used for performance evaluation. The proposed compression schemes are compared with linear predictor-based compression schemes and it is shown that about 11% improvement in compression efficiency can be achieved for neural network predictor-based schemes with the same quality and similar setup. They are also compared with other known ECG compression methods and the experimental results show that superior performances in terms of the distortion parameters of the reconstructed signals can be achieved with the proposed schemes. Copyright (c) 2007 R. Kannan and C. Eswaran.

Item Type: Article
Subjects: T Technology > T Technology (General)
Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Engineering and Technology (FET)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 18 Oct 2011 06:05
Last Modified: 17 Dec 2013 00:30
URII: http://shdl.mmu.edu.my/id/eprint/3165


Downloads per month over past year

View ItemEdit (login required)