1 / 55

Chapter 7: Fourier Analysis

Chapter 7: Fourier Analysis. Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic ( T ) function f ( x ) can be written as the sum of sines and cosines of varying amplitudes and frequencies. ○ Some function is formed by a finite number

Download Presentation

Chapter 7: Fourier Analysis

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Chapter 7: Fourier Analysis Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic (T) function f(x) can be written as the sum of sines and cosines of varying amplitudes and frequencies

  2. ○ Some function is formed by a finite number of sinuous functions

  3. Some function requires an infinite number of sinuous functions to compose

  4. Spectrum The spectrum of a periodic function is discrete, consisting of components at dc, 1/T, and its multiples, e.g., For non-periodic functions, i.e., The spectrum of the function is continuous

  5. ○ In complex form: Compare with

  6. Continuous case

  7. Discrete case: ◎ Fourier Transform

  8. Matrix form Let

  9. 。Example: f = {1,2,3,4}. Then, N = 4,

  10. Let ○ Inverse DFT

  11. 。Example:

  12. ◎ Properties ○ Linearity: 。 Example: Noise removal f’ = f + n, n: noise, ○ Scaling

  13. ○ Periodicity:

  14. ○ Shifting:

  15. 。 Example:

  16. ◎ Convolution: Convolution theorem:

  17. ◎ Correlation Correlation theorem

  18. 。Discrete Case: e.g., A = 4, B = 5, A + B – 1 = 8,

  19. * Convolution can be defined in terms of polynomial product Extend f, g to if f, g have different numbers of sample points Let Compute The coefficients of to form the result of convolution

  20. 。Example: Let The coefficients of form the convolution

  21. ○ Fast Fourier Transform (FFT) -- Successive doubling method

  22. 7-24

  23. 。 Time complexity : the length of the input sequence FT: FFT: Times of speed increasing: N FT FFT Ratio 4 16 8 2.0 8 84 24 2.67 16 256 64 4.0 32 1024 160 6.4 64 4096 384 10.67 128 16384 896 18.3 256 65536 2048 32.0 512 262144 4608 56.9 1024 1048576 10240 102.4

  24. ○ Inverse FFT ← Given ← compute i. Input into FFT. The output is ii. Taking the complex conjugate and multiplying by N , yields the f(x)

  25. ◎ 2D Fourier Transform ○ FT: IFT:

  26. ◎ Properties ○ Filtering: every F(u,v) is obtained by multiplying every f(x,y) by a fixed value and adding up the results. DFT can be considered as a linear filtering ○ DC coefficient:

  27. ○ Separability:

  28. F(u,v) = F*(-u,-v) ○ Conjugate Symmetry:

  29. ○ Shifting

  30. ○ Rotation Polor coordinates:

  31. ○ Display: effect of log operation

  32. ◎ Image Transform

  33. ◎ Filtering in Frequency Domain ○ Low pass filtering I FT m IFT

  34. D = 5 D = 30 ○ High pass filtering

  35. Different Ds

  36. ◎ Butterworth Filtering ○ Low pass filter ○ High pass filter

  37. ○ Low pass filter ○ High pass filter

  38. ◎ Homomorphic Filtering -- Deals with images with large variation of illumination, e.g., sunshine + shadows -- Both reduces intensity range and increases local contrast ○ Idea: I = LR, L: illumination, R: Reflectance logI = logL + logR

  39. low frequency high frequency

  40. Euler’s formula: 7-44

  41. 7-45

  42. 7-46

  43. ○ Fast Fourier Transform (FFT) -- Successive doubling method Let Assume Let N = 2M. 7-47

  44. ] = ] ∵ = 7-48

  45. Let --------- (B) Consider 7-49

  46. 7-50

More Related