ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2019
DOI: 10.1109/icassp.2019.8683836
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Lossless Compression Scheme for Multi-channel ECG Signal

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(8 citation statements)
references
References 9 publications
0
7
1
Order By: Relevance
“…[11]- [14] also achieve relatively high CR. However, the K-means cluster of Zhou's method [11] needs to square each point when matching templates, and the Huffman codebook in Zhou's method contains 2048 items the compress the ECG signal of the ARRDB (which has 11-bit resolution), more than the variable number of the proposed S system; the Takagi-Sugeno Fuzzy Neural Network in [12] contains many multiply-accumulate operations when predicting each point; and both [13] and [14] need integer division operations. So the computational complexity of [11]- [14] are higher than that of the proposed method.…”
Section: Comparison With Other Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…[11]- [14] also achieve relatively high CR. However, the K-means cluster of Zhou's method [11] needs to square each point when matching templates, and the Huffman codebook in Zhou's method contains 2048 items the compress the ECG signal of the ARRDB (which has 11-bit resolution), more than the variable number of the proposed S system; the Takagi-Sugeno Fuzzy Neural Network in [12] contains many multiply-accumulate operations when predicting each point; and both [13] and [14] need integer division operations. So the computational complexity of [11]- [14] are higher than that of the proposed method.…”
Section: Comparison With Other Methodsmentioning
confidence: 99%
“…Zhou [11] K-means cluster Huffman encoding 2.93 ab Chua and Fang [5] Discrete pulse code modulation + Error modeling Golomb-Rice encoding 2.38 Chen and Wang [6] Adaptive linear predictor Two-stage Huffman encoding 2.43 Luo et al [7] Adaptive linear predictor Two-stage Huffman encoding 2.53 Li et al [8] Adaptive linear predictor Modified variable-length encoding 2.67 Deepu and Lian [3] Short term linear predictor Fixed-length encoding 2.28 Tseng et al [12] Takagi-Sugeno fuzzy neural network Arithmetic encoding 2.96 a Tsai and Kuo [9] Adaptive linear predictor Golomb-Rice encoding 2.835 Tsai and Tsai [13] Adaptive linear predictor Golomb-Rice encoding 2.89 Rzepka [14] Selective a These two references used 12-bit as the resolution of the ARRDB. We set the resolution to 11-bit and recalculated the CR for comparison.…”
Section: 068mentioning
confidence: 99%
See 1 more Smart Citation
“…Tsai and Kuo [3] proposed the adaptive linear prediction with content-adaptive Golomb-Rice coding. Tsai and Tsai [4] proposed the multi-channel adaptive linear prediction with a modified Golomb-Rice coding method, and Tsai et al [5] also implemented the method in [4] on Very Large-Scale Integration (VLSI). This work compressed the 12-lead ECG signal by using four reference leads to calculate the other eight leads of the signals.…”
Section: Introductionmentioning
confidence: 99%
“…Zhang, R proposed a new three-phase power quality data compression method based on wavelet transform, which, combined with Lempel-Ziv-Welch (LZW) coding, achieves a good compression effect on power quality signal compression [11]. Tsai, T proposed a multi-channel lossless ECG compression algorithm that uses exponentially weighted multi-channel linear prediction and adaptive Golomb-Rice coding [12]. Alam, S proposed a DPCM-based threshold data compression technology for real-time remote monitoring applications, which uses simple calculation and a high compression ratio [13].…”
Section: Introductionmentioning
confidence: 99%