Optimal data fusion for the improvement of QRS complex detection in multi-channel ECG recordings
Abstract The automatic analysis of the electrocardiogram (ECG) begins, traditionally, with the detection of QRS complexes. Afterwards, useful information can be extracted from it, ranging from the estimation of the instantaneous heart rate to nonlinear heart rate variability analysis. A plethora of...
Ausführliche Beschreibung
Autor*in: |
Ledezma, Carlos A. [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2019 |
---|
Schlagwörter: |
---|
Anmerkung: |
© International Federation for Medical and Biological Engineering 2019 |
---|
Übergeordnetes Werk: |
Enthalten in: Medical & biological engineering & computing - Cham : Springer Nature, 1963, 57(2019), 8 vom: 17. Mai, Seite 1673-1681 |
---|---|
Übergeordnetes Werk: |
volume:57 ; year:2019 ; number:8 ; day:17 ; month:05 ; pages:1673-1681 |
Links: |
---|
DOI / URN: |
10.1007/s11517-019-01990-3 |
---|
Katalog-ID: |
SPR020522487 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | SPR020522487 | ||
003 | DE-627 | ||
005 | 20230519235854.0 | ||
007 | cr uuu---uuuuu | ||
008 | 201006s2019 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1007/s11517-019-01990-3 |2 doi | |
035 | |a (DE-627)SPR020522487 | ||
035 | |a (SPR)s11517-019-01990-3-e | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
100 | 1 | |a Ledezma, Carlos A. |e verfasserin |4 aut | |
245 | 1 | 0 | |a Optimal data fusion for the improvement of QRS complex detection in multi-channel ECG recordings |
264 | 1 | |c 2019 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
500 | |a © International Federation for Medical and Biological Engineering 2019 | ||
520 | |a Abstract The automatic analysis of the electrocardiogram (ECG) begins, traditionally, with the detection of QRS complexes. Afterwards, useful information can be extracted from it, ranging from the estimation of the instantaneous heart rate to nonlinear heart rate variability analysis. A plethora of works have been published on this topic; consequently, there exist many QRS complex detectors with high-performance values. However, just a few detectors have been conceived that profit from the information contained in several ECG leads to provide a robust QRS complex detection. In this work, we explore the fusion of multi-channel ECG recordings QRS detections as a means to improve the detection performance. This paper presents a decentralized multi-channel QRS complex fusion scheme that optimally combines single-channel detections to produce a single detection signal. Using six different widely used QRS complex detectors on the MIT-BIH Arrhythmia and INCART databases, a reduction in false and missed detections was achieved with the proposed approach compared with the single-channel counterpart. Furthermore, our detection results are comparable with the performance of other multi-channel detectors found in the literature, showing, in turn, various advantages in scalability, adaptability, and simplicity in the system’s implementation Graphical AbstractN QRS complex detectors simultaneously monitor N ECG channels. Once a detection occurs in a given channel, a 150 ms long window is opened to look for detections in other channels. Within this window, yn = + 1 if a QRS complex is detected and yn = − 1 otherwise. A coefficient α n, obtained during a training period and related to the detection performance in channel n, multiplies the detection signal yn, so that greater weights are assigned to ECG channels where single-channel detectors performed better. Finally, the binary detection decision (f ) is obtained from the comparison of the weighted sum of single-channel detections (z) with a fixed threshold (β). | ||
650 | 4 | |a QRS complex detection |7 (dpeaa)DE-He213 | |
650 | 4 | |a Electrocardiography |7 (dpeaa)DE-He213 | |
650 | 4 | |a Digital filters |7 (dpeaa)DE-He213 | |
650 | 4 | |a Optimal data fusion |7 (dpeaa)DE-He213 | |
650 | 4 | |a Detection algorithms |7 (dpeaa)DE-He213 | |
700 | 1 | |a Altuve, Miguel |0 (orcid)0000-0002-4064-2601 |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Medical & biological engineering & computing |d Cham : Springer Nature, 1963 |g 57(2019), 8 vom: 17. Mai, Seite 1673-1681 |w (DE-627)331747456 |w (DE-600)2052667-2 |x 1741-0444 |7 nnns |
773 | 1 | 8 | |g volume:57 |g year:2019 |g number:8 |g day:17 |g month:05 |g pages:1673-1681 |
856 | 4 | 0 | |u https://dx.doi.org/10.1007/s11517-019-01990-3 |z lizenzpflichtig |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_SPRINGER | ||
912 | |a SSG-OLC-PHA | ||
912 | |a GBV_ILN_11 | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_31 | ||
912 | |a GBV_ILN_32 | ||
912 | |a GBV_ILN_39 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_63 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_69 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_74 | ||
912 | |a GBV_ILN_90 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_100 | ||
912 | |a GBV_ILN_101 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_120 | ||
912 | |a GBV_ILN_138 | ||
912 | |a GBV_ILN_150 | ||
912 | |a GBV_ILN_151 | ||
912 | |a GBV_ILN_152 | ||
912 | |a GBV_ILN_161 | ||
912 | |a GBV_ILN_170 | ||
912 | |a GBV_ILN_171 | ||
912 | |a GBV_ILN_187 | ||
912 | |a GBV_ILN_206 | ||
912 | |a GBV_ILN_213 | ||
912 | |a GBV_ILN_224 | ||
912 | |a GBV_ILN_230 | ||
912 | |a GBV_ILN_250 | ||
912 | |a GBV_ILN_281 | ||
912 | |a GBV_ILN_285 | ||
912 | |a GBV_ILN_293 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_602 | ||
912 | |a GBV_ILN_636 | ||
912 | |a GBV_ILN_647 | ||
912 | |a GBV_ILN_702 | ||
912 | |a GBV_ILN_2001 | ||
912 | |a GBV_ILN_2003 | ||
912 | |a GBV_ILN_2004 | ||
912 | |a GBV_ILN_2005 | ||
912 | |a GBV_ILN_2006 | ||
912 | |a GBV_ILN_2007 | ||
912 | |a GBV_ILN_2008 | ||
912 | |a GBV_ILN_2009 | ||
912 | |a GBV_ILN_2010 | ||
912 | |a GBV_ILN_2011 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_2015 | ||
912 | |a GBV_ILN_2020 | ||
912 | |a GBV_ILN_2021 | ||
912 | |a GBV_ILN_2025 | ||
912 | |a GBV_ILN_2026 | ||
912 | |a GBV_ILN_2027 | ||
912 | |a GBV_ILN_2031 | ||
912 | |a GBV_ILN_2034 | ||
912 | |a GBV_ILN_2037 | ||
912 | |a GBV_ILN_2038 | ||
912 | |a GBV_ILN_2039 | ||
912 | |a GBV_ILN_2044 | ||
912 | |a GBV_ILN_2048 | ||
912 | |a GBV_ILN_2049 | ||
912 | |a GBV_ILN_2050 | ||
912 | |a GBV_ILN_2055 | ||
912 | |a GBV_ILN_2056 | ||
912 | |a GBV_ILN_2057 | ||
912 | |a GBV_ILN_2059 | ||
912 | |a GBV_ILN_2061 | ||
912 | |a GBV_ILN_2064 | ||
912 | |a GBV_ILN_2065 | ||
912 | |a GBV_ILN_2068 | ||
912 | |a GBV_ILN_2070 | ||
912 | |a GBV_ILN_2086 | ||
912 | |a GBV_ILN_2088 | ||
912 | |a GBV_ILN_2093 | ||
912 | |a GBV_ILN_2106 | ||
912 | |a GBV_ILN_2107 | ||
912 | |a GBV_ILN_2108 | ||
912 | |a GBV_ILN_2110 | ||
912 | |a GBV_ILN_2111 | ||
912 | |a GBV_ILN_2112 | ||
912 | |a GBV_ILN_2113 | ||
912 | |a GBV_ILN_2116 | ||
912 | |a GBV_ILN_2118 | ||
912 | |a GBV_ILN_2119 | ||
912 | |a GBV_ILN_2122 | ||
912 | |a GBV_ILN_2129 | ||
912 | |a GBV_ILN_2143 | ||
912 | |a GBV_ILN_2144 | ||
912 | |a GBV_ILN_2147 | ||
912 | |a GBV_ILN_2148 | ||
912 | |a GBV_ILN_2152 | ||
912 | |a GBV_ILN_2153 | ||
912 | |a GBV_ILN_2188 | ||
912 | |a GBV_ILN_2190 | ||
912 | |a GBV_ILN_2232 | ||
912 | |a GBV_ILN_2336 | ||
912 | |a GBV_ILN_2446 | ||
912 | |a GBV_ILN_2470 | ||
912 | |a GBV_ILN_2472 | ||
912 | |a GBV_ILN_2507 | ||
912 | |a GBV_ILN_2522 | ||
912 | |a GBV_ILN_2548 | ||
912 | |a GBV_ILN_4035 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4046 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4125 | ||
912 | |a GBV_ILN_4126 | ||
912 | |a GBV_ILN_4242 | ||
912 | |a GBV_ILN_4246 | ||
912 | |a GBV_ILN_4249 | ||
912 | |a GBV_ILN_4251 | ||
912 | |a GBV_ILN_4305 | ||
912 | |a GBV_ILN_4306 | ||
912 | |a GBV_ILN_4307 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4322 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4325 | ||
912 | |a GBV_ILN_4326 | ||
912 | |a GBV_ILN_4328 | ||
912 | |a GBV_ILN_4333 | ||
912 | |a GBV_ILN_4334 | ||
912 | |a GBV_ILN_4335 | ||
912 | |a GBV_ILN_4336 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4393 | ||
912 | |a GBV_ILN_4700 | ||
951 | |a AR | ||
952 | |d 57 |j 2019 |e 8 |b 17 |c 05 |h 1673-1681 |
author_variant |
c a l ca cal m a ma |
---|---|
matchkey_str |
article:17410444:2019----::piadtfsofrhipoeetfrcmlxeetoiml |
hierarchy_sort_str |
2019 |
publishDate |
2019 |
allfields |
10.1007/s11517-019-01990-3 doi (DE-627)SPR020522487 (SPR)s11517-019-01990-3-e DE-627 ger DE-627 rakwb eng Ledezma, Carlos A. verfasserin aut Optimal data fusion for the improvement of QRS complex detection in multi-channel ECG recordings 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © International Federation for Medical and Biological Engineering 2019 Abstract The automatic analysis of the electrocardiogram (ECG) begins, traditionally, with the detection of QRS complexes. Afterwards, useful information can be extracted from it, ranging from the estimation of the instantaneous heart rate to nonlinear heart rate variability analysis. A plethora of works have been published on this topic; consequently, there exist many QRS complex detectors with high-performance values. However, just a few detectors have been conceived that profit from the information contained in several ECG leads to provide a robust QRS complex detection. In this work, we explore the fusion of multi-channel ECG recordings QRS detections as a means to improve the detection performance. This paper presents a decentralized multi-channel QRS complex fusion scheme that optimally combines single-channel detections to produce a single detection signal. Using six different widely used QRS complex detectors on the MIT-BIH Arrhythmia and INCART databases, a reduction in false and missed detections was achieved with the proposed approach compared with the single-channel counterpart. Furthermore, our detection results are comparable with the performance of other multi-channel detectors found in the literature, showing, in turn, various advantages in scalability, adaptability, and simplicity in the system’s implementation Graphical AbstractN QRS complex detectors simultaneously monitor N ECG channels. Once a detection occurs in a given channel, a 150 ms long window is opened to look for detections in other channels. Within this window, yn = + 1 if a QRS complex is detected and yn = − 1 otherwise. A coefficient α n, obtained during a training period and related to the detection performance in channel n, multiplies the detection signal yn, so that greater weights are assigned to ECG channels where single-channel detectors performed better. Finally, the binary detection decision (f ) is obtained from the comparison of the weighted sum of single-channel detections (z) with a fixed threshold (β). QRS complex detection (dpeaa)DE-He213 Electrocardiography (dpeaa)DE-He213 Digital filters (dpeaa)DE-He213 Optimal data fusion (dpeaa)DE-He213 Detection algorithms (dpeaa)DE-He213 Altuve, Miguel (orcid)0000-0002-4064-2601 aut Enthalten in Medical & biological engineering & computing Cham : Springer Nature, 1963 57(2019), 8 vom: 17. Mai, Seite 1673-1681 (DE-627)331747456 (DE-600)2052667-2 1741-0444 nnns volume:57 year:2019 number:8 day:17 month:05 pages:1673-1681 https://dx.doi.org/10.1007/s11517-019-01990-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_206 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2070 GBV_ILN_2086 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2116 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 57 2019 8 17 05 1673-1681 |
spelling |
10.1007/s11517-019-01990-3 doi (DE-627)SPR020522487 (SPR)s11517-019-01990-3-e DE-627 ger DE-627 rakwb eng Ledezma, Carlos A. verfasserin aut Optimal data fusion for the improvement of QRS complex detection in multi-channel ECG recordings 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © International Federation for Medical and Biological Engineering 2019 Abstract The automatic analysis of the electrocardiogram (ECG) begins, traditionally, with the detection of QRS complexes. Afterwards, useful information can be extracted from it, ranging from the estimation of the instantaneous heart rate to nonlinear heart rate variability analysis. A plethora of works have been published on this topic; consequently, there exist many QRS complex detectors with high-performance values. However, just a few detectors have been conceived that profit from the information contained in several ECG leads to provide a robust QRS complex detection. In this work, we explore the fusion of multi-channel ECG recordings QRS detections as a means to improve the detection performance. This paper presents a decentralized multi-channel QRS complex fusion scheme that optimally combines single-channel detections to produce a single detection signal. Using six different widely used QRS complex detectors on the MIT-BIH Arrhythmia and INCART databases, a reduction in false and missed detections was achieved with the proposed approach compared with the single-channel counterpart. Furthermore, our detection results are comparable with the performance of other multi-channel detectors found in the literature, showing, in turn, various advantages in scalability, adaptability, and simplicity in the system’s implementation Graphical AbstractN QRS complex detectors simultaneously monitor N ECG channels. Once a detection occurs in a given channel, a 150 ms long window is opened to look for detections in other channels. Within this window, yn = + 1 if a QRS complex is detected and yn = − 1 otherwise. A coefficient α n, obtained during a training period and related to the detection performance in channel n, multiplies the detection signal yn, so that greater weights are assigned to ECG channels where single-channel detectors performed better. Finally, the binary detection decision (f ) is obtained from the comparison of the weighted sum of single-channel detections (z) with a fixed threshold (β). QRS complex detection (dpeaa)DE-He213 Electrocardiography (dpeaa)DE-He213 Digital filters (dpeaa)DE-He213 Optimal data fusion (dpeaa)DE-He213 Detection algorithms (dpeaa)DE-He213 Altuve, Miguel (orcid)0000-0002-4064-2601 aut Enthalten in Medical & biological engineering & computing Cham : Springer Nature, 1963 57(2019), 8 vom: 17. Mai, Seite 1673-1681 (DE-627)331747456 (DE-600)2052667-2 1741-0444 nnns volume:57 year:2019 number:8 day:17 month:05 pages:1673-1681 https://dx.doi.org/10.1007/s11517-019-01990-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_206 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2070 GBV_ILN_2086 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2116 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 57 2019 8 17 05 1673-1681 |
allfields_unstemmed |
10.1007/s11517-019-01990-3 doi (DE-627)SPR020522487 (SPR)s11517-019-01990-3-e DE-627 ger DE-627 rakwb eng Ledezma, Carlos A. verfasserin aut Optimal data fusion for the improvement of QRS complex detection in multi-channel ECG recordings 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © International Federation for Medical and Biological Engineering 2019 Abstract The automatic analysis of the electrocardiogram (ECG) begins, traditionally, with the detection of QRS complexes. Afterwards, useful information can be extracted from it, ranging from the estimation of the instantaneous heart rate to nonlinear heart rate variability analysis. A plethora of works have been published on this topic; consequently, there exist many QRS complex detectors with high-performance values. However, just a few detectors have been conceived that profit from the information contained in several ECG leads to provide a robust QRS complex detection. In this work, we explore the fusion of multi-channel ECG recordings QRS detections as a means to improve the detection performance. This paper presents a decentralized multi-channel QRS complex fusion scheme that optimally combines single-channel detections to produce a single detection signal. Using six different widely used QRS complex detectors on the MIT-BIH Arrhythmia and INCART databases, a reduction in false and missed detections was achieved with the proposed approach compared with the single-channel counterpart. Furthermore, our detection results are comparable with the performance of other multi-channel detectors found in the literature, showing, in turn, various advantages in scalability, adaptability, and simplicity in the system’s implementation Graphical AbstractN QRS complex detectors simultaneously monitor N ECG channels. Once a detection occurs in a given channel, a 150 ms long window is opened to look for detections in other channels. Within this window, yn = + 1 if a QRS complex is detected and yn = − 1 otherwise. A coefficient α n, obtained during a training period and related to the detection performance in channel n, multiplies the detection signal yn, so that greater weights are assigned to ECG channels where single-channel detectors performed better. Finally, the binary detection decision (f ) is obtained from the comparison of the weighted sum of single-channel detections (z) with a fixed threshold (β). QRS complex detection (dpeaa)DE-He213 Electrocardiography (dpeaa)DE-He213 Digital filters (dpeaa)DE-He213 Optimal data fusion (dpeaa)DE-He213 Detection algorithms (dpeaa)DE-He213 Altuve, Miguel (orcid)0000-0002-4064-2601 aut Enthalten in Medical & biological engineering & computing Cham : Springer Nature, 1963 57(2019), 8 vom: 17. Mai, Seite 1673-1681 (DE-627)331747456 (DE-600)2052667-2 1741-0444 nnns volume:57 year:2019 number:8 day:17 month:05 pages:1673-1681 https://dx.doi.org/10.1007/s11517-019-01990-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_206 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2070 GBV_ILN_2086 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2116 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 57 2019 8 17 05 1673-1681 |
allfieldsGer |
10.1007/s11517-019-01990-3 doi (DE-627)SPR020522487 (SPR)s11517-019-01990-3-e DE-627 ger DE-627 rakwb eng Ledezma, Carlos A. verfasserin aut Optimal data fusion for the improvement of QRS complex detection in multi-channel ECG recordings 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © International Federation for Medical and Biological Engineering 2019 Abstract The automatic analysis of the electrocardiogram (ECG) begins, traditionally, with the detection of QRS complexes. Afterwards, useful information can be extracted from it, ranging from the estimation of the instantaneous heart rate to nonlinear heart rate variability analysis. A plethora of works have been published on this topic; consequently, there exist many QRS complex detectors with high-performance values. However, just a few detectors have been conceived that profit from the information contained in several ECG leads to provide a robust QRS complex detection. In this work, we explore the fusion of multi-channel ECG recordings QRS detections as a means to improve the detection performance. This paper presents a decentralized multi-channel QRS complex fusion scheme that optimally combines single-channel detections to produce a single detection signal. Using six different widely used QRS complex detectors on the MIT-BIH Arrhythmia and INCART databases, a reduction in false and missed detections was achieved with the proposed approach compared with the single-channel counterpart. Furthermore, our detection results are comparable with the performance of other multi-channel detectors found in the literature, showing, in turn, various advantages in scalability, adaptability, and simplicity in the system’s implementation Graphical AbstractN QRS complex detectors simultaneously monitor N ECG channels. Once a detection occurs in a given channel, a 150 ms long window is opened to look for detections in other channels. Within this window, yn = + 1 if a QRS complex is detected and yn = − 1 otherwise. A coefficient α n, obtained during a training period and related to the detection performance in channel n, multiplies the detection signal yn, so that greater weights are assigned to ECG channels where single-channel detectors performed better. Finally, the binary detection decision (f ) is obtained from the comparison of the weighted sum of single-channel detections (z) with a fixed threshold (β). QRS complex detection (dpeaa)DE-He213 Electrocardiography (dpeaa)DE-He213 Digital filters (dpeaa)DE-He213 Optimal data fusion (dpeaa)DE-He213 Detection algorithms (dpeaa)DE-He213 Altuve, Miguel (orcid)0000-0002-4064-2601 aut Enthalten in Medical & biological engineering & computing Cham : Springer Nature, 1963 57(2019), 8 vom: 17. Mai, Seite 1673-1681 (DE-627)331747456 (DE-600)2052667-2 1741-0444 nnns volume:57 year:2019 number:8 day:17 month:05 pages:1673-1681 https://dx.doi.org/10.1007/s11517-019-01990-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_206 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2070 GBV_ILN_2086 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2116 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 57 2019 8 17 05 1673-1681 |
allfieldsSound |
10.1007/s11517-019-01990-3 doi (DE-627)SPR020522487 (SPR)s11517-019-01990-3-e DE-627 ger DE-627 rakwb eng Ledezma, Carlos A. verfasserin aut Optimal data fusion for the improvement of QRS complex detection in multi-channel ECG recordings 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © International Federation for Medical and Biological Engineering 2019 Abstract The automatic analysis of the electrocardiogram (ECG) begins, traditionally, with the detection of QRS complexes. Afterwards, useful information can be extracted from it, ranging from the estimation of the instantaneous heart rate to nonlinear heart rate variability analysis. A plethora of works have been published on this topic; consequently, there exist many QRS complex detectors with high-performance values. However, just a few detectors have been conceived that profit from the information contained in several ECG leads to provide a robust QRS complex detection. In this work, we explore the fusion of multi-channel ECG recordings QRS detections as a means to improve the detection performance. This paper presents a decentralized multi-channel QRS complex fusion scheme that optimally combines single-channel detections to produce a single detection signal. Using six different widely used QRS complex detectors on the MIT-BIH Arrhythmia and INCART databases, a reduction in false and missed detections was achieved with the proposed approach compared with the single-channel counterpart. Furthermore, our detection results are comparable with the performance of other multi-channel detectors found in the literature, showing, in turn, various advantages in scalability, adaptability, and simplicity in the system’s implementation Graphical AbstractN QRS complex detectors simultaneously monitor N ECG channels. Once a detection occurs in a given channel, a 150 ms long window is opened to look for detections in other channels. Within this window, yn = + 1 if a QRS complex is detected and yn = − 1 otherwise. A coefficient α n, obtained during a training period and related to the detection performance in channel n, multiplies the detection signal yn, so that greater weights are assigned to ECG channels where single-channel detectors performed better. Finally, the binary detection decision (f ) is obtained from the comparison of the weighted sum of single-channel detections (z) with a fixed threshold (β). QRS complex detection (dpeaa)DE-He213 Electrocardiography (dpeaa)DE-He213 Digital filters (dpeaa)DE-He213 Optimal data fusion (dpeaa)DE-He213 Detection algorithms (dpeaa)DE-He213 Altuve, Miguel (orcid)0000-0002-4064-2601 aut Enthalten in Medical & biological engineering & computing Cham : Springer Nature, 1963 57(2019), 8 vom: 17. Mai, Seite 1673-1681 (DE-627)331747456 (DE-600)2052667-2 1741-0444 nnns volume:57 year:2019 number:8 day:17 month:05 pages:1673-1681 https://dx.doi.org/10.1007/s11517-019-01990-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_206 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2070 GBV_ILN_2086 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2116 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 57 2019 8 17 05 1673-1681 |
language |
English |
source |
Enthalten in Medical & biological engineering & computing 57(2019), 8 vom: 17. Mai, Seite 1673-1681 volume:57 year:2019 number:8 day:17 month:05 pages:1673-1681 |
sourceStr |
Enthalten in Medical & biological engineering & computing 57(2019), 8 vom: 17. Mai, Seite 1673-1681 volume:57 year:2019 number:8 day:17 month:05 pages:1673-1681 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
QRS complex detection Electrocardiography Digital filters Optimal data fusion Detection algorithms |
isfreeaccess_bool |
false |
container_title |
Medical & biological engineering & computing |
authorswithroles_txt_mv |
Ledezma, Carlos A. @@aut@@ Altuve, Miguel @@aut@@ |
publishDateDaySort_date |
2019-05-17T00:00:00Z |
hierarchy_top_id |
331747456 |
id |
SPR020522487 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR020522487</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230519235854.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201006s2019 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11517-019-01990-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR020522487</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s11517-019-01990-3-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ledezma, Carlos A.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimal data fusion for the improvement of QRS complex detection in multi-channel ECG recordings</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© International Federation for Medical and Biological Engineering 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The automatic analysis of the electrocardiogram (ECG) begins, traditionally, with the detection of QRS complexes. Afterwards, useful information can be extracted from it, ranging from the estimation of the instantaneous heart rate to nonlinear heart rate variability analysis. A plethora of works have been published on this topic; consequently, there exist many QRS complex detectors with high-performance values. However, just a few detectors have been conceived that profit from the information contained in several ECG leads to provide a robust QRS complex detection. In this work, we explore the fusion of multi-channel ECG recordings QRS detections as a means to improve the detection performance. This paper presents a decentralized multi-channel QRS complex fusion scheme that optimally combines single-channel detections to produce a single detection signal. Using six different widely used QRS complex detectors on the MIT-BIH Arrhythmia and INCART databases, a reduction in false and missed detections was achieved with the proposed approach compared with the single-channel counterpart. Furthermore, our detection results are comparable with the performance of other multi-channel detectors found in the literature, showing, in turn, various advantages in scalability, adaptability, and simplicity in the system’s implementation Graphical AbstractN QRS complex detectors simultaneously monitor N ECG channels. Once a detection occurs in a given channel, a 150 ms long window is opened to look for detections in other channels. Within this window, yn = + 1 if a QRS complex is detected and yn = − 1 otherwise. A coefficient α n, obtained during a training period and related to the detection performance in channel n, multiplies the detection signal yn, so that greater weights are assigned to ECG channels where single-channel detectors performed better. Finally, the binary detection decision (f ) is obtained from the comparison of the weighted sum of single-channel detections (z) with a fixed threshold (β).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">QRS complex detection</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrocardiography</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Digital filters</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimal data fusion</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Detection algorithms</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Altuve, Miguel</subfield><subfield code="0">(orcid)0000-0002-4064-2601</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Medical & biological engineering & computing</subfield><subfield code="d">Cham : Springer Nature, 1963</subfield><subfield code="g">57(2019), 8 vom: 17. Mai, Seite 1673-1681</subfield><subfield code="w">(DE-627)331747456</subfield><subfield code="w">(DE-600)2052667-2</subfield><subfield code="x">1741-0444</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:57</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:8</subfield><subfield code="g">day:17</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:1673-1681</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s11517-019-01990-3</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_138</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_171</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_636</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_647</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2031</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2039</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2070</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2086</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2093</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2107</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2116</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2119</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2144</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2188</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2446</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2472</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2548</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4246</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4328</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">57</subfield><subfield code="j">2019</subfield><subfield code="e">8</subfield><subfield code="b">17</subfield><subfield code="c">05</subfield><subfield code="h">1673-1681</subfield></datafield></record></collection>
|
author |
Ledezma, Carlos A. |
spellingShingle |
Ledezma, Carlos A. misc QRS complex detection misc Electrocardiography misc Digital filters misc Optimal data fusion misc Detection algorithms Optimal data fusion for the improvement of QRS complex detection in multi-channel ECG recordings |
authorStr |
Ledezma, Carlos A. |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)331747456 |
format |
electronic Article |
delete_txt_mv |
keep |
author_role |
aut aut |
collection |
springer |
remote_str |
true |
illustrated |
Not Illustrated |
issn |
1741-0444 |
topic_title |
Optimal data fusion for the improvement of QRS complex detection in multi-channel ECG recordings QRS complex detection (dpeaa)DE-He213 Electrocardiography (dpeaa)DE-He213 Digital filters (dpeaa)DE-He213 Optimal data fusion (dpeaa)DE-He213 Detection algorithms (dpeaa)DE-He213 |
topic |
misc QRS complex detection misc Electrocardiography misc Digital filters misc Optimal data fusion misc Detection algorithms |
topic_unstemmed |
misc QRS complex detection misc Electrocardiography misc Digital filters misc Optimal data fusion misc Detection algorithms |
topic_browse |
misc QRS complex detection misc Electrocardiography misc Digital filters misc Optimal data fusion misc Detection algorithms |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Medical & biological engineering & computing |
hierarchy_parent_id |
331747456 |
hierarchy_top_title |
Medical & biological engineering & computing |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)331747456 (DE-600)2052667-2 |
title |
Optimal data fusion for the improvement of QRS complex detection in multi-channel ECG recordings |
ctrlnum |
(DE-627)SPR020522487 (SPR)s11517-019-01990-3-e |
title_full |
Optimal data fusion for the improvement of QRS complex detection in multi-channel ECG recordings |
author_sort |
Ledezma, Carlos A. |
journal |
Medical & biological engineering & computing |
journalStr |
Medical & biological engineering & computing |
lang_code |
eng |
isOA_bool |
false |
recordtype |
marc |
publishDateSort |
2019 |
contenttype_str_mv |
txt |
container_start_page |
1673 |
author_browse |
Ledezma, Carlos A. Altuve, Miguel |
container_volume |
57 |
format_se |
Elektronische Aufsätze |
author-letter |
Ledezma, Carlos A. |
doi_str_mv |
10.1007/s11517-019-01990-3 |
normlink |
(ORCID)0000-0002-4064-2601 |
normlink_prefix_str_mv |
(orcid)0000-0002-4064-2601 |
title_sort |
optimal data fusion for the improvement of qrs complex detection in multi-channel ecg recordings |
title_auth |
Optimal data fusion for the improvement of QRS complex detection in multi-channel ECG recordings |
abstract |
Abstract The automatic analysis of the electrocardiogram (ECG) begins, traditionally, with the detection of QRS complexes. Afterwards, useful information can be extracted from it, ranging from the estimation of the instantaneous heart rate to nonlinear heart rate variability analysis. A plethora of works have been published on this topic; consequently, there exist many QRS complex detectors with high-performance values. However, just a few detectors have been conceived that profit from the information contained in several ECG leads to provide a robust QRS complex detection. In this work, we explore the fusion of multi-channel ECG recordings QRS detections as a means to improve the detection performance. This paper presents a decentralized multi-channel QRS complex fusion scheme that optimally combines single-channel detections to produce a single detection signal. Using six different widely used QRS complex detectors on the MIT-BIH Arrhythmia and INCART databases, a reduction in false and missed detections was achieved with the proposed approach compared with the single-channel counterpart. Furthermore, our detection results are comparable with the performance of other multi-channel detectors found in the literature, showing, in turn, various advantages in scalability, adaptability, and simplicity in the system’s implementation Graphical AbstractN QRS complex detectors simultaneously monitor N ECG channels. Once a detection occurs in a given channel, a 150 ms long window is opened to look for detections in other channels. Within this window, yn = + 1 if a QRS complex is detected and yn = − 1 otherwise. A coefficient α n, obtained during a training period and related to the detection performance in channel n, multiplies the detection signal yn, so that greater weights are assigned to ECG channels where single-channel detectors performed better. Finally, the binary detection decision (f ) is obtained from the comparison of the weighted sum of single-channel detections (z) with a fixed threshold (β). © International Federation for Medical and Biological Engineering 2019 |
abstractGer |
Abstract The automatic analysis of the electrocardiogram (ECG) begins, traditionally, with the detection of QRS complexes. Afterwards, useful information can be extracted from it, ranging from the estimation of the instantaneous heart rate to nonlinear heart rate variability analysis. A plethora of works have been published on this topic; consequently, there exist many QRS complex detectors with high-performance values. However, just a few detectors have been conceived that profit from the information contained in several ECG leads to provide a robust QRS complex detection. In this work, we explore the fusion of multi-channel ECG recordings QRS detections as a means to improve the detection performance. This paper presents a decentralized multi-channel QRS complex fusion scheme that optimally combines single-channel detections to produce a single detection signal. Using six different widely used QRS complex detectors on the MIT-BIH Arrhythmia and INCART databases, a reduction in false and missed detections was achieved with the proposed approach compared with the single-channel counterpart. Furthermore, our detection results are comparable with the performance of other multi-channel detectors found in the literature, showing, in turn, various advantages in scalability, adaptability, and simplicity in the system’s implementation Graphical AbstractN QRS complex detectors simultaneously monitor N ECG channels. Once a detection occurs in a given channel, a 150 ms long window is opened to look for detections in other channels. Within this window, yn = + 1 if a QRS complex is detected and yn = − 1 otherwise. A coefficient α n, obtained during a training period and related to the detection performance in channel n, multiplies the detection signal yn, so that greater weights are assigned to ECG channels where single-channel detectors performed better. Finally, the binary detection decision (f ) is obtained from the comparison of the weighted sum of single-channel detections (z) with a fixed threshold (β). © International Federation for Medical and Biological Engineering 2019 |
abstract_unstemmed |
Abstract The automatic analysis of the electrocardiogram (ECG) begins, traditionally, with the detection of QRS complexes. Afterwards, useful information can be extracted from it, ranging from the estimation of the instantaneous heart rate to nonlinear heart rate variability analysis. A plethora of works have been published on this topic; consequently, there exist many QRS complex detectors with high-performance values. However, just a few detectors have been conceived that profit from the information contained in several ECG leads to provide a robust QRS complex detection. In this work, we explore the fusion of multi-channel ECG recordings QRS detections as a means to improve the detection performance. This paper presents a decentralized multi-channel QRS complex fusion scheme that optimally combines single-channel detections to produce a single detection signal. Using six different widely used QRS complex detectors on the MIT-BIH Arrhythmia and INCART databases, a reduction in false and missed detections was achieved with the proposed approach compared with the single-channel counterpart. Furthermore, our detection results are comparable with the performance of other multi-channel detectors found in the literature, showing, in turn, various advantages in scalability, adaptability, and simplicity in the system’s implementation Graphical AbstractN QRS complex detectors simultaneously monitor N ECG channels. Once a detection occurs in a given channel, a 150 ms long window is opened to look for detections in other channels. Within this window, yn = + 1 if a QRS complex is detected and yn = − 1 otherwise. A coefficient α n, obtained during a training period and related to the detection performance in channel n, multiplies the detection signal yn, so that greater weights are assigned to ECG channels where single-channel detectors performed better. Finally, the binary detection decision (f ) is obtained from the comparison of the weighted sum of single-channel detections (z) with a fixed threshold (β). © International Federation for Medical and Biological Engineering 2019 |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_206 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2070 GBV_ILN_2086 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2116 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 |
container_issue |
8 |
title_short |
Optimal data fusion for the improvement of QRS complex detection in multi-channel ECG recordings |
url |
https://dx.doi.org/10.1007/s11517-019-01990-3 |
remote_bool |
true |
author2 |
Altuve, Miguel |
author2Str |
Altuve, Miguel |
ppnlink |
331747456 |
mediatype_str_mv |
c |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/s11517-019-01990-3 |
up_date |
2024-07-03T16:35:19.102Z |
_version_ |
1803576430142947328 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR020522487</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230519235854.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201006s2019 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11517-019-01990-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR020522487</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s11517-019-01990-3-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ledezma, Carlos A.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimal data fusion for the improvement of QRS complex detection in multi-channel ECG recordings</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© International Federation for Medical and Biological Engineering 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The automatic analysis of the electrocardiogram (ECG) begins, traditionally, with the detection of QRS complexes. Afterwards, useful information can be extracted from it, ranging from the estimation of the instantaneous heart rate to nonlinear heart rate variability analysis. A plethora of works have been published on this topic; consequently, there exist many QRS complex detectors with high-performance values. However, just a few detectors have been conceived that profit from the information contained in several ECG leads to provide a robust QRS complex detection. In this work, we explore the fusion of multi-channel ECG recordings QRS detections as a means to improve the detection performance. This paper presents a decentralized multi-channel QRS complex fusion scheme that optimally combines single-channel detections to produce a single detection signal. Using six different widely used QRS complex detectors on the MIT-BIH Arrhythmia and INCART databases, a reduction in false and missed detections was achieved with the proposed approach compared with the single-channel counterpart. Furthermore, our detection results are comparable with the performance of other multi-channel detectors found in the literature, showing, in turn, various advantages in scalability, adaptability, and simplicity in the system’s implementation Graphical AbstractN QRS complex detectors simultaneously monitor N ECG channels. Once a detection occurs in a given channel, a 150 ms long window is opened to look for detections in other channels. Within this window, yn = + 1 if a QRS complex is detected and yn = − 1 otherwise. A coefficient α n, obtained during a training period and related to the detection performance in channel n, multiplies the detection signal yn, so that greater weights are assigned to ECG channels where single-channel detectors performed better. Finally, the binary detection decision (f ) is obtained from the comparison of the weighted sum of single-channel detections (z) with a fixed threshold (β).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">QRS complex detection</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrocardiography</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Digital filters</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimal data fusion</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Detection algorithms</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Altuve, Miguel</subfield><subfield code="0">(orcid)0000-0002-4064-2601</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Medical & biological engineering & computing</subfield><subfield code="d">Cham : Springer Nature, 1963</subfield><subfield code="g">57(2019), 8 vom: 17. Mai, Seite 1673-1681</subfield><subfield code="w">(DE-627)331747456</subfield><subfield code="w">(DE-600)2052667-2</subfield><subfield code="x">1741-0444</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:57</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:8</subfield><subfield code="g">day:17</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:1673-1681</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s11517-019-01990-3</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_138</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_171</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_636</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_647</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2031</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2039</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2070</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2086</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2093</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2107</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2116</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2119</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2144</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2188</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2446</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2472</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2548</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4246</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4328</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">57</subfield><subfield code="j">2019</subfield><subfield code="e">8</subfield><subfield code="b">17</subfield><subfield code="c">05</subfield><subfield code="h">1673-1681</subfield></datafield></record></collection>
|
score |
7.3994884 |