A wavelet transform-based ECG compression method guaranteeing desired signal quality
Citations
794 citations
Cites methods from "A wavelet transform-based ECG compr..."
...In a later paper (Chen and Itoh 1998), again using D10 wavelets, they incorporate an adaptive quantization strategy which allows a predetermined desired signal quality to be achieved....
[...]
...In a later paper (Chen and Itoh 1998), again using D10 wavelets, they incorporate an adaptive quantization strategy which allows a predetermined desired signal quality to be achieved. Miaou and Lin (2000) also propose a quality driven compression methodology based on Daubechies wavelets and later (Miaou and Lin 2002) on biorthogonal wavelets. The latter algorithm adopts the set partitioning of hierarchical tree (SPIHT) coding strategy. Miaou et al (2002) have also proposed a dynamic vector quantization method employing tree codevectors in a single codebook. Some examples of original and compressed signals from this work are shown in figure 27. Bradie (1996) suggested the use of a wavelet-packet-based algorithm for compression of the ECG....
[...]
...In a later paper (Chen and Itoh 1998), again using D10 wavelets, they incorporate an adaptive quantization strategy which allows a predetermined desired signal quality to be achieved. Miaou and Lin (2000) also propose a quality driven compression methodology based on Daubechies wavelets and later (Miaou and Lin 2002) on biorthogonal wavelets. The latter algorithm adopts the set partitioning of hierarchical tree (SPIHT) coding strategy. Miaou et al (2002) have also proposed a dynamic vector quantization method employing tree codevectors in a single codebook. Some examples of original and compressed signals from this work are shown in figure 27. Bradie (1996) suggested the use of a wavelet-packet-based algorithm for compression of the ECG. When compared to the Karhunen–Loeve transform (KLT) applied to the same data the WP method generated significantly lower data rates at less than one-third the computational effort with generally excellent reconstructed signal quality. However, Blanchett et al (1998) report at least as good compression results for a KLT-based method. By first normalizing beat periods using multirate processing and normalizing beat amplitudes Ramakrishnan and Saha (1997) converted the ECG into a near cyclostationary sequence....
[...]
...In a later paper (Chen and Itoh 1998), again using D10 wavelets, they incorporate an adaptive quantization strategy which allows a predetermined desired signal quality to be achieved. Miaou and Lin (2000) also propose a quality driven compression methodology based on Daubechies wavelets and later (Miaou and Lin 2002) on biorthogonal wavelets. The latter algorithm adopts the set partitioning of hierarchical tree (SPIHT) coding strategy. Miaou et al (2002) have also proposed a dynamic vector quantization method employing tree codevectors in a single codebook....
[...]
...In a later paper (Chen and Itoh 1998), again using D10 wavelets, they incorporate an adaptive quantization strategy which allows a predetermined desired signal quality to be achieved. Miaou and Lin (2000) also propose a quality driven compression methodology based on Daubechies wavelets and later (Miaou and Lin 2002) on biorthogonal wavelets....
[...]
385 citations
375 citations
Cites background from "A wavelet transform-based ECG compr..."
...For example, in the medical domain it is frequently done for both the wavelet [5] and cosine [3] representations....
[...]
156 citations
Cites background or result from "A wavelet transform-based ECG compr..."
...The results in [6], [8], [10] are Fig....
[...]
...[8], [10], because the signal was not processed to have zero...
[...]
152 citations
Cites background from "A wavelet transform-based ECG compr..."
...The complexity of WDD and lack of standard code for comparison make it difficult to be adopted for quantifying a reconstructed signal’s quality....
[...]
...Three main components should be integrated for proper performance testing: compression measure, reconstruction error, and computational complexity [6]....
[...]
References
1 citations