Characterization of fractionated electrograms using a novel time-frequency based algorithm
Behnaz Ghoraani1, Sridhar Krishnan, Vijay S Chauhan
1Division of Cardiology, University Health Network, Toronto, ON, Canada.
Summary
This study introduces a new time-frequency algorithm to identify complex fractionated atrial electrograms (CFAE) in patients with atrial fibrillation (AF). The method accurately distinguishes CFAE sites, potentially improving catheter ablation strategies for AF.
Area of Science:
- Cardiology
- Biomedical Engineering
- Signal Processing
Background:
- Atrial fibrillation (AF) is a complex arrhythmia driven by abnormal heart rhythms.
- Catheter ablation using Radiofrequency (RF) energy is a primary treatment for drug-resistant AF.
- Identifying the specific sites that perpetuate AF, such as complex fractionated atrial electrograms (CFAE), is crucial for successful ablation.
Purpose of the Study:
- To develop and validate a novel time-frequency (TF) based algorithm for characterizing CFAE.
- To create an automated classifier to differentiate CFAE from non-CFAE electrograms (EGMs).
- To explore the potential of this technique as a reliable mapping tool for understanding AF mechanisms.
Main Methods:
- A novel time-frequency (TF) based algorithm was proposed to analyze electrograms (EGMs).
- The algorithm extracts 5 TF features using TF matrix decomposition.
- An automated classifier was trained based on the differences in TF structures between CFAE and non-CFAE EGMs.
Main Results:
- The proposed TF-based algorithm successfully identified CFAE versus non-CFAE EGMs in 5 AF patients.
- The method demonstrated accuracy in distinguishing between different EGM types.
- Quantification of TF features provided a basis for automated classification.
Conclusions:
- The novel TF-based algorithm shows promise for accurately characterizing CFAE.
- This technique may offer new perspectives for developing reliable mapping methods in AF.
- Improved characterization of AF mechanisms through advanced signal processing could enhance catheter ablation outcomes.
Related Concept Videos
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
Discrete Fourier Transform
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
Aliasing
Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original signal...
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original signal...

