Transcription of 2D Fourier Transforms
{{id}} {{{paragraph}}}
2D Fourier TransformsIn 2D, for signalsh(n;m)withNcolumns andMrows, the idea isexactly the same:^h(k;l)=N 1Xn=0M 1Xm=0e i(!kn+!lm)h(n;m)h(n;m)=1 NMN 1Xk=0M 1Xl=0ei(!kn+!lm)^h(k;l)Often it is convenient to express frequency in vector notation with~k=(k;l)t,~n=(n;m)t,~!kl=(!k;!l)tand ~!t~n=!kn+! Fourier Basis Functions:Sinusoidal waveforms of differentwavelengths (scales) and orientations. Sinusoids onN Mimageswith 2D frequency~!kl=(!k;!l)=2 (k=N;l=M)are given by:ei(~!t~n)=ei!knei!lm=cos(~!t~n)+isin( ~!t~n)Separability:Ifh(~n)is separable, ,h(n;m)=f(n)g(m), then,because complex exponentials are also separable, so is the Fourierspectrum,^h(k;l)=^f(k)^g(l).320: Linear Filters, Sampling, & Fourier AnalysisPage: 12D Fourier Basis FunctionsImagRealGrating for (k,l) = (1,-3)RealGrating for (k,l) = (7,1)Blocks image and its amplitude spectrum320: Linear Filters, Sampling, & Fourier AnalysisPage: 2 Properties of the Fourier TransformSome key properties of the Fourier transform ,^f(~!)
In words, the distance between samples must be smaller than half a wavelength of the highest frequency in the signal. original signal spectrum down-sampled spectrum for up-sampled and low-pass filtered Here the replicas can be isolated by an ideal low-pass filter (the dotted pass-band), so the original signal can be perfectly reconstructed ...
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}