ASTR 278 Advanced Astronomy

Slides:



Advertisements
Similar presentations
Signals and Fourier Theory
Advertisements

Lecture 7: Basis Functions & Fourier Series
ACHIZITIA IN TIMP REAL A SEMNALELOR. Three frames of a sampled time domain signal. The Fast Fourier Transform (FFT) is the heart of the real-time spectrum.
Frequency Domain The frequency domain
DFT/FFT and Wavelets ● Additive Synthesis demonstration (wave addition) ● Standard Definitions ● Computing the DFT and FFT ● Sine and cosine wave multiplication.
Intro to Spectral Analysis and Matlab. Time domain Seismogram - particle position over time Time Amplitude.
Fourier Transform – Chapter 13. Image space Cameras (regardless of wave lengths) create images in the spatial domain Pixels represent features (intensity,
Computer Graphics Recitation 6. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
EE-2027 SaS 06-07, L11 1/12 Lecture 11: Fourier Transform Properties and Examples 3. Basis functions (3 lectures): Concept of basis function. Fourier series.
Image Enhancement in the Frequency Domain Part I Image Enhancement in the Frequency Domain Part I Dr. Samir H. Abdul-Jauwad Electrical Engineering Department.
Multi-Resolution Analysis (MRA)
3.1 Chapter 3 Data and Signals Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Deconstructing periodic driving voltages (or any functions) into their sinusoidal components: It's easy to build a periodic functions by choosing coefficients.
SAMPLING & ALIASING. OVERVIEW Periodic sampling, the process of representing a continuous signal with a sequence of discrete data values, pervades the.
Boyce/DiPrima 10th ed, Ch 10.2: Fourier Series Elementary Differential Equations and Boundary Value Problems, 10th edition, by William E. Boyce and Richard.
CH#3 Fourier Series and Transform
Chapter 15 Fourier Series and Fourier Transform
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Vibrationdata 1 Unit 5 The Fourier Transform. Vibrationdata 2 Courtesy of Professor Alan M. Nathan, University of Illinois at Urbana-Champaign.
DTFT And Fourier Transform
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
Lecture 1 Signals in the Time and Frequency Domains
Motivation Music as a combination of sounds at different frequencies
Fourier Series Summary (From Salivahanan et al, 2002)
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Useful Building Blocks Time-Shifting of Signals Derivatives Sampling (Introduction)
The Story of Wavelets.
Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain.
Transforms. 5*sin (2  4t) Amplitude = 5 Frequency = 4 Hz seconds A sine wave.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 19.
Module 2 SPECTRAL ANALYSIS OF COMMUNICATION SIGNAL.
Wireless and Mobile Computing Transmission Fundamentals Lecture 2.
Lecture 9 Fourier Transforms Remember homework 1 for submission 31/10/08 Remember Phils Problems and your notes.
1 Fourier Representations of Signals & Linear Time-Invariant Systems Chapter 3.
Vibrationdata 1 Unit 5 The Fourier Transform. Vibrationdata 2 Courtesy of Professor Alan M. Nathan, University of Illinois at Urbana-Champaign.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
October 29, 2013Computer Vision Lecture 13: Fourier Transform II 1 The Fourier Transform In the previous lecture, we discussed the Hough transform. There.
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
Chapter 2 Signals and Spectra (All sections, except Section 8, are covered.)
Chapter 2. Signals and Linear Systems
Astronomical Data Analysis I
CH#3 Fourier Series and Transform
Vibrationdata 1 Unit 6a The Fourier Transform. Vibrationdata 2 Courtesy of Professor Alan M. Nathan, University of Illinois at Urbana-Champaign.
Fourier series, Discrete Time Fourier Transform and Characteristic functions.
Chapter2 : SIGNALS 1st semester King Saud University
Lecture 3: The Sampling Process and Aliasing 1. Introduction A digital or sampled-data control system operates on discrete- time rather than continuous-time.
1 Copyright © Cengage Learning. All rights reserved. 6. The Trigonometric Functions Graphs of Trigonometric Functions.
Dr. Abdul Basit Siddiqui FUIEMS. QuizTime 30 min. How the coefficents of Laplacian Filter are generated. Show your complete work. Also discuss different.
Topics 1 Specific topics to be covered are: Discrete-time signals Z-transforms Sampling and reconstruction Aliasing and anti-aliasing filters Sampled-data.
Computer Graphics & Image Processing Chapter # 4 Image Enhancement in Frequency Domain 2/26/20161.
Auditory Perception: 2: Linear Systems. Signals en Systems: To understand why the auditory system represents sounds in the way it does, we need to cover.
Frequency domain analysis and Fourier Transform
EEE 332 COMMUNICATION Fourier Series Text book: Louis E. Frenzel. Jr. Principles of Electronic Communication Systems, Third Ed. Mc Graw Hill.
Digital Image Processing Lecture 7: Image Enhancement in Frequency Domain-I Naveed Ejaz.
Frequency Domain Representation of Biomedical Signals.
CH#3 Fourier Series and Transform 1 st semester King Saud University College of Applied studies and Community Service 1301CT By: Nour Alhariqi.
Math for CS Fourier Transforms
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT
Ch 10.2: Fourier Series We will see that many important problems involving partial differential equations can be solved, provided a given function can.
Unit 5 The Fourier Transform.
MECH 373 Instrumentation and Measurements
Continuous-Time Signal Analysis
SAMPLING & ALIASING.
Dr. Nikos Desypris, Oct Lecture 3
Signals and Systems Networks and Communication Department Chapter (1)
Chapter 8 The Discrete Fourier Transform
Fourier transforms and
7.2 Even and Odd Fourier Transforms phase of signal frequencies
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Presentation transcript:

ASTR 278 Advanced Astronomy (lectures 9-12) Lecture 9 An introduction to Fourier Transforms and image processing Prof.Quentin A Parker 1768-1830 Fourier Jean-Baptiste Joseph

Recommended texts The Fourier transform and its applications, R. Bracewell (McGraw-Hill). Image Science, chapter 6, Fourier Transforms and the analysis of Image Resolution and Noise, J.C.Dainty & R. Shaw, 1974, Academic Press (I have a copy) The Analysis and Restoration of Astronomical Data via the Fast Fourier Transform, 1971, J.W.Brault & O.R.White, Astron.Astrophys, 13, 169-189

What is a Fourier Transform? The Fourier transform, in essence, decomposes or separates a waveform or function into sinusoids of different frequency which sum to the original waveform. It identifies or distinguishes the different frequency sinusoids and their respective amplitudes and phase. Fourier transforms, are used extensively in solving problems in science and engineering. The Fourier transform is used in linear systems analysis, optics, antenna systems, random process modeling, probability theory, quantum physics, and boundary-value problems and has been very successfully applied to restoration of astronomical data. The Fourier transform is a versatile and powerful tool used in many fields of science as a mathematical or physical technique to change a problem into one that can be more easily solved (e.g. from the spatial to frequency domain). Some scientists understand Fourier theory as a physical phenomenon, not simply as a mathematical tool! In some branches of science, the Fourier transform of one function may yield to another physical function…

An example A Fourier transform is a representation of some function in terms of a set of sine-waves. The set of sine-waves of different frequencies is orthogonal, and it can be shown that any continuous function can be represented by summing enough sine-waves of the appropriate frequency, amplitude and phase. Note the sum of the three sine-waves is a reasonable approximation to the original function when they have the correct values of frequency, amplitude and phase.

Sine-Waves and Orthogonal Functions A set of functions is orthogonal if none of the functions can be made up from linear combinations of the others. The set of sine-waves of different frequencies is orthogonal. A good analogy is with red, green, and blue light. However you vary the quantities, you cannot make red from any mixture of green and blue. But with all three colours, you can make any colour you like. Similarly, by mixing sine-waves of every frequency in the right proportions, we can construct any arbitrary function A Fourier Transform (FT) is essentially a method whereby we may obtain a variation in a quantity as a spectral function (e.g. plotted against frequency) from the variation of the quantity as a function of period (e.g. plotted against time or space). The transform holds equally in the reverse direction.

Example continued Now we will look at the Fourier Transform of the function. The result consists of a series of peaks, the largest of which are at 2, 3 and 5 on the x-axis. These correspond exactly to the sine-wave frequencies which we used to reconstruct the original function. Careful examination reveals that the heights of the peaks correspond to the amplitudes of the three waves: The smaller peaks in the Fourier transform correspond to additional smaller waves which would have to be added to get a perfect fit to the original function. Thus we can see that the Fourier Transform tells us what mixture of sine-waves is required to make up any function.

Generating a square wave

The Fourier Transform as a mathematical concept The Fourier Transform is based on the discovery that it is possible to take any periodic function of time x(t) and resolve it into an equivalent infinite summation of sine waves and cosine waves with frequencies that start at 0 and increase in integer multiples of a base frequency f0 = 1/T, where T is the period of x(t). Here is what the expansion looks like: An expression of the form of the right hand side of this equation is called a Fourier Series. The job of a Fourier Transform is to figure out all the ak and bk values to produce a Fourier Series, given the base frequency and the function x(t). You can think of the a0 term outside the summation as the cosine coefficient for k=0. There is no corresponding zero-frequency sine coefficient b0 because the sine of zero is zero, and therefore such a coefficient would have no effect.

The Fourier Transform as a mathematical concept continued….. Of course, we cannot do an infinite summation of any kind on a real computer, so we have to settle for a finite set of sines and cosines. It turns out that this is easy to do for a digitally sampled input, when we stipulate that there will be the same number of frequency output samples as there are time input samples. Also digital signal recordings have a finite length. We can pretend that the function x(t) is periodic, and that the period is the same as the length of the samples signal. In other words, imagine the recording repeating forever, and call this repeating function x(t). The duration of the repeated section defines the base frequency f0 in the equations above. In other words, f0 = samplingRate /N, where N is the number of samples in the recording.

Example As a concrete example, if you are using a sampling rate of 44100 samples/second, and the length of your detected signal is 1024 samples, the amount of time represented by the recording is 1024 / 44100 = 0.02322 seconds Hence the base frequency f0 will be 1 / 0.02322 = 43.07 Hz. If you process these 1024 samples with the FFT, the output will be the sine and cosine coefficients ak and bk for the frequencies 43.07Hz, 2*43.07Hz, 3*43.07Hz, etc. To verify that the transform is functioning correctly, you could then generate all the sines and cosines at these frequencies, multiply them by their respective ak and bk coefficients, add these all together, and you will get your original recording back!

Conceptually it’s a domain thing! For example a measured signal (e.g. as might be detected with a radio telescope) can be viewed from two different standpoints: 1. The frequency domain 2. The time domain In astronomy the frequency domain is perhaps the most familiar, because a spectrometer, e.g. a prism or a diffraction grating, splits light into its component color or frequencies and permits us to record its spectral content. This is like the trace on a spectrum analyser, where the horizontal deflection is the frequency variable and the vertical deflection is the signals amplitude at that frequency. In the lab we are also familiar with the time domain. This is like the trace on an oscilloscope where the vertical deflection is the signals amplitude, and the horizontal deflection is the time variable. Any signal can be fully described in either of these domains. We can go between the two by using Fourier transforms but quite often it is often more convenient to work in the frequency domain. Why the frequency domain ? Depending on what we want to do with the signal, one domain tends to be more useful than the other, so rather than getting tied up in mathematics with a time domain signal we might convert it to the frequency domain where the mathematics are simpler.

Domain equivalence

Mathematical definition Note that the units of the variable `x’ are the reciprocal of those of `u’

In the optical and imaging domain f(x) is usually a function of distance and F(u) is a function of spatial frequency –defined in cycles/mm say.

Some elementary Fourier Transforms The Dirac Delta function ……………………... 1 This function is essentially an infinitely narrow spike of infinite height which is conveniently drawn as a vertical arrow of unit height. They have a number of interesting properties….

Dirac Delta function also called unit impulse function

Some Fourier transform pairs involving the delta function

Rectangular function & relation to delta function Delta functions have a number of interesting properties including the sifting property:

As the width `a’ of the rectangle function increases, the transform becomes taller and narrower. In the limit as a infinity the rectangle function becomes the constant function and its transform becomes the delta function:

The Rectangular Function