Related Experiment Video
Updated: May 22, 2026
06:50
Analyzing Neural Activity and Connectivity Using Intracranial EEG Data with SPM Software
Published on: October 30, 2018
Hilbert-Huang transformation-based time-frequency analysis methods in biomedical signal applications
1Department of Electrical Engineering, National Taiwan Ocean University, Taiwan, Republic of China. lcf1024@mail.ntou.edu.tw
Summary
The Hilbert-Huang transformation (HHT) offers advanced time-frequency analysis for complex biomedical signals. This method, combining empirical mode decomposition and Hilbert spectral analysis, reveals detailed signal features for applications in diagnostics.
Area of Science:
- Signal Processing
- Biomedical Engineering
- Non-linear Dynamics
Background:
- Traditional time-frequency analysis methods like Fourier and Wavelet transformations have limitations in analyzing non-linear and non-stationary signals.
- The Hilbert-Huang transformation (HHT) provides a powerful adaptive approach for analyzing complex signal characteristics.
- Previous research has explored HHT for electroencephalogram (EEG) signals in clinical alcoholics and 'sharp I' wave analysis.
Purpose of the Study:
- To discuss the application of Hilbert-Huang transformation-based time-frequency analysis to various biomedical signals.
- To highlight the utility of HHT in extracting time-frequency-energy distributions and features from complex biological data.
- To extend the application of HHT beyond physical signals to the domain of biomedical signal analysis.
Main Methods:
- Empirical Mode Decomposition (EMD): Adaptively decomposes signals into intrinsic mode functions (IMFs) based on signal characteristics.
- Hilbert Spectral Analysis (HSA): Applies Hilbert transforms to IMFs to derive instantaneous frequencies.
- Time-Frequency-Energy Distribution: Generates detailed distributions and features of the analyzed signals.
Main Results:
- HHT successfully decomposes complex biomedical signals into meaningful IMFs.
- Instantaneous frequencies and time-frequency-energy features are effectively extracted for detailed analysis.
- The method demonstrates applicability to electroencephalogram (EEG), electrocardiogram (ECG), electrogastrogram (EGG), and speech signals.
Conclusions:
- Hilbert-Huang transformation is a versatile and effective tool for time-frequency analysis of non-linear and non-stationary biomedical signals.
- HHT offers significant advantages over traditional methods for analyzing complex biological data.
- The findings support the broader application of HHT in biomedical research and clinical diagnostics.
Related Concept Videos
01:26Discrete-time Fourier transform
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
01:20Discrete-Time Fourier Series
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
01:11Continuous -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...
01:15Discrete 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...
01:10Fast 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...
01:24Properties of Fourier Transform II
The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...