Using contexts and R–R interval estimation in lossless ECG compression
The paper presents a new lossless ECG compression scheme. The short-term predictor and the coder use conditioning on a small number of contexts. The long-term prediction is based on an algorithm for R–R interval estimation. Several QRS detection algorithms are investigated to select a low complexity...
Saved in:
| Published in | Computer methods and programs in biomedicine Vol. 67; no. 3; pp. 177 - 186 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Shannon
Elsevier Ireland Ltd
01.03.2002
Elsevier Science |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0169-2607 1872-7565 |
| DOI | 10.1016/S0169-2607(01)00126-2 |
Cover
| Summary: | The paper presents a new lossless ECG compression scheme. The short-term predictor and the coder use conditioning on a small number of contexts. The long-term prediction is based on an algorithm for
R–R interval estimation. Several QRS detection algorithms are investigated to select a low complexity and reliable detection algorithm. The coding of prediction residuals uses primarily the Golomb-Rice (GR) codes, but, to improve the coding results, escape codes GR–ESC are used in some contexts for a limited number of samples. Experimental results indicate the good overall performance of the lossless ECG compression algorithms (reducing the storage needs from 12 to about 3–4 bits per sample). The scheme consistently outperforms other waveform or general purpose coding algorithms. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 ObjectType-Article-1 ObjectType-Feature-2 |
| ISSN: | 0169-2607 1872-7565 |
| DOI: | 10.1016/S0169-2607(01)00126-2 |