ECG data compression with vector quantization using k-dimensional tree for fast search

Author

Bertonha, Eduardo ; Zanchin, Carlos I. ; Klautau, Aldebaro

Author_Institution

Res. Group in Biomed. Eng., Univ. Federal de Santa Catarina, Florianopolis, Brazil

fYear

1993

fDate

5-8 Sep 1993

Firstpage

515

Lastpage

518

Abstract

Long-term ECG monitoring demands a bit rate of around 200 bps with acceptable distortion. Vector quantization (VQ) techniques allow one to reach that performance, despite the high computational effort. The most time-consuming stage in the VQ is the search for the best vector in the codebook, and, as a result, this makes real-time implementation infeasible. This paper evaluates the compression of ECG data using VQ with some techniques to optimize the searching for the best vector. The algorithm based on those techniques can be implemented in real-time using low-cost microprocessors. We have evaluated the VQ of the ECG signal and its first-difference using several codebook sizes. The results obtained are good enough to permit a real-time implementation

Keywords

computerised monitoring; data compression; electrocardiography; medical signal processing; patient monitoring; tree searching; vector quantisation; 200 bit/s; ECG data compression; codebook sizes; first-difference; k-dimensional tree; long-term ECG monitoring; low-cost microprocessors; real-time implementation; search optimization; signal distortion; vector quantization; vector searching; Bit rate; Costs; Data compression; Distortion measurement; Electrocardiography; Image coding; Microprocessors; Pattern matching; Rate distortion theory; Vector quantization;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers in Cardiology 1993, Proceedings.

Conference_Location

London

Print_ISBN

0-8186-5470-8

Type

conf

DOI

10.1109/CIC.1993.378389

Filename

378389