A wavelet transform-based ECG compression method guaranteeing desired signal quality
TL;DR: A new electrocardiogram compression method based on orthonormal wavelet transform and an adaptive quantization strategy, by which a predetermined percent root mean square difference (PRD) can be guaranteed with high compression ratio and low implementation complexity are presented.
Abstract: This paper presents a new electrocardiogram (ECG) compression method based on orthonormal wavelet transform and an adaptive quantization strategy, by which a predetermined percent root mean square difference (PRD) can be guaranteed with high compression ratio and low implementation complexity.
Citations
More filters
TL;DR: This paper presents a FPGA-based rapid prototyping of an adaptive noise canceller (ANC) using XUP Virtex-II Pro development board and Xilinx System Generator to remove noise from electrocardiogram and speech signals.
Abstract: This paper presents a FPGA-based rapid prototyping of an adaptive noise canceller (ANC) using XUP Virtex-II Pro development board and Xilinx System Generator. New parallel and sequential architectures of the ANC are proposed and successfully applied to remove noise from electrocardiogram and speech signals. The pipelined architecture were evaluated and compared to existing high-speed systems using objective measurement tests. By providing comparable filtering performances that of the parallel architectures, the proposed sequential system required fewer material resources.
31 citations
TL;DR: A wavelet-based data mining algorithm composed of wavelet packet transform and statistical analysis (WPT-SA) was proposed to extract and optimize spectral feature from full-spectrum data as discussed by the authors.
29 citations
TL;DR: The experimental results show that the new EP-based quantization scheme can obtain high compression performance and keep linear distortion behavior efficiency, and guarantees fast quality control even for the prediction model mismatching practical distortion curve.
24 citations
Cites methods from "A wavelet transform-based ECG compr..."
...With uniform quantization scheme, Chen and Itoh [8] determined the quantization scale by...
[...]
...[8] Chen J, Itoh S....
[...]
...With uniform quantization scheme, Chen and Itoh [8] determined the quantization scale by efficient quantization for linear distortion ECG data compression....
[...]
TL;DR: In this paper, a wavelet packet transform with run-length encoding (RLE), wavelet transform with Huffman encoding (Huffman encoding) and wavelet transformer with RLE were used for ECG data compression.
Abstract: Compression of an electrocardiogram (ECG) signal has given much consideration to the researchers since the computer-aided analysis of ECG has come into being. In some critical cases, viz., astronauts, a person under cardiac surveillance, ambulatory patients and in Holter monitoring system, continuous ECG data recording and transmitting from one location to other location is required. However, the size of the recorded data becomes so voluminous, that its transmission of data becomes practically impossible. In this paper, ECG data compression using wavelet-based techniques are presented, such that: a) wavelet packet transform with run-length encoding (RLE), b) wavelet transform with Huffman encoding, c) wavelet transform with RLE and d) wavelet transform and Lempel ZivWelch (LZW). The results have been tested using MIT-BIH (Massachusetts Institute of Technology/Beth Israel Hospital) arrhythmia databases. The performances of these methodologies are examined in the quantitative and qualitative manner. From Tabular results, it can be observed that the methodology based on WT and LZW provides efficient results in terms of compression ratio ( CR ∼ = 20 to 30 ) and peak root mean square difference ( PRD ∼ = 0.01 to 1.8 ) both, hence the overall QS value is improved.
24 citations
21 May 2001
TL;DR: A new algorithm for lossless ECG compression using lifting wavelet transform is presented, which is implemented in its integers to integers version, and thus quantization of wavelet coefficients and rounding of errors are avoided.
Abstract: The paper presents a new algorithm for lossless ECG compression using lifting wavelet transform. The transform is implemented in its integers to integers version, and thus quantization of wavelet coefficients and rounding of errors are avoided. A new adaptation method for the wavelet lifting transform is presented. The efficiency of adaptive lifting transform is compared with DPCM coding and S+P transform.
23 citations
References
More filters
TL;DR: This work construct orthonormal bases of compactly supported wavelets, with arbitrarily high regularity, by reviewing the concept of multiresolution analysis as well as several algorithms in vision decomposition and reconstruction.
Abstract: We construct orthonormal bases of compactly supported wavelets, with arbitrarily high regularity. The order of regularity increases linearly with the support width. We start by reviewing the concept of multiresolution analysis as well as several algorithms in vision decomposition and reconstruction. The construction then follows from a synthesis of these different approaches.
8,588 citations
"A wavelet transform-based ECG compr..." refers methods in this paper
...Since detailed mathematical aspects of wavelet theory can b found elsewhere [16], here, we shall merely describe the structure of a DOWT-based coding system shown in Fig....
[...]
...The proposed algorithm was implemented on a SparcStation 2 computer, where the wavelet-based filters with 10-taps were designed by Daubechies’s algorithm [16], the layer was set to , the buffer size for segmenting input ECG signals was set to , and the Lempel–Ziv–Welch (LZW) encoder [20] was chosen as the entropy encoder for simplicity....
[...]
TL;DR: A new compression algorithm is introduced that is based on principles not found in existing commercial methods in that it dynamically adapts to the redundancy characteristics of the data being compressed, and serves to illustrate system problems inherent in using any compression scheme.
Abstract: Data stored on disks and tapes or transferred over communications links in commercial computer systems generally contains significant redundancy. A mechanism or procedure which recodes the data to lessen the redundancy could possibly double or triple the effective data densitites in stored or communicated data. Moreover, if compression is automatic, it can also aid in the rise of software development costs. A transparent compression mechanism could permit the use of "sloppy" data structures, in that empty space or sparse encoding of data would not greatly expand the use of storage space or transfer time; however , that requires a good compression procedure. Several problems encountered when common compression methods are integrated into computer systems have prevented the widespread use of automatic data compression. For example (1) poor runtime execution speeds interfere in the attainment of very high data rates; (2) most compression techniques are not flexible enough to process different types of redundancy; (3) blocks of compressed data that have unpredictable lengths present storage space management problems. Each compression ' This article was written while Welch was employed at Sperry Research Center; he is now employed with Digital Equipment Corporation. 8 m, 2 /R4/OflAb l strategy poses a different set of these problems and, consequently , the use of each strategy is restricted to applications where its inherent weaknesses present no critical problems. This article introduces a new compression algorithm that is based on principles not found in existing commercial methods. This algorithm avoids many of the problems associated with older methods in that it dynamically adapts to the redundancy characteristics of the data being compressed. An investigation into possible application of this algorithm yields insight into the compressibility of various types of data and serves to illustrate system problems inherent in using any compression scheme. For readers interested in simple but subtle procedures, some details of this algorithm and its implementations are also described. The focus throughout this article will be on transparent compression in which the computer programmer is not aware of the existence of compression except in system performance. This form of compression is "noiseless," the decompressed data is an exact replica of the input data, and the compression apparatus is given no special program information, such as data type or usage statistics. Transparency is perceived to be important because putting an extra burden on the application programmer would cause
2,426 citations
"A wavelet transform-based ECG compr..." refers methods in this paper
...The proposed algorithm was implemented on a SparcStation 2 computer, where the wavelet-based filters with 10-taps were designed by Daubechies’s algorithm [16], the layer was set to , the buffer size for segmenting input ECG signals was set to , and the Lempel‐Ziv‐Welch (LZW) encoder [ 20 ] was chosen as the entropy encoder for simplicity....
[...]
869 citations
TL;DR: The theoretical bases behind the direct ECG data compression schemes are presented and classified into three categories: tolerance-comparison compression, DPCM, and entropy coding methods and a framework for evaluation and comparison of ECG compression schemes is presented.
Abstract: Electrocardiogram (ECG) compression techniques are compared, and a unified view of these techniques is established. ECG data compression schemes are presented in two major groups: direct data compression and transformation methods. The direct data compression techniques are ECG differential pulse code modulation (DPCM) and entropy coding, AZTEC, Turning-point, CORTES, Fan and SAPA algorithms, peak-picking, and cycle-to-cycle compression methods. The transformation methods include Fourier, Walsh, and Karhunen-Loeve transforms. The theoretical bases behind the direct ECG data compression schemes are presented and classified into three categories: tolerance-comparison compression, DPCM, and entropy coding methods. A framework for evaluation and comparison of ECG compression schemes is presented. >
690 citations
"A wavelet transform-based ECG compr..." refers methods in this paper
...In most cases, direct methods are superior to transform methods with respect to system complexity and the error control mechanism, however, transform methods usually achieve higher compression ratios and are insensitive to the noise contained in original ECG signals [1]....
[...]
...In direct methods, the compression is done directly on the ECG samples; examples include the amplitude zone time epoch coding (AZTEC), the turning point (TP), the coordinate reduction time encoding system (CORTES), the scan-along polygonal approximation (SAPA), peak-picking, cycle-to-cycle, and differential pulse code modulation (DPCM) [1]–[4]....
[...]
TL;DR: Pilot data from a blind evaluation of compressed ECG's by cardiologists suggest that the clinically useful information present in original ECG signals is preserved by 8:1 compression, and in most cases 16:1 compressed ECGs are clinically useful.
Abstract: Wavelets and wavelet packets have recently emerged as powerful tools for signal compression. Wavelet and wavelet packet-based compression algorithms based on embedded zerotree wavelet (EZW) coding are developed for electrocardiogram (ECG) signals, and eight different wavelets are evaluated for their ability to compress Holter ECG data. Pilot data from a blind evaluation of compressed ECG's by cardiologists suggest that the clinically useful information present in original ECG signals is preserved by 8:1 compression, and in most cases 16:1 compressed ECG's are clinically useful.
445 citations