Processing math: 100%

Forward fft: 

fft(x+iy)=X+iY=(x+iy)(Wr+iWi)

=(xWryWi)+i(xWi+yWr)

Inverse fft:

ifft(X+iY)=1N(X+iY)(WriWi)

=1N(XWr+YWi)+i(XWi+YWr)

=1N(XWr(Y)Wi)+(i)(XWi+(Y)Wr)

=1N[fft(XiY)]=1N[fft((X+iY))]

또는 

1Nfft(Y+iX)=1N(Y+iX)(Wr+iWi)

=1N(YWrXWi)+i(YWi+XWr)=y+ix

728x90

'Image Recognition > Fundamental' 카테고리의 다른 글

FFT 구현  (0) 2024.07.31
CLAHE (2)  (1) 2024.06.26
Approximate Distance Transform  (0) 2024.06.02
Graph-based Segmentation  (1) 2024.05.26
Linear Least Square Fitting: perpendicular offsets  (0) 2024.03.22
,