We use the B spline function and apply the Oslo algorithm to minimize the number of control points in electrocardiogram (ECG) waveform compression under the limitation of evaluation indexes. This method is based on dynamic programming matching to transfer the control points of a reference ECG waveform to the succeeding ECG waveforms. This reduces the execution time for beat-to-beat processing. We also reduced the processing time at several compression stages. When the difference percent normalized root mean square difference is around 10, our method gives the highest compression ratio at a sampling frequency of 250 Hz.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yoshiaki SAITOH, Yasushi HASEGAWA, Tohru KIRYU, Jun'ichi HORI, "Electrocardiogram Data Compression by the Oslo Algorithm and DP Matching" in IEICE TRANSACTIONS on Information,
vol. E76-D, no. 12, pp. 1411-1418, December 1993, doi: .
Abstract: We use the B spline function and apply the Oslo algorithm to minimize the number of control points in electrocardiogram (ECG) waveform compression under the limitation of evaluation indexes. This method is based on dynamic programming matching to transfer the control points of a reference ECG waveform to the succeeding ECG waveforms. This reduces the execution time for beat-to-beat processing. We also reduced the processing time at several compression stages. When the difference percent normalized root mean square difference is around 10, our method gives the highest compression ratio at a sampling frequency of 250 Hz.
URL: https://global.ieice.org/en_transactions/information/10.1587/e76-d_12_1411/_p
Copy
@ARTICLE{e76-d_12_1411,
author={Yoshiaki SAITOH, Yasushi HASEGAWA, Tohru KIRYU, Jun'ichi HORI, },
journal={IEICE TRANSACTIONS on Information},
title={Electrocardiogram Data Compression by the Oslo Algorithm and DP Matching},
year={1993},
volume={E76-D},
number={12},
pages={1411-1418},
abstract={We use the B spline function and apply the Oslo algorithm to minimize the number of control points in electrocardiogram (ECG) waveform compression under the limitation of evaluation indexes. This method is based on dynamic programming matching to transfer the control points of a reference ECG waveform to the succeeding ECG waveforms. This reduces the execution time for beat-to-beat processing. We also reduced the processing time at several compression stages. When the difference percent normalized root mean square difference is around 10, our method gives the highest compression ratio at a sampling frequency of 250 Hz.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Electrocardiogram Data Compression by the Oslo Algorithm and DP Matching
T2 - IEICE TRANSACTIONS on Information
SP - 1411
EP - 1418
AU - Yoshiaki SAITOH
AU - Yasushi HASEGAWA
AU - Tohru KIRYU
AU - Jun'ichi HORI
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E76-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 1993
AB - We use the B spline function and apply the Oslo algorithm to minimize the number of control points in electrocardiogram (ECG) waveform compression under the limitation of evaluation indexes. This method is based on dynamic programming matching to transfer the control points of a reference ECG waveform to the succeeding ECG waveforms. This reduces the execution time for beat-to-beat processing. We also reduced the processing time at several compression stages. When the difference percent normalized root mean square difference is around 10, our method gives the highest compression ratio at a sampling frequency of 250 Hz.
ER -