1 / 67

Transforms

Transforms. A sine wave. 5*sin (2 4t). Amplitude = 5. Frequency = 4 Hz. seconds. A sine wave signal. 5*sin(2 4t). Amplitude = 5. Frequency = 4 Hz. Sampling rate = 256 samples/second. Sampling duration = 1 second. seconds. An undersampled signal. The Nyquist Frequency.

lea
Télécharger la présentation

Transforms

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. Transforms

  2. A sine wave 5*sin (24t) Amplitude = 5 Frequency = 4 Hz seconds

  3. A sine wave signal 5*sin(24t) Amplitude = 5 Frequency = 4 Hz Sampling rate = 256 samples/second Sampling duration = 1 second seconds

  4. An undersampled signal

  5. The Nyquist Frequency • The Nyquist frequency is equal to one-half of the sampling frequency. • The Nyquist frequency is the highest frequency that can be measured in a signal.

  6. Fourier series • Periodic functions and signals may be expanded into a series of sine and cosine functions

  7. The Fourier Transform • A transform takes one function (or signal) and turns it into another function (or signal)

  8. The Fourier Transform • A transform takes one function (or signal) and turns it into another function (or signal) • Continuous Fourier Transform: close your eyes if you don’t like integrals

  9. The Fourier Transform • A transform takes one function (or signal) and turns it into another function (or signal) • Continuous Fourier Transform:

  10. The Fourier Transform • A transform takes one function (or signal) and turns it into another function (or signal) • The Discrete Fourier Transform:

  11. Fast Fourier Transform • The Fast Fourier Transform (FFT) is a very efficient algorithm for performing a discrete Fourier transform • FFT principle first used by Gauss in 18?? • FFT algorithm published by Cooley & Tukey in 1965 • In 1969, the 2048 point analysis of a seismic trace took 13 ½ hours. Using the FFT, the same task on the same machine took 2.4 seconds!

  12. Famous Fourier Transforms Sine wave Delta function

  13. Famous Fourier Transforms Gaussian Gaussian

  14. Famous Fourier Transforms Sinc function Square wave

  15. Famous Fourier Transforms Sinc function Square wave

  16. Famous Fourier Transforms Exponential Lorentzian

  17. FFT of FID

  18. FFT of FID

  19. FFT of FID

  20. Effect of changing sample rate

  21. Effect of changing sample rate

  22. Effect of changing sample rate • Lowering the sample rate: • Reduces the Nyquist frequency, which • Reduces the maximum measurable frequency • Does not affect the frequency resolution

  23. Effect of changing sampling duration

  24. Effect of changing sampling duration

  25. Effect of changing sampling duration • Reducing the sampling duration: • Lowers the frequency resolution • Does not affect the range of frequencies you can measure

  26. Effect of changing sampling duration

  27. Effect of changing sampling duration

  28. Measuring multiple frequencies

  29. Measuring multiple frequencies

  30. L: period; u and v are the number of cycles fitting into one horizontal and vertical period, respectively of f(x,y).

  31. Discrete Fourier Transform

  32. Discrete Fourier Transform (DFT). • When applying the procedure to images, we must deal explicitly with the fact that an image is: • Two-dimensional • Sampled • Of finite extent • These consideration give rise to the The DFT of an NxN image can be written:

  33. Discrete Fourier Transform • For any particular spatial frequency specified by u and v, evaluating equation 8.5 tell us how much of that particular frequency is present in the image. • There also exist an inverse Fourier Transform that convert a set of Fourier coefficients into an image.

  34. PSD • The magnitudes correspond to the amplitudes of the basic images in our Fourier representation. • The array of magnitudes is termed the amplitude spectrum (or sometime ‘spectrum’). • The array of phases is termed the phase spectrum. • The power spectrum is simply the square of its amplitude spectrum:

  35. FFT • The Fast Fourier Transform is one of the most important algorithms ever developed • Developed by Cooley and Tukey in mid 60s. • Is a recursive procedure that uses some cool math tricks to combine sub-problem results into the overall solution.

  36. DFT vs FFT

  37. DFT vs FFT

  38. DFT vs FFT

  39. Periodicity assumption • The DFT assumes that an image is part of an infinitely repeated set of “tiles” in every direction. This is the same effect as “circular indexing”.

  40. Spatial discontinuities Periodicity and Windowing • Since “tiling” an image causes “fake” discontinuities, the spectrum includes “fake” high-frequency components

  41. Discrete Cosine Transform Real-valued

  42. DCT in Matrix Form

  43. Discrete Sine Transform Most Convenient when N=2 p - 1

  44. DST in Matrix Form

  45. DCT Basis Functions*

  46. (Log Magnitude) DCT Example*

  47. Hartley Transform • Alternative to Fourier • Produces N Real Numbers • Use Cosine Shifted 45o to the Right

  48. Square Hartley Transform

  49. Rectangular Hartley Transform

More Related