Contents. Signals as functions (1D, 2D)
|
|
- Silas James
- 6 years ago
- Views:
Transcription
1 Fourier Transform
2 The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component is a monochromatic light with sinusoidal shape. Following this analogy, each signal can be decomposed into its sinusoidal components which represent its colors. Of course these components in general do not correspond to visible monochromatic light. However, they give an idea of how fast are the changes of the signal. 2
3 Contents Signals as functions (D, 2D) Tools Continuous Time Fourier Transform (CTFT) Discrete Time Fourier Transform (DTFT) Discrete Fourier Transform (DFT) Discrete Cosine Transform (DCT) Sampling theorem 3
4 Fourier Transform Different formulations for the different classes of signals Summary table: Fourier transforms with various combinations of continuous/ discrete time and frequency variables. Notations: CTFT: continuous time FT: t is real and f real (f=ω) (CT, CF) DTFT: Discrete Time FT: t is discrete (t=n), f is real (f=ω) (DT, CF) CTFS: CT Fourier Series (summation synthesis): t is real AND the function is periodic, f is discrete (f=k), (CT, DF) DTFS: DT Fourier Series (summation synthesis): t=n AND the function is periodic, f discrete (f=k), (DT, DF) P: periodical signals T: sampling period ω s : sampling frequency (ω s =2π/T) For DTFT: T= ω s =2π This is a hint for those who are interested in a more exhaustive theoretical approach 4
5 Images as functions Gray scale images: 2D functions Domain of the functions: set of (x,y) values for which f(x,y) is defined : 2D lattice [i,j] defining the pixel locations Set of values taken by the function : gray levels Digital images can be seen as functions defined over a discrete domain {i,j: 0<i<I, 0<j<J} I,J: number of rows (columns) of the matrix corresponding to the image f=f[i,j]: gray level in position [i,j] 5
6 Mathematical Background: Complex Numbers A complex number x is of the form: a: real part, b: imaginary part Addition Multiplication 6
7 Mathematical Background: Complex Numbers (cont d) Magnitude-Phase (i.e.,vector) representation Magnitude: Phase: Phase Magnitude notation: 7
8 Mathematical Background: Complex Numbers (cont d) Multiplication using magnitude-phase representation Complex conjugate Properties 8
9 Euler s formula Mathematical Background: Complex Numbers (cont d) Properties 9
10 Periodic functions Mathematical Background: Sine and Cosine Functions General form of sine and cosine functions: 0
11 Mathematical Background: Sine and Cosine Functions Special case: A=, b=0, a= π π
12 Mathematical Background: Sine and Cosine Functions (cont d) Shifting or translating the sine function by a const b Note: cosine is a shifted sine function: π cos( t) = sin( t+ ) 2 2
13 Mathematical Background: Sine and Cosine Functions (cont d) Changing the amplitude A 3
14 Mathematical Background: Sine and Cosine Functions (cont d) Changing the period T=2π/ α consider A=, b=0: y=cos(αt) α =4 period 2π/4=π/2 shorter period higher frequency (i.e., oscillates faster) Frequency is defined as f=/t Alternative notation: sin(αt)=sin(2πt/t)=sin(2πft) 4
15 Fourier Series Theorem Any periodic function can be expressed as a weighted sum (infinite) of sine and cosine functions of varying frequency: is called the fundamental frequency 5
16 Fourier Series (cont d) α α 2 α 3 6
17 Concept 7
18 Continuous Time Fourier Transform (FT) Transforms a signal (i.e., function) from the spatial domain to the frequency domain. ( ) = f ( t) F ω f t + + ( ) = F ( ω) e jωt dt e jωt dω Time domain Spatial domain where 8
19 CTFT Change of variables for simplified notations: ω=2πu j2πux F(2 πu) F( u) f( x) e dx = = = More compact notations (same as in GW) j2πux j2πux ( π ) f( x) = F( u) e d 2 u = F( u) e du 2π j2πux Fu ( ) = f( xe ) dx j2πux f x = F( u) e du ( ) 9
20 F(u) is a complex function: Definitions Magnitude of FT (spectrum): Phase of FT: Magnitude-Phase representation: Energy of f(x): P(u)= F(u) 2 20
21 Continuous Time Fourier Transform (CTFT) Time is a real variable (t) Frequency is a real variable (ω) Signals : D 2
22 CTFT: Concept A signal can be represented as a weighted sum of sinusoids. Fourier Transform is a change of basis, where the basis functions consist of sins and cosines (complex exponentials). [Gonzalez Chapter 4] 22
23 Continuous Time Fourier Transform (CTFT) T= 23
24 Fourier Transform Cosine/sine signals are easy to define and interpret. Analysis and manipulation of sinusoidal signals is greatly simplified by dealing with related signals called complex exponential signals. A complex number has real and imaginary parts: z = x+j y The Eulero formula links complex exponential signals and trigonometric functions cosα = eiα + e iα ( α α) jα re = r cos + jsin 2 sinα = eiα e iα 2i 24
25 CTFT Continuous Time Fourier Transform Continuous time a-periodic signal Both time (space) and frequency are continuous variables NON normalized frequency ω is used Fourier integral can be regarded as a Fourier series with fundamental frequency approaching zero Fourier spectra are continuous A signal is represented as a sum of sinusoids (or exponentials) of all frequencies over a continuous frequency interval Fourier integral ( ω) = () jωt F f t e dt t jωt f() t = F( ω) e dω 2π ω analysis synthesis 25
26 CTFT of real signals Real signals: each signal sample is a real number Property: the CTFT is Hermttian-symmetric -> the spectrum is symmetric ˆf ( ω ) = ˆf ( ω) ( ) ˆf ( ω) ( ) ˆf ( ω ) = ˆf ( ω) f t f t Pr oof + I{ f ( t) } = f t + ( )e jωt dt = f ( t ')e jωt ' dt ' = ˆf ω ( ) ω 26
27 Sinusoids Frequency domain characterization of signals + jωt F( ω) = f( t) e dt Signal domain Frequency domain (spectrum, absolute value of the transform) 27
28 Gaussian Time domain Frequency domain 28
29 rect Time domain Frequency domain sinc function 29
30 Example 30
31 Properties 3
32 Discrete Time FT (DTFT) If f[n] is a function of the discrete variable n then the DTFT is given by ˆf 2π ( ω) = f n f [ n] = 2π + n= + [ ] e jωn ˆf ω e jωn dω ( ) 32
33 DTFT ˆf /T + ( ω) = T f [ nt ] e jωnt = n= + % 2kπ ( + + = ˆf ' ω * = F, f nt & T ) - k= n= [ ] ( ) δ t nt. / 0 f [ nt ] = T + ˆf /T ( ω) e jωn dω 33
34 CT versus DT FT Relationship between the (continuous) Fourier transform and the discrete Fourier transform. Left column: A continuous function (top) and its Fourier transform (bottom). Center-left column: Periodic summation of the original function (top). Fourier transform (bottom) is zero except at discrete points. The inverse transform is a sum of sinusoids called Fourier series. Center-right column: Original function is discretized (multiplied by a Dirac comb) (top). Its Fourier transform (bottom) is a periodic summation (DTFT) of the original transform. Right column: The DFT (bottom) computes discrete samples of the continuous DTFT. The inverse DFT (top) is a periodic summation of the original samples. The FFT algorithm computes one cycle of the DFT and its inverse is one cycle of the DFT inverse. 34
35 Discrete Fourier Transform (DFT) Applies to finite length discrete time (sampled) signals and time series The easiest way to get to it Time is a discrete variable (t=n) Frequency is a discrete variable (f=k) 35
36 DFT The DFT can be considered as a generalization of the CTFT to discrete series of a finite number of samples It is the FT of a discrete (sampled) function of one variable N Fk [ ] = f[ ne ] N n= 0 N f[ n] = F[ k] e k = 0 j2 π kn/ N j2 π kn/ N The /N factor is put either in the analysis formula or in the synthesis one, or the /sqrt(n) is put in front of both. Calculating the DFT takes about N 2 calculations 36
37 In practice.. In order to calculate the DFT we start with k=0, calculate F(0) as in the formula below, then we change to u= etc N N j2π 0 n/ N F[0] = f[ ne ] = f[ n] = f N N n= 0 n= 0 F[0] is the mean value of the function f[n] This is also the case for the CTFT The transformed function F[k] has the same number of terms as f[n] and always exists The transform is always reversible by construction so that we can always recover f given F 37
38 Highlights on DFT properties amplitude 0 time The DFT of a real signal is symmetric (Hermitian symmetry) The DFT of a real symmetric signal (even like the cosine) is real and symmetric The DFT is N-periodic Hence The DFT of a real symmetric signal only needs to be specified in [0, N/2] F[k] F[0] low-pass characteristic 0 N/2 N Frequency (k) 38
39 Visualization of the basic repetition To show a full period, we need to translate the origin of the transform at u=n/2 (or at (N/2,N/2) in 2D) f [ n]e 2πu0n f [ k u 0 ] u 0 = N 2 f [ n]e 2π N 2 n = f [ n]e π Nn = ( ) n f [ n ] f k N $ % 2 # & ' ( F(u) F(u-N/2) 39
40 DFT About N 2 multiplications are needed to calculate the DFT The transform F[k] has the same number of components of f[n], that is N The DFT always exists for signals that do not go to infinity at any point Using the Eulero s formula N N j2 π kn/ N Fk [ ] = f[ ne ] = f[ n] cos j2 kn/ N jsin j2 kn/ N N N n= 0 n= 0 ( ( π ) ( π )) frequency component k discrete trigonometric functions 40
41 2D example no translation after translation 4
42 Going back to the intuition The FT decomposed the signal over its harmonic components and thus represents it as a sum of linearly independent complex exponential functions Thus, it can be interpreted as a mathematical prism 42
43 DFT Each term of the DFT, namely each value of F[k], results of the contributions of all the samples in the signal (f[n] for n=,..,n) The samples of f[n] are multiplied by trigonometric functions of different frequencies The domain over which F[k] lives is called frequency domain Each term of the summation which gives F[k] is called frequency component of harmonic component 43
44 DFT is a complex number F[k] in general are complex numbers [ ] = Re{ [ ]} + Im{ [ ]} [ ] = [ ] exp{ R [ ]} F k F k j F k F k F k j F k F k F k F k [ ] = Re{ [ ]} + Im{ [ ]} Im{ F[ k ]} R F[ k] = tan Re{ F[ k] } [ ] = Fk [ ] Pk magnitude or spectrum phase or angle power spectrum 44
45 Stretching vs shrinking stretched shrinked 45
46 Periodization vs discretization amplitude Linking continuous and discrete domains amplitude f k =f(kt s ) T s t n DT (discrete time) signals can be seen as sampled versions of CT (continuous time) signals Both CT and DT signals can be of finite duration or periodic There is a duality between periodicity and discretization Periodic signals have discrete frequency (sampled) transform Discrete time signals have periodic transform DT periodic signals have discrete (sampled) periodic transforms 46
47 Increasing the resolution by Zero Padding Consider the analysis formula [ ] = N F k N n=0 f [ n]e 2π jkn N If f[n] consists of N samples than F[k] consists of N samples as well, it is discrete (k is an integer) and it is periodic (because the signal f[n] is discrete time, namely n is an integer) The value of each F[k], for all k, is given by a weighted sum of the values of f[n], for n=,.., N- Key point: if we artificially increase the length of the signal adding M zeros on the right, we get a signal f [m] for which m=,,n+m-. Since f " $ [ m] = # $ % f [m] for 0 m < N 0 for N m < N + M 47
48 Increasing the resolution through ZP Then the value of each F[k] is obtained by a weighted sum of the real values of f[n] for 0 k N-, which are the only ones different from zero, but they happen at different normalized frequencies since the frequency axis has been rescaled. In consequence, F[k] is more densely sampled and thus features a higher resolution. 48
49 Increasing the resolution by Zero Padding 0 N 0 n zero padding F(Ω) (DTFT) in shade F[k]: sampled version 0 2π 2π/N 0 4π k 49
50 Zero padding zero padding Increasing the number of zeros augments the resolution of the transform since the samples of the DFT get closer 0 n N 0 F(Ω) 0 2π 2π/N 0 4π k 50
51 Summary of dualities SIGNAL DOMAIN FOURIER DOMAIN Sampling DTFT Periodicity Periodicity CTFS Sampling Sampling+Periodicity DTFS/DFT Sampling +Periodicity 5
52 Discrete Cosine Transform (DCT) Applies to digital (sampled) finite length signals AND uses only cosines. The DCT coefficients are all real numbers 52
53 Discrete Cosine Transform (DCT) Operate on finite discrete sequences (as DFT) A discrete cosine transform (DCT) expresses a sequence of finitely many data points in terms of a sum of cosine functions oscillating at different frequencies DCT is a Fourier-related transform similar to the DFT but using only real numbers DCT is equivalent to DFT of roughly twice the length, operating on real data with even symmetry (since the Fourier transform of a real and even function is real and even), where in some variants the input and/or output data are shifted by half a sample There are eight standard DCT variants, out of which four are common Strong connection with the Karunen-Loeven transform VERY important for signal compression 53
54 DCT DCT implies different boundary conditions than the DFT or other related transforms A DCT, like a cosine transform, implies an even periodic extension of the original function Tricky part First, one has to specify whether the function is even or odd at both the left and right boundaries of the domain Second, one has to specify around what point the function is even or odd In particular, consider a sequence abcd of four equally spaced data points, and say that we specify an even left boundary. There are two sensible possibilities: either the data is even about the sample a, in which case the even extension is dcbabcd, or the data is even about the point halfway between a and the previous point, in which case the even extension is dcbaabcd (a is repeated). 54
55 Symmetries 55
56 DCT N0 π Xk = xncos n+ k k 0,..., N0 n 0 N0 2 = = N0 2 π k xn = X0 + Xk cos k N0 2 + k = 0 N0 2 Warning: the normalization factor in front of these transform definitions is merely a convention and differs between treatments. Some authors multiply the transforms by (2/N 0 ) /2 so that the inverse does not require any additional multiplicative factor. Combined with appropriate factors of 2 (see above), this can be used to make the transform matrix orthogonal. 56
57 Summary of dualities SIGNAL DOMAIN FOURIER DOMAIN Sampling DTFT Periodicity Periodicity CTFS Sampling Sampling+Periodicity DTFS/DFT Sampling +Periodicity 57
58 Sampling From continuous to discrete time 58
59 Impulse Train Define a comb function (impulse train) as follows comb N [n] = δ[n ln ] l= where M and N are integers comb 2[ n] n 59
60 Impulse Train comb 2[ n] ( ) 2 comb u 2 2 n u 2 60
61 Impulse Train comb 2( x) ( ) 2 comb u 2 2 x u 2 2 6
62 Consequences Sampling (Nyquist) theorem 62
63 Sampling f( x) Fu ( ) comb M () x x x comb ( ) u M u u M M f() x comb () x M Fu ( )* comb ( u) M x 63 u
64 Sampling f( x) Fu ( ) x W W u f() x comb () x M Fu ( )* comb ( u) M x W u M Nyquist theorem: No aliasing if M > 2W M 64
65 Sampling f() x comb () x M Fu ( )* comb ( u) M x W u M M 2M If there is no aliasing, the original signal can be recovered from its samples by low-pass filtering. 65
66 Sampling f( x) Fu ( ) x W W u f() x comb () x M Fu ( )* comb ( u) M W u Aliased M 66
67 f( x) Sampling Fu ( ) Anti-aliasing filter x W W u f( x)* h( x) W W 2M u [ ] f( x)* h( x) comb ( x) M u M 67
68 Without anti-aliasing filter: Sampling f() x comb () x M W u With anti-aliasing filter: M [ ] f( x)* h( x) comb ( x) M u M 68
69 Images vs Signals D 2D Signals Frequency Temporal Spatial Time (space) frequency characterization of signals Reference space for Filtering Changing the sampling rate Signal analysis. Images Frequency Spatial Space/frequency characterization of 2D signals Reference space for Filtering Up/Down sampling Image analysis Feature extraction Compression. 69
70 2D Continuous FT 70
71 How do frequencies show up in an image? Low frequencies correspond to slowly varying information (e.g., continuous surface). High frequencies correspond to quickly varying information (e.g., edges) Original Image Low-passed 7
72 Large vertical frequencies correspond to horizontal lines 2D Frequency domain ω y Large horizontal and vertical frequencies correspond sharp grayscale changes in both directions Small horizontal and vertical frequencies correspond smooth grayscale changes in both directions ω x Large horizontal frequencies correspond to vertical lines 72
73 2D spatial frequencies 2D spatial frequencies characterize the image spatial changes in the horizontal (x) and vertical (y) directions Smooth variations -> low frequencies Sharp variations -> high frequencies y ω x = ω y =0 ω x =0 ω y = x 73
74 2D Continuous Fourier Transform 2D Continuous Fourier Transform (notation 2) + ˆ j 2π ( ux+ vy) f u, v f x, y e dxdy ( ) = ( ) + ˆ j 2π ( ux+ vy) f x y f u v e dudv (, ) (, ) = = 2 ˆ f( x, y) dxdy = f( u, v) dudv Plancherel s equality 2 74
75 Delta Sampling property of the 2D-delta function (Dirac s delta) Transform of the delta function δ ( x x, y y ) f( x, y) dxdy= f( x, y ) j2 π ( ux+ vy) { δ } δ F ( x, y) = ( x, y) e dxdy = j2 π ( ux+ vy) j π ux0+ vy0 { δ(, )} = δ(, ) = F x x y y x x y y e dxdy e ( ) shifting property 75
76 Constant functions Inverse transform of the impulse function j2 π( ux+ vy) j2 π(0x+ v0) { δ } F ( u, v) = δ( u, v) e dudv= e = Fourier Transform of the constant (= for all x and y) kxy (, ) = xy, j2 π ( ux+ vy) ( ) F u, v = e dxdy = δ ( u, v) 76
77 Trigonometric functions Cosine function oscillating along the x axis Constant along the y axis s( x, y) = cos(2 π fx) j2 π ( ux+ vy) { cos(2 π )} cos(2 π ) F fx = fx e dxdy = j2 π( fx) j2 π( fx) e + e = e 2 [ δ( u f) + δ( u+ f) ] j2 π ( ux+ vy) dxdy j2 π( u f ) x j2 π( u+ f ) x j2πvy = e + e e dxdy = 2 j2πvy j2 π( u f ) x j2 π( u+ f ) x j2 π( u f ) x j2 π( u+ f ) x e dy e e dx e e dx = 2 + = + =
78 Vertical grating ω y 0 ω x 78
79 Double grating ω y 0 ω x 79
80 Smooth rings ω y ω x 80
81 Vertical grating ω y -2πf 0 2πf ω x 8
82 2D box 2D sinc 82
83 CTFT properties Linearity Shifting Modulation Convolution Multiplication Separability af ( x, y) + bg( x, y) af( u, v) + bg( u, v) f x x y x e F u v j 2 π ( ux0 vy0 (, ) + ) (, ) 0 0 j2 π ( u0x+ v0y) e f x y F u u v v (, ) (, ) 0 0 f( x, y)* g( x, y) F( u, v) G( u, v) f( x, y) g( x, y) F( u, v)* G( u, v) f( x, y) = f( x) f( y) F( u, v) = F( u) F( v) 83
84 Separability. Separability of the 2D Fourier transform 2D Fourier Transforms can be implemented as a sequence of D Fourier Transform operations performed independently along the two axis j2 π ( ux+ vy) Fuv (, ) f( xye, ) dxdy j2πux j2πvy j2πvy j2πux f( x, y) e e dxdy e dy f( x, y) e dx j2πvy Fuye (, ) dy F uv, = = = = ( ) = = 2D FT D FT along the rows D FT along the cols 84
85 Separability Separable functions can be written as 2. The FT of a separable function is the product of the FTs of the two functions j2 π ( ux+ vy) Fuv (, ) f( xye, ) dxdy j2πux j2πvy j2πvy j2πux hxg ( ) ye e dxdy g ye dy hxe ( ) dx ( ) ( ) H u G v = = ( ) ( ) = = = (, ) = ( ) ( ) (, ) = ( ) ( ) f x y h x g y F u v H u G v (, ) = ( ) ( ) f x y f x g y 85
86 Discrete Time Fourier Transform (DTFT) Applies to Discrete domain signals and time series - 2D 86
87 Fourier Transform: 2D Discrete Signals Fourier Transform of a 2D discrete signal is defined as Fuv (, ) fmne [, ] = m= n= j2 π ( um+ vn) where uv, < 2 2 Inverse Fourier Transform /2 /2 j2 π ( um+ vn) f [ m, n] F( u, v) e dudv = /2 /2 87
88 Properties Periodicity: 2D Fourier Transform of a discrete a-periodic signal is periodic The period is for the unitary frequency notations and 2π for normalized frequency notations. Proof (referring to the firsts case) Fu ( + kv, + l) = fmne [, ] Arbitrary integers m= n= = m= n= = m= n= = Fuv (, ) ( ) j2 π ( u+ k) m+ ( v+ l) n ( ) j2π um+ vn j2πkm j2πln f[ m, n] e e e f[ m, n] e j2 π ( um+ vn) 88
89 Fourier Transform: Properties Linearity, shifting, modulation, convolution, multiplication, separability, energy conservation properties also exist for the 2D Fourier Transform of discrete signals. 89
90 DTFT Properties Linearity af [ m, n] + bg[ m, n] af( u, v) + bg( u, v) Shifting Modulation Convolution f m m n n e F u v j 2 π ( um0 vn0 [, ] + ) (, ) 0 0 j2 π ( u0m+ v0n) e f m n F u u v v [, ] (, ) 0 0 f[ m, n]* g[ m, n] F( u, v) G( u, v) Multiplication f[ m, n] g[ m, n] F( u, v)* G( u, v) Separable functions Energy conservation f[ m, n] = f[ m] f[ n] F( u, v) = F( u) F( v) 2 2 f[ m, n] = F( u, v) dudv m= n= 90
91 Fourier Transform: Properties Define Kronecker delta function δ[ mn, ], for m= 0 and n= 0 = 0, otherwise Fourier Transform of the Kronecker delta function ( ) π( ) j2π um+ vn j2 u0+ v0 Fuv (, ) = δ[ mne, ] = e = m= n= 9
92 Impulse Train Define a comb function (impulse train) as follows combm, N[ m, n] = δ[ m km, n ln] k= l= where M and N are integers comb 2[ n] n 92
93 Impulse Train k= l= comb M,N [m,n] δ[m km,n ln ] comb M,N (x, y) δ ( x km, y ln ) k= l= Fourier Transform of an impulse train is also an impulse train: k l δ[ m km, n ln] δ u, v MN = = M N k= l= k l comb, [ m, n] M N comb (,) u v, M N 93
94 Impulse Train comb 2[ n] ( ) 2 comb u 2 2 n u 2 94
95 comb M,N (x, y) = Impulse Train In the case of continuous signals: δ ( x km, y ln ) k= l= δ k l x km, y ln δ u, v MN = = M N ( ) k= l= k l comb, ( x, y) M N comb (,) u v, M N 95
96 Impulse Train comb 2( x) ( ) 2 comb u 2 2 x u
97 2D DTFT: constant Fourier Transform of f [k,l] =, k,l F[u,v] = k= l= $ j2π( uk+vl) e ' = %& () k= l= = δ(u k,v l) periodic with period along u and v To prove: Take the inverse Fourier Transform of the Dirac delta function and use the fact that the Fourier Transform has to be periodic with period. 97
98 Sampling theorem revisited 98
99 Sampling f( x) Fu ( ) comb M () x x x comb ( ) u M u u M M f() x comb () x M Fu ( )* comb ( u) M x 99 u
100 Sampling f( x) Fu ( ) x W W u f() x comb () x M Fu ( )* comb ( u) M x W u M Nyquist theorem: No aliasing if M > 2W M 00
101 Sampling f() x comb () x M Fu ( )* comb ( u) M x W u M M 2M If there is no aliasing, the original signal can be recovered from its samples by low-pass filtering. 0
102 Sampling f( x) Fu ( ) x W W u f() x comb () x M Fu ( )* comb ( u) M W u Aliased M 02
103 f( x) Sampling Fu ( ) Anti-aliasing filter x W W u f( x)* h( x) W W 2M u [ ] f( x)* h( x) comb ( x) M u M 03
104 Without anti-aliasing filter: Sampling f() x comb () x M W u With anti-aliasing filter: M [ ] f( x)* h( x) comb ( x) M u M 04
105 y Sampling in 2D (images) v f( x, y ) Fuv (, ) x W v W u u y comb, ( x, y) M N v comb (,) u v, M N x N u N M M 05
106 Sampling v W v f ( x, y) comb ( x, y) M, N u N M W u No aliasing if M > 2W u and N > 2W v 06
107 Interpolation (low pass filtering) v 2N u N Ideal reconstruction filter: M 2M MN, for u and v Huv (, ) = 2M 2N 0, otherwise 07
108 Anti-Aliasing a=imread( barbara.tif ); 08
109 Anti-Aliasing a=imread( barbara.tif ); b=imresize(a,0.25); c=imresize(b,4); 09
110 Anti-Aliasing a=imread( barbara.tif ); b=imresize(a,0.25); c=imresize(b,4); H=zeros(52,52); H(256-64:256+64, :256+64)=; Da=fft2(a); Da=fftshift(Da); Dd=Da.*H; Dd=fftshift(Dd); d=real(ifft2(dd)); 0
Contents. Signals as functions (1D, 2D)
Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component
More informationContents. Signals as functions (1D, 2D)
Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component
More informationOverview. Signals as functions (1D, 2D) 1D Fourier Transform. 2D Fourier Transforms. Discrete Fourier Transform (DFT) Discrete Cosine Transform (DCT)
Fourier Transform Overview Signals as functions (1D, 2D) Tools 1D Fourier Transform Summary of definition and properties in the different cases CTFT, CTFS, DTFS, DTFT DFT 2D Fourier Transforms Generalities
More informationFourier analysis of discrete-time signals. (Lathi Chapt. 10 and these slides)
Fourier analysis of discrete-time signals (Lathi Chapt. 10 and these slides) Towards the discrete-time Fourier transform How we will get there? Periodic discrete-time signal representation by Discrete-time
More informationG52IVG, School of Computer Science, University of Nottingham
Image Transforms Fourier Transform Basic idea 1 Image Transforms Fourier transform theory Let f(x) be a continuous function of a real variable x. The Fourier transform of f(x) is F ( u) f ( x)exp[ j2πux]
More informationIntroduction to the Fourier transform. Computer Vision & Digital Image Processing. The Fourier transform (continued) The Fourier transform (continued)
Introduction to the Fourier transform Computer Vision & Digital Image Processing Fourier Transform Let f(x) be a continuous function of a real variable x The Fourier transform of f(x), denoted by I {f(x)}
More information2D Discrete Fourier Transform (DFT)
2D Discrete Fourier Transform (DFT) Outline Circular and linear convolutions 2D DFT 2D DCT Properties Other formulations Examples 2 2D Discrete Fourier Transform Fourier transform of a 2D signal defined
More informationSEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis
SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some
More informationFrequency2: Sampling and Aliasing
CS 4495 Computer Vision Frequency2: Sampling and Aliasing Aaron Bobick School of Interactive Computing Administrivia Project 1 is due tonight. Submit what you have at the deadline. Next problem set stereo
More informationLecture 4 Filtering in the Frequency Domain. Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2016
Lecture 4 Filtering in the Frequency Domain Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2016 Outline Background From Fourier series to Fourier transform Properties of the Fourier
More informationDISCRETE FOURIER TRANSFORM
DD2423 Image Processing and Computer Vision DISCRETE FOURIER TRANSFORM Mårten Björkman Computer Vision and Active Perception School of Computer Science and Communication November 1, 2012 1 Terminology:
More informationDiscrete Fourier Transform
Discrete Fourier Transform DD2423 Image Analysis and Computer Vision Mårten Björkman Computational Vision and Active Perception School of Computer Science and Communication November 13, 2013 Mårten Björkman
More informationReview: Continuous Fourier Transform
Review: Continuous Fourier Transform Review: convolution x t h t = x τ h(t τ)dτ Convolution in time domain Derivation Convolution Property Interchange the order of integrals Let Convolution Property By
More informationDigital Image Processing
Digital Image Processing Image Transforms Unitary Transforms and the 2D Discrete Fourier Transform DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON What is this
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Filtering in the Frequency Domain http://www.ee.unlv.edu/~b1morris/ecg782/ 2 Outline Background
More informationImage Enhancement in the frequency domain. GZ Chapter 4
Image Enhancement in the frequency domain GZ Chapter 4 Contents In this lecture we will look at image enhancement in the frequency domain The Fourier series & the Fourier transform Image Processing in
More informationUniversity of Connecticut Lecture Notes for ME5507 Fall 2014 Engineering Analysis I Part III: Fourier Analysis
University of Connecticut Lecture Notes for ME557 Fall 24 Engineering Analysis I Part III: Fourier Analysis Xu Chen Assistant Professor United Technologies Engineering Build, Rm. 382 Department of Mechanical
More informationEE 224 Signals and Systems I Review 1/10
EE 224 Signals and Systems I Review 1/10 Class Contents Signals and Systems Continuous-Time and Discrete-Time Time-Domain and Frequency Domain (all these dimensions are tightly coupled) SIGNALS SYSTEMS
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Spring 2014 TTh 14:30-15:45 CBC C313 Lecture 05 Image Processing Basics 13/02/04 http://www.ee.unlv.edu/~b1morris/ecg782/
More informationToday s lecture. The Fourier transform. Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm
Today s lecture The Fourier transform What is it? What is it useful for? What are its properties? Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm Jean Baptiste Joseph Fourier
More informationThe Fourier Transform (and more )
The Fourier Transform (and more ) imrod Peleg ov. 5 Outline Introduce Fourier series and transforms Introduce Discrete Time Fourier Transforms, (DTFT) Introduce Discrete Fourier Transforms (DFT) Consider
More informationMIT 2.71/2.710 Optics 10/31/05 wk9-a-1. The spatial frequency domain
10/31/05 wk9-a-1 The spatial frequency domain Recall: plane wave propagation x path delay increases linearly with x λ z=0 θ E 0 x exp i2π sinθ + λ z i2π cosθ λ z plane of observation 10/31/05 wk9-a-2 Spatial
More informationChapter 6: Applications of Fourier Representation Houshou Chen
Chapter 6: Applications of Fourier Representation Houshou Chen Dept. of Electrical Engineering, National Chung Hsing University E-mail: houshou@ee.nchu.edu.tw H.S. Chen Chapter6: Applications of Fourier
More informationGBS765 Electron microscopy
GBS765 Electron microscopy Lecture 1 Waves and Fourier transforms 10/14/14 9:05 AM Some fundamental concepts: Periodicity! If there is some a, for a function f(x), such that f(x) = f(x + na) then function
More informationFourier Transforms For additional information, see the classic book The Fourier Transform and its Applications by Ronald N. Bracewell (which is on the shelves of most radio astronomers) and the Wikipedia
More informationImage Acquisition and Sampling Theory
Image Acquisition and Sampling Theory Electromagnetic Spectrum The wavelength required to see an object must be the same size of smaller than the object 2 Image Sensors 3 Sensor Strips 4 Digital Image
More informationEE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet
EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, 2012 Cover Sheet Test Duration: 75 minutes. Coverage: Chaps. 5,7 Open Book but Closed Notes. One 8.5 in. x 11 in. crib sheet Calculators
More informationRepresenting a Signal
The Fourier Series Representing a Signal The convolution method for finding the response of a system to an excitation takes advantage of the linearity and timeinvariance of the system and represents the
More informationConvolution Spatial Aliasing Frequency domain filtering fundamentals Applications Image smoothing Image sharpening
Frequency Domain Filtering Correspondence between Spatial and Frequency Filtering Fourier Transform Brief Introduction Sampling Theory 2 D Discrete Fourier Transform Convolution Spatial Aliasing Frequency
More informationLecture 19: Discrete Fourier Series
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 19: Discrete Fourier Series Dec 5, 2001 Prof: J. Bilmes TA: Mingzhou
More informationDSP-I DSP-I DSP-I DSP-I
NOTES FOR 8-79 LECTURES 3 and 4 Introduction to Discrete-Time Fourier Transforms (DTFTs Distributed: September 8, 2005 Notes: This handout contains in brief outline form the lecture notes used for 8-79
More informationDiscrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz
Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W.
More information3. Lecture. Fourier Transformation Sampling
3. Lecture Fourier Transformation Sampling Some slides taken from Digital Image Processing: An Algorithmic Introduction using Java, Wilhelm Burger and Mark James Burge Separability ² The 2D DFT can be
More informationENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin
ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM Dr. Lim Chee Chin Outline Introduction Discrete Fourier Series Properties of Discrete Fourier Series Time domain aliasing due to frequency
More informationChapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum
Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum CEN352, DR. Nassim Ammour, King Saud University 1 Fourier Transform History Born 21 March 1768 ( Auxerre ). Died 16 May 1830 ( Paris ) French
More informationX. Chen More on Sampling
X. Chen More on Sampling 9 More on Sampling 9.1 Notations denotes the sampling time in second. Ω s = 2π/ and Ω s /2 are, respectively, the sampling frequency and Nyquist frequency in rad/sec. Ω and ω denote,
More informationChapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform Introduction Representation of periodic sequences: the discrete Fourier series Properties of the DFS The Fourier transform of periodic signals Sampling the Fourier
More informationChap 4. Sampling of Continuous-Time Signals
Digital Signal Processing Chap 4. Sampling of Continuous-Time Signals Chang-Su Kim Digital Processing of Continuous-Time Signals Digital processing of a CT signal involves three basic steps 1. Conversion
More informationDiscrete Fourier Transform
Discrete Fourier Transform Virtually all practical signals have finite length (e.g., sensor data, audio records, digital images, stock values, etc). Rather than considering such signals to be zero-padded
More informationDiscrete-time Signals and Systems in
Discrete-time Signals and Systems in the Frequency Domain Chapter 3, Sections 3.1-39 3.9 Chapter 4, Sections 4.8-4.9 Dr. Iyad Jafar Outline Introduction The Continuous-Time FourierTransform (CTFT) The
More informationFourier series: Any periodic signals can be viewed as weighted sum. different frequencies. view frequency as an
Image Enhancement in the Frequency Domain Fourier series: Any periodic signals can be viewed as weighted sum of sinusoidal signals with different frequencies Frequency Domain: view frequency as an independent
More informationInterchange of Filtering and Downsampling/Upsampling
Interchange of Filtering and Downsampling/Upsampling Downsampling and upsampling are linear systems, but not LTI systems. They cannot be implemented by difference equations, and so we cannot apply z-transform
More informationEE 438 Essential Definitions and Relations
May 2004 EE 438 Essential Definitions and Relations CT Metrics. Energy E x = x(t) 2 dt 2. Power P x = lim T 2T T / 2 T / 2 x(t) 2 dt 3. root mean squared value x rms = P x 4. Area A x = x(t) dt 5. Average
More informationMathematics for Chemists 2 Lecture 14: Fourier analysis. Fourier series, Fourier transform, DFT/FFT
Mathematics for Chemists 2 Lecture 14: Fourier analysis Fourier series, Fourier transform, DFT/FFT Johannes Kepler University Summer semester 2012 Lecturer: David Sevilla Fourier analysis 1/25 Remembering
More informationChapter 4 The Fourier Series and Fourier Transform
Chapter 4 The Fourier Series and Fourier Transform Representation of Signals in Terms of Frequency Components Consider the CT signal defined by N xt () = Acos( ω t+ θ ), t k = 1 k k k The frequencies `present
More information2. Image Transforms. f (x)exp[ 2 jπ ux]dx (1) F(u)exp[2 jπ ux]du (2)
2. Image Transforms Transform theory plays a key role in image processing and will be applied during image enhancement, restoration etc. as described later in the course. Many image processing algorithms
More informationFILTERING IN THE FREQUENCY DOMAIN
1 FILTERING IN THE FREQUENCY DOMAIN Lecture 4 Spatial Vs Frequency domain 2 Spatial Domain (I) Normal image space Changes in pixel positions correspond to changes in the scene Distances in I correspond
More informationDiscrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is
Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its
More informationFourier Transform 2D
Image Processing - Lesson 8 Fourier Transform 2D Discrete Fourier Transform - 2D Continues Fourier Transform - 2D Fourier Properties Convolution Theorem Eamples = + + + The 2D Discrete Fourier Transform
More informationBME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY
1 Lucas Parra, CCNY BME 50500: Image and Signal Processing in Biomedicine Lecture 2: Discrete Fourier Transform Lucas C. Parra Biomedical Engineering Department CCNY http://bme.ccny.cuny.edu/faculty/parra/teaching/signal-and-image/
More informationChap 2. Discrete-Time Signals and Systems
Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,
More informationDigital Image Processing. Filtering in the Frequency Domain
2D Linear Systems 2D Fourier Transform and its Properties The Basics of Filtering in Frequency Domain Image Smoothing Image Sharpening Selective Filtering Implementation Tips 1 General Definition: System
More informationReview of Discrete-Time System
Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.
More informationChapter 4 The Fourier Series and Fourier Transform
Chapter 4 The Fourier Series and Fourier Transform Fourier Series Representation of Periodic Signals Let x(t) be a CT periodic signal with period T, i.e., xt ( + T) = xt ( ), t R Example: the rectangular
More information8 The Discrete Fourier Transform (DFT)
8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration
More informationIntroduction to Fourier Analysis Part 2. CS 510 Lecture #7 January 31, 2018
Introduction to Fourier Analysis Part 2 CS 510 Lecture #7 January 31, 2018 OpenCV on CS Dept. Machines 2/4/18 CSU CS 510, Ross Beveridge & Bruce Draper 2 In the extreme, a square wave Graphic from http://www.mechatronics.colostate.edu/figures/4-4.jpg
More informationFourier transform representation of CT aperiodic signals Section 4.1
Fourier transform representation of CT aperiodic signals Section 4. A large class of aperiodic CT signals can be represented by the CT Fourier transform (CTFT). The (CT) Fourier transform (or spectrum)
More informationChapter 4 Image Enhancement in the Frequency Domain
Chapter 4 Image Enhancement in the Frequency Domain 3. Fourier transorm -D Let be a unction o real variable,the ourier transorm o is F { } F u ep jπu d j F { F u } F u ep[ jπ u ] du F u R u + ji u or F
More informationECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.
ECE 3 Fall Division Homework Solutions Problem. Reconstruction of a continuous-time signal from its samples. Consider the following periodic signal, depicted below: {, if n t < n +, for any integer n,
More informationPS403 - Digital Signal processing
PS403 - Digital Signal processing III. DSP - Digital Fourier Series and Transforms Key Text: Digital Signal Processing with Computer Applications (2 nd Ed.) Paul A Lynn and Wolfgang Fuerst, (Publisher:
More informationA523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011
A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011 Lecture 6 PDFs for Lecture 1-5 are on the web page Problem set 2 is on the web page Article on web page A Guided
More informationFourier Analysis Overview (0A)
CTFS: Fourier Series CTFT: Fourier Transform DTFS: Fourier Series DTFT: Fourier Transform DFT: Discrete Fourier Transform Copyright (c) 2011-2016 Young W. Lim. Permission is granted to copy, distribute
More informationTopic 3: Fourier Series (FS)
ELEC264: Signals And Systems Topic 3: Fourier Series (FS) o o o o Introduction to frequency analysis of signals CT FS Fourier series of CT periodic signals Signal Symmetry and CT Fourier Series Properties
More informationDiscrete Time Fourier Transform (DTFT)
Discrete Time Fourier Transform (DTFT) 1 Discrete Time Fourier Transform (DTFT) The DTFT is the Fourier transform of choice for analyzing infinite-length signals and systems Useful for conceptual, pencil-and-paper
More informationGood Luck. EE 637 Final May 4, Spring Name: Instructions: This is a 120 minute exam containing five problems.
EE 637 Final May 4, Spring 200 Name: Instructions: This is a 20 minute exam containing five problems. Each problem is worth 20 points for a total score of 00 points You may only use your brain and a pencil
More informationFourier transform. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year
Fourier transform Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Methods for Image Processing academic year 27 28 Function transforms Sometimes, operating on a class of functions
More informationComplex symmetry Signals and Systems Fall 2015
18-90 Signals and Systems Fall 015 Complex symmetry 1. Complex symmetry This section deals with the complex symmetry property. As an example I will use the DTFT for a aperiodic discrete-time signal. The
More informationA system that is both linear and time-invariant is called linear time-invariant (LTI).
The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Lecture Notes: Time, Frequency & Transform Domains February 28, 2012 Signals & Systems Signals are mapped
More informationDigital Speech Processing Lecture 10. Short-Time Fourier Analysis Methods - Filter Bank Design
Digital Speech Processing Lecture Short-Time Fourier Analysis Methods - Filter Bank Design Review of STFT j j ˆ m ˆ. X e x[ mw ] [ nˆ m] e nˆ function of nˆ looks like a time sequence function of ˆ looks
More informationIB Paper 6: Signal and Data Analysis
IB Paper 6: Signal and Data Analysis Handout 5: Sampling Theory S Godsill Signal Processing and Communications Group, Engineering Department, Cambridge, UK Lent 2015 1 / 85 Sampling and Aliasing All of
More informationELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization
ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals 1. Sampling and Reconstruction 2. Quantization 1 1. Sampling & Reconstruction DSP must interact with an analog world: A to D D to A x(t)
More informationKey Intuition: invertibility
Introduction to Fourier Analysis CS 510 Lecture #6 January 30, 2017 In the extreme, a square wave Graphic from http://www.mechatronics.colostate.edu/figures/4-4.jpg 2 Fourier Transform Formally, the Fourier
More informationFourier Series Example
Fourier Series Example Let us compute the Fourier series for the function on the interval [ π,π]. f(x) = x f is an odd function, so the a n are zero, and thus the Fourier series will be of the form f(x)
More informationAspects of Continuous- and Discrete-Time Signals and Systems
Aspects of Continuous- and Discrete-Time Signals and Systems C.S. Ramalingam Department of Electrical Engineering IIT Madras C.S. Ramalingam (EE Dept., IIT Madras) Networks and Systems 1 / 45 Scaling the
More information6.003: Signal Processing
6.003: Signal Processing Discrete Fourier Transform Discrete Fourier Transform (DFT) Relations to Discrete-Time Fourier Transform (DTFT) Relations to Discrete-Time Fourier Series (DTFS) October 16, 2018
More informationFourier Transform for Continuous Functions
Fourier Transform for Continuous Functions Central goal: representing a signal by a set of orthogonal bases that are corresponding to frequencies or spectrum. Fourier series allows to find the spectrum
More informationElec4621 Advanced Digital Signal Processing Chapter 11: Time-Frequency Analysis
Elec461 Advanced Digital Signal Processing Chapter 11: Time-Frequency Analysis Dr. D. S. Taubman May 3, 011 In this last chapter of your notes, we are interested in the problem of nding the instantaneous
More informationEEL3135: Homework #3 Solutions
EEL335: Homework #3 Solutions Problem : (a) Compute the CTFT for the following signal: xt () cos( πt) cos( 3t) + cos( 4πt). First, we use the trigonometric identity (easy to show by using the inverse Euler
More informationSection 3 Discrete-Time Signals EO 2402 Summer /05/2013 EO2402.SuFY13/MPF Section 3 1
Section 3 Discrete-Time Signals EO 2402 Summer 2013 07/05/2013 EO2402.SuFY13/MPF Section 3 1 [p. 3] Discrete-Time Signal Description Sampling, sampling theorem Discrete sinusoidal signal Discrete exponential
More informationUNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 9th, 011 Examination hours: 14.30 18.30 This problem set
More information6.003: Signals and Systems. Sampling and Quantization
6.003: Signals and Systems Sampling and Quantization December 1, 2009 Last Time: Sampling and Reconstruction Uniform sampling (sampling interval T ): x[n] = x(nt ) t n Impulse reconstruction: x p (t) =
More informationSignals and Systems Spring 2004 Lecture #9
Signals and Systems Spring 2004 Lecture #9 (3/4/04). The convolution Property of the CTFT 2. Frequency Response and LTI Systems Revisited 3. Multiplication Property and Parseval s Relation 4. The DT Fourier
More informationContinuous-time Fourier Methods
ELEC 321-001 SIGNALS and SYSTEMS Continuous-time Fourier Methods Chapter 6 1 Representing a Signal The convolution method for finding the response of a system to an excitation takes advantage of the linearity
More informationTwo-Dimensional Signal Processing and Image De-noising
Two-Dimensional Signal Processing and Image De-noising Alec Koppel, Mark Eisen, Alejandro Ribeiro March 12, 2018 Until now, we considered (one-dimensional) discrete signals of the form x : [0, N 1] C of
More informationNotes on Fourier Series and Integrals Fourier Series
Notes on Fourier Series and Integrals Fourier Series et f(x) be a piecewise linear function on [, ] (This means that f(x) may possess a finite number of finite discontinuities on the interval). Then f(x)
More informationMath 56 Homework 5 Michael Downs
1. (a) Since f(x) = cos(6x) = ei6x 2 + e i6x 2, due to the orthogonality of each e inx, n Z, the only nonzero (complex) fourier coefficients are ˆf 6 and ˆf 6 and they re both 1 2 (which is also seen from
More informationDiscrete Fourier transform (DFT)
Discrete Fourier transform (DFT) Signal Processing 2008/9 LEA Instituto Superior Técnico Signal Processing LEA (IST) Discrete Fourier transform 1 / 34 Periodic signals Consider a periodic signal x[n] with
More informationMultimedia communications
Multimedia communications Comunicazione multimediale G. Menegaz gloria.menegaz@univr.it Prologue Context Context Scale Scale Scale Course overview Goal The course is about wavelets and multiresolution
More informationWavelets and Multiresolution Processing
Wavelets and Multiresolution Processing Wavelets Fourier transform has it basis functions in sinusoids Wavelets based on small waves of varying frequency and limited duration In addition to frequency,
More informationLinear Operators and Fourier Transform
Linear Operators and Fourier Transform DD2423 Image Analysis and Computer Vision Mårten Björkman Computational Vision and Active Perception School of Computer Science and Communication November 13, 2013
More informationMEDE2500 Tutorial Nov-7
(updated 2016-Nov-4,7:40pm) MEDE2500 (2016-2017) Tutorial 3 MEDE2500 Tutorial 3 2016-Nov-7 Content 1. The Dirac Delta Function, singularity functions, even and odd functions 2. The sampling process and
More information1-D MATH REVIEW CONTINUOUS 1-D FUNCTIONS. Kronecker delta function and its relatives. x 0 = 0
-D MATH REVIEW CONTINUOUS -D FUNCTIONS Kronecker delta function and its relatives delta function δ ( 0 ) 0 = 0 NOTE: The delta function s amplitude is infinite and its area is. The amplitude is shown as
More informationBridge between continuous time and discrete time signals
6 Sampling Bridge between continuous time and discrete time signals Sampling theorem complete representation of a continuous time signal by its samples Samplingandreconstruction implementcontinuous timesystems
More informationWe know that f(x, y) and F (u, v) form a Fourier Transform pair, i.e. f(ax, by)e j2π(ux+vy) dx dy. x x. a 0 J = y y. = 0 b
2 2 Problem 2:[10 pts] We know that f(x, y) and F (u, v) form a Fourier Transform pair, i.e. F (u, v) = Now, consider the integral G(u, v) = We make a change of variables [ x x ỹ x f(x, y)e j2π(ux+vy)
More informationELEN 4810 Midterm Exam
ELEN 4810 Midterm Exam Wednesday, October 26, 2016, 10:10-11:25 AM. One sheet of handwritten notes is allowed. No electronics of any kind are allowed. Please record your answers in the exam booklet. Raise
More informationReview of Linear System Theory
Review of Linear System Theory The following is a (very) brief review of linear system theory and Fourier analysis. I work primarily with discrete signals. I assume the reader is familiar with linear algebra
More informationL29: Fourier analysis
L29: Fourier analysis Introduction The discrete Fourier Transform (DFT) The DFT matrix The Fast Fourier Transform (FFT) The Short-time Fourier Transform (STFT) Fourier Descriptors CSCE 666 Pattern Analysis
More informationMusic 270a: Complex Exponentials and Spectrum Representation
Music 270a: Complex Exponentials and Spectrum Representation Tamara Smyth, trsmyth@ucsd.edu Department of Music, University of California, San Diego (UCSD) October 24, 2016 1 Exponentials The exponential
More informationThe Discrete-Time Fourier
Chapter 3 The Discrete-Time Fourier Transform 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 3-1-1 Continuous-Time Fourier Transform Definition The CTFT of
More information1.3 Frequency Analysis A Review of Complex Numbers
3 CHAPTER. ANALYSIS OF DISCRETE-TIME LINEAR TIME-INVARIANT SYSTEMS I y z R θ x R Figure.8. A complex number z can be represented in Cartesian coordinates x, y or polar coordinates R, θ..3 Frequency Analysis.3.
More information