相关实验视频

Updated: May 1, 2026

Estimating Bilateral Atrial Function by Cardiovascular Magnetic Resonance Feature Tracking in Patients with Paroxysmal Atrial Fibrillation
08:10

Estimating Bilateral Atrial Function by Cardiovascular Magnetic Resonance Feature Tracking in Patients with Paroxysmal Atrial Fibrillation

Published on: July 20, 2022

1.6K

时间频率转换与轻量级卷积神经网络集成,用于检测心肌梗塞

Kashvi Ankitbhai Sheth1, Charvi Upreti1, Manas Ranjan Prusty2

  • 1School of Computer Science and Engineering, Vellore Institute of Technology, Chennai, 600127, India.

BMC medical imaging
|December 2, 2024
PubMed
概括

这项研究引入了一种使用离散波纹转换 (DWT) 和卷积神经网络 (CNN) 检测心肌梗塞 (MI) 从心电图信号的自动化方法. 这种新的方法在区分心脏病发作和正常心律方面取得了很高的准确性.

关键词:
卷积神经网络 (CNN) 是一种神经网络.离散波形变换 (DWT) 是指离散波形变换.电动心电图信号 电动心电图信号电心电图 (ECG) 是一种心电图.心肌梗塞 (MI) 是一种心肌梗塞.时间频率转换的时间频率转换.

更多相关视频

Author Spotlight: Advancing Cardiovascular Imaging - Introducing the Spatially Weighted Calcium Score for Early Disease Detection06:57

Author Spotlight: Advancing Cardiovascular Imaging - Introducing the Spatially Weighted Calcium Score for Early Disease Detection

Published on: September 22, 2023

928
Author Spotlight: A Novel Standardized Technique for Real-Time Biomedical Imaging of Acute Myocardial Injury07:17

Author Spotlight: A Novel Standardized Technique for Real-Time Biomedical Imaging of Acute Myocardial Injury

Published on: March 22, 2024

951

相关概念视频

Continuous -time Fourier Transform01:11

Continuous -time Fourier Transform

The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
1.3K
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
1.3K