方法对比

	希尔伯特-黄变换	经验模态分解 (EMD)	傅里叶变换与谱分析 (FFT)
领域	信号处理	信号处理	信号处理
方法族	Machine learning	Machine learning	Machine learning
起源年份	1998	1998	1965
提出者	Norden Huang et al.	Norden Huang et al.	James Cooley & John Tukey (FFT)
类型	Adaptive time-frequency analysis method	Adaptive data-driven decomposition algorithm	Frequency-domain decomposition algorithm
开创性文献	Huang, N. E., et al. (1998). The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysis. Proceedings of the Royal Society A, 454(1971), 903–995.	Huang, N. E., et al. (1998). The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysis. Proceedings of the Royal Society A, 454(1971), 903–995.	Cooley, J. W., & Tukey, J. W. (1965). An algorithm for the machine calculation of complex Fourier series. Mathematics of Computation, 19(90), 297–301.
别名	HHT, EMD-Hilbert Spectral Analysis, Hilbert Spektral Analizi, Adaptive Time-Frequency Decomposition	EMD, Intrinsic Mode Decomposition, Adaptive Signal Decomposition, Ampirik Mod Ayrıştırma	Fast Fourier Transform, Discrete Fourier Transform, Spectral Analysis, Fourier Dönüşümü
相关	2	3	2
摘要	The Hilbert-Huang Transform (HHT) is an adaptive, data-driven method for analyzing non-linear and non-stationary time series, introduced by Norden E. Huang and colleagues in 1998. It combines Empirical Mode Decomposition (EMD), which decomposes a signal into intrinsic mode functions (IMFs), with the Hilbert spectral analysis to produce instantaneous frequency and amplitude representations without assuming signal stationarity or linearity.	Empirical Mode Decomposition (EMD) is a fully data-driven, adaptive method for decomposing nonlinear and non-stationary time series into a finite set of oscillatory components called Intrinsic Mode Functions (IMFs), plus a monotonic residue. Introduced by Norden E. Huang and colleagues at NASA in 1998, EMD requires no predefined basis functions and derives all components directly from the signal itself, making it fundamentally different from Fourier or wavelet transforms.	The Fourier Transform decomposes a time-domain signal into its constituent sinusoidal frequencies, revealing the spectral content hidden within complex waveforms. Joseph Fourier introduced the continuous transform in 1822, but the computationally efficient Fast Fourier Transform (FFT) was formalized by James Cooley and John Tukey in 1965. Their landmark algorithm reduced the computational complexity from O(N²) to O(N log N), making large-scale spectral analysis practical across engineering, physics, and data science.