방법 비교

	웨이블릿 신호 디노이징 (소프트 임계값 처리)	Empirical Mode Decomposition (EMD)	푸리에 변환과 스펙트럼 분석 (FFT)
분야	신호처리	신호처리	신호처리
계열	Machine learning	Machine learning	Machine learning
기원 연도	1995	1998	1965
창시자	David Donoho	Norden Huang et al.	James Cooley & John Tukey (FFT)
유형	Non-parametric signal estimation	Adaptive data-driven decomposition algorithm	Frequency-domain decomposition algorithm
원전	Donoho, D. L. (1995). De-noising by soft-thresholding. IEEE Transactions on Information Theory, 41(3), 613–627.	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.
별칭	Wavelet Shrinkage, Donoho-Johnstone Denoising, Soft Thresholding Denoising, Sinyal Gürültü Giderme	EMD, Intrinsic Mode Decomposition, Adaptive Signal Decomposition, Ampirik Mod Ayrıştırma	Fast Fourier Transform, Discrete Fourier Transform, Spectral Analysis, Fourier Dönüşümü
관련	3	3	2
요약	Wavelet signal denoising, introduced by David Donoho in 1995, is a non-parametric technique that removes noise from one-dimensional or multidimensional signals by decomposing them into wavelet coefficients, suppressing small coefficients that likely represent noise via a soft-thresholding operator, and reconstructing a smooth estimate. It is widely used in biomedical signal processing, geophysics, audio engineering, and image analysis where the underlying signal is assumed to be sparse or piecewise smooth.	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.