手法を比較

	変分モード分解（VMD）	経験的モード分解 (EMD)	フーリエ変換とスペクトル解析 (FFT)
分野	信号処理	信号処理	信号処理
系統	Machine learning	Machine learning	Machine learning
提唱年	2014	1998	1965
提唱者	Konstantin Dragomiretskiy & Dominique Zosso	Norden Huang et al.	James Cooley & John Tukey (FFT)
種類	Adaptive variational signal decomposition algorithm	Adaptive data-driven decomposition algorithm	Frequency-domain decomposition algorithm
原典	Dragomiretskiy, K., & Zosso, D. (2014). Variational mode decomposition. IEEE Transactions on Signal Processing, 62(3), 531–544.	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.
別名	VMD, Adaptive Signal Decomposition, Variational Signal Decomposition, Varyasyonel Mod Ayrıştırma	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
概要	Variational Mode Decomposition (VMD) is a fully adaptive, non-recursive signal decomposition method introduced by Konstantin Dragomiretskiy and Dominique Zosso in 2014. It decomposes a real-valued input signal into a discrete number of sub-signals, called intrinsic mode functions (IMFs), each with a specific sparsity in the frequency domain. Unlike Empirical Mode Decomposition, VMD frames decomposition as a variational optimization problem solved via the Alternating Direction Method of Multipliers (ADMM), yielding robust and physically meaningful components.	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.