Fourier Analysis What is it? Modern Applications 2D Shape Analysis

Slides:



Advertisements
Similar presentations
If you have not watched the PowerPoint on the unit circle you should watch it first. After you’ve watched that PowerPoint you are ready for this one.
Advertisements

Computer Vision Lecture 7: The Fourier Transform
Chapter 4 Systems of Linear Equations; Matrices
Chapter 4 Systems of Linear Equations; Matrices
MEEG 5113 Modal Analysis Set 3.
Copyright © 2005 Pearson Education, Inc. Chapter 4 Graphs of the Circular Functions.
Copyright © Cengage Learning. All rights reserved. 4.5 Graphs of Sine and Cosine Functions.
Techniques in Signal and Data Processing CSC 508 Frequency Domain Analysis.
Fourier Transform (Chapter 4)
Interference.
Fourier Transform A Fourier Transform is an integral transform that re-expresses a function in terms of different sine waves of varying amplitudes, wavelengths,
Starter.
Typical transducer Microphone Microprocessor Typical signal generator circuit Signal intensity Time Sound Parameter Signal intensity Time Signal intensity.
The frequency spectrum
TRANSMISSION FUNDAMENTALS Review
SIMS-201 Characteristics of Audio Signals Sampling of Audio Signals Introduction to Audio Information.
Techniques in Signal and Data Processing CSC 508 Fourier Analysis.
School of Computing Science Simon Fraser University
Multimedia Data Introduction to Image Processing Dr Mike Spann Electronic, Electrical and Computer.
PH 105 Dr. Cecilia Vogel Lecture 12. OUTLINE  Timbre review  Spectrum  Fourier Synthesis  harmonics and periodicity  Fourier Analysis  Timbre and.
Fourier Transform and Applications
Logarithmic Functions  In this section, another type of function will be studied called the logarithmic function. There is a close connection between.
Chapter 25 Nonsinusoidal Waveforms. 2 Waveforms Used in electronics except for sinusoidal Any periodic waveform may be expressed as –Sum of a series of.
Vibrationdata 1 Unit 5 The Fourier Transform. Vibrationdata 2 Courtesy of Professor Alan M. Nathan, University of Illinois at Urbana-Champaign.
Where we’re going Speed, Storage Issues Frequency Space.
storing data in k-space what the Fourier transform does spatial encoding k-space examples we will review:  How K-Space Works This is covered in the What.
Wireless and Mobile Computing Transmission Fundamentals Lecture 2.
FUNCTIONS AND MODELS 1. In this section, we assume that you have access to a graphing calculator or a computer with graphing software. FUNCTIONS AND MODELS.
Lecture 9 Fourier Transforms Remember homework 1 for submission 31/10/08 Remember Phils Problems and your notes.
Complex Variables & Transforms 232 Presentation No.1 Fourier Series & Transforms Group A Uzair Akbar Hamza Saeed Khan Muhammad Hammad Saad Mahmood Asim.
Multimedia Data Introduction to Image Processing Dr Sandra I. Woolley Electronic, Electrical.
Lecture 6 Intro to Fourier Series Introduction to Fourier analysis Today I’m now setting homework 1 for submission 31/10/08.
 a mathematical procedure developed by a French mathematician by the name of Fourier  converts complex waveforms into a combination of sine waves, which.
Japan Earthquake 3/11/2011 Climate and Milankovich Cycles.
Vibrationdata 1 Unit 5 The Fourier Transform. Vibrationdata 2 Courtesy of Professor Alan M. Nathan, University of Illinois at Urbana-Champaign.
Fourier series: Eigenfunction Approach
1“Principles & Applications of SAR” Instructor: Franz Meyer © 2009, University of Alaska ALL RIGHTS RESERVED Dr. Franz J Meyer Earth & Planetary Remote.
Sullivan Algebra and Trigonometry: Section 10.2 Objectives of this Section Graph and Identify Polar Equations by Converting to Rectangular Coordinates.
Vibrationdata 1 Unit 6a The Fourier Transform. Vibrationdata 2 Courtesy of Professor Alan M. Nathan, University of Illinois at Urbana-Champaign.
Graphs of Sine and Cosine
Fourier and Wavelet Transformations Michael J. Watts
12.7 Graphing Trigonometric Functions Day 1: Sine and Cosine.
EEE 332 COMMUNICATION Fourier Series Text book: Louis E. Frenzel. Jr. Principles of Electronic Communication Systems, Third Ed. Mc Graw Hill.
Chapter 2. READING ASSIGNMENTS This Lecture: Chapter 2, pp Appendix A: Complex Numbers Appendix B: MATLAB or Labview Chapter 1: Introduction.
CH#3 Fourier Series and Transform 1 st semester King Saud University College of Applied studies and Community Service 1301CT By: Nour Alhariqi.
Chapter 4 Systems of Linear Equations; Matrices
Library of Functions COLLEGE ALGEBRA.
Math Module 2 Lines.
Unit 5 The Fourier Transform.
4 Graphs of the Circular Functions.
Fourier and Wavelet Transformations
Chapter 4 Graphs of the Circular Functions
Fourier Transform.
Trigonometric Identities
Transformations of the Graphs of Sine and Cosine Functions
5.2 Transformations of Sinusoidal Functions
Graphing Sine and Cosine Functions
I. Previously on IET.
Sound Waves and Beats with Vernier Sensors
7.1 Introduction to Fourier Transforms
7.2 Even and Odd Fourier Transforms phase of signal frequencies
A9.2 Graphs of important non-linear functions
Drawing Trigonometric Graphs.
Chapter 4 Systems of Linear Equations; Matrices
C H A P T E R 21 Fourier Series.
Geology 491 Spectral Analysis
7.4 Periodic Graphs & Phase Shifts Objectives:
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Chapter 4 Systems of Linear Equations; Matrices
Presentation transcript:

Fourier Analysis What is it? Modern Applications 2D Shape Analysis Jessica Curry PH 313 What is it? Modern Applications Fourier transform (FT) is an algorithm or mathematical procedure used to simplify a set of data in order to bring out reoccurring events that otherwise may not be seen. The equation for the FT of a function is: The FT changes your data from a time domain to a frequency domain, essentially adding up each signal per time to convert into amplitude per frequency. The FT is a summation of cosine and sine waves, which is equal to the real and imaginary parts of a complex exponential. 2D Shape Analysis FT analysis has proven to be very helpful in modern technologies. Retina scanning, fingerprint recognition, mp3 compression, sound filtering and DNA structural recognition are all current applications that rely on FT. (This method works for any data, not just something as function of time). The same FT analysis can be used in 2D and 3D for the same purposes. Below you’ll see an original image of evenly spaced horizontal lines. Next to it is a picture of the FT of the original. As you can see in the FT, only one vertical line exists. This represents the one reoccurring event, which is the repeating horizontal line. You’ll also notice, that when doing FT in 2D the symmetries are maintained in both the original and FT data. For example look at the rotational symetry….. Like below, the original can be rotated 180˚ and you still have the same image. The same can be said for its FT. Pictured above is a typical fingerprint, and to the right is the FT of it. As you can see there are very unique patterns in the FT, and this is true for every set of prints. Imaginary Now lets take a look at a more complex image; pictured below. Again in this example, rotational symmetry exists at 180˚ and is retained by both images. You can also see some light yellow diagonal lines which can be explained by the fact that the original image is not precise, and therefore has diagonal lines reoccurring at a different frequency. (mirror symtry) Real On the left is an image of our DNA double helix structure created with crystallography and on the right is the FT. As you can see, DNA has a very complex and unique structure, which scientists were able verify using FT analysis. 1D Application Sound Filtering Above is a retina and its FT, again you can see the distinct patterns that are unique to this retina. Any other retina will have a different FT image. Below are two graphs, the green is a typical recording from that would be seen from a tuning fork. The graph to the right shows the FT of the original tuning fork graph. As you can see, there is a sharp peak at 481 Hz, which is the frequency that this particular tuning fork resonates at. Another feature you can also see is the smaller peaks that are less significant. These can be noise and are background tones picked up during recording. In order to get the purest recording, you can flat line those frequencies whose amplitude is below a threshold and eliminate the noise. Then you can perform a reverse FT to reproduce the “original” recording, except the tone in the new recording will be purer and lacking background noise. Above is a graph of Facebook breaks-ups over the time period of a year. On the surface you can see some large peaks around spring break, middle of summer, and before Christmas. When perform a FT of this data (shown below), you can see there are two distinctive frequency peaks. One is at a low frequency, which corresponds to the three large peaks on the original graph. The second is at a high frequency, which corresponds to the weekly break-ups that are not as clearly seen on the original plot. References http://www.relisoft.com/science/physics/complex.html http://www.youtube.com/watch?v=ObklYbQaX24 http://www.geekosystem.com/facebook-breakup-graph/ http://blinkdagger.com/matlab/a-super-simple-introduction-to-fourier-analysis/ http://www.dspguide.com/ch8.htm vnatsci.ltu.edu/natsci/physics/labs/C2Lab02_Sound.pdf http://www.gadgetrivia.com/photos/o/24228-best_fingerprint_scanner.jpg http://www.art-dept.com/artists/rankin/portfolio/specialprojects/images/Eye%20Scapes%20-%2001.jpg Amplitude Acknowledgements Thank you to Ryan Stanley for your help with the GI software. Dr. KC Walsh and my minion Frequency