 Introduction to reciprocal space

Slides:



Advertisements
Similar presentations
Continuous-Time Fourier Transform
Advertisements

Signals and Fourier Theory
Computer Vision Lecture 7: The Fourier Transform
Review of 1-D Fourier Theory:
HILBERT TRANSFORM Fourier, Laplace, and z-transforms change from the time-domain representation of a signal to the frequency-domain representation of the.
Lecture 7: Basis Functions & Fourier Series
Lecture 15 Orthogonal Functions Fourier Series. LGA mean daily temperature time series is there a global warming signal?
Fourier Transform (Chapter 4)
Basis beeldverwerking (8D040) dr. Andrea Fuster Prof.dr. Bart ter Haar Romeny dr. Anna Vilanova Prof.dr.ir. Marcel Breeuwer The Fourier Transform II.
Aristotle University of Thessaloniki – Department of Geodesy and Surveying A. DermanisSignals and Spectral Methods in Geoinformatics A. Dermanis Signals.
Lecture 3 Laplace transform
BMME 560 & BME 590I Medical Imaging: X-ray, CT, and Nuclear Methods Tomography Part 2.
Reminder Fourier Basis: t  [0,1] nZnZ Fourier Series: Fourier Coefficient:
The 2D Fourier Transform F (2) {f(x,y)} = F(k x,k y ) = f(x,y) exp[-i(k x x+k y y)] dx dy If f(x,y) = f x (x) f y (y), then the 2D FT splits into two 1D.
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F(  ) is the spectrum of the function.
Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain.
lecture 5, Sampling and the Nyquist Condition Sampling Outline  FT of comb function  Sampling Nyquist Condition  sinc interpolation Truncation.
Image Enhancement in the Frequency Domain Part I Image Enhancement in the Frequency Domain Part I Dr. Samir H. Abdul-Jauwad Electrical Engineering Department.
Some Properties of the 2-D Fourier Transform Translation Distributivity and Scaling Rotation Periodicity and Conjugate Symmetry Separability Convolution.
Deconstructing periodic driving voltages (or any functions) into their sinusoidal components: It's easy to build a periodic functions by choosing coefficients.
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Feb. 7, 2011 Plane EM Waves The Radiation Spectrum: Fourier Transforms.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
Chapter 25 Nonsinusoidal Waveforms. 2 Waveforms Used in electronics except for sinusoidal Any periodic waveform may be expressed as –Sum of a series of.
Function approximation: Fourier, Chebyshev, Lagrange
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Where we’re going Speed, Storage Issues Frequency Space.
Fourier Transforms Section Kamen and Heck.
Outline  Fourier transforms (FT)  Forward and inverse  Discrete (DFT)  Fourier series  Properties of FT:  Symmetry and reciprocity  Scaling in time.
1 Waves 8 Lecture 8 Fourier Analysis. D Aims: ëFourier Theory: > Description of waveforms in terms of a superposition of harmonic waves. > Fourier series.
Image Processing © 2002 R. C. Gonzalez & R. E. Woods Lecture 4 Image Enhancement in the Frequency Domain Lecture 4 Image Enhancement.
Image Enhancement in the Frequency Domain Spring 2006, Jen-Chang Liu.
Spectral Analysis AOE March 2011 Lowe 1. Announcements Lectures on both Monday, March 28 th, and Wednesday, March 30 th. – Fracture Testing –
lecture 4, Convolution and Fourier Convolution Convolution Fourier Convolution Outline  Review linear imaging model  Instrument response function.
Signals & systems Ch.3 Fourier Transform of Signals and LTI System 5/30/2016.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Digital Image Processing Chapter 4 Image Enhancement in the Frequency Domain Part I.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Background Any function that periodically repeats itself.
Lecture 7: Sampling Review of 2D Fourier Theory We view f(x,y) as a linear combination of complex exponentials that represent plane waves. F(u,v) describes.
ENG4BF3 Medical Image Processing Image Enhancement in Frequency Domain.
October 29, 2013Computer Vision Lecture 13: Fourier Transform II 1 The Fourier Transform In the previous lecture, we discussed the Hough transform. There.
Spatial Frequencies Spatial Frequencies. Why are Spatial Frequencies important? Efficient data representation Provides a means for modeling and removing.
Astronomical Data Analysis I
Fourier Transform.
CS 376b Introduction to Computer Vision 03 / 17 / 2008 Instructor: Michael Eckmann.
1 “Figures and images used in these lecture notes by permission, copyright 1997 by Alan V. Oppenheim and Alan S. Willsky” Signals and Systems Spring 2003.
Chapter 13 Discrete Image Transforms
Frequency domain analysis and Fourier Transform
Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: 2.3 Fourier Transform: From Fourier Series to Fourier Transforms.
Eeng360 1 Chapter 2 Fourier Transform and Spectra Topics:  Fourier transform (FT) of a waveform  Properties of Fourier Transforms  Parseval’s Theorem.
بسم الله الرحمن الرحيم University of Khartoum Department of Electrical and Electronic Engineering Third Year – 2015 Dr. Iman AbuelMaaly Abdelrahman
The Frequency Domain Digital Image Processing – Chapter 8.
The Fourier Transform.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
1.Be able to distinguish linear and non-linear systems. 2.Be able to distinguish space-invariant from space-varying systems. 3.Describe and evaluate convolution.
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Signals & systems Ch.3 Fourier Transform of Signals and LTI System
k is the frequency index
Integral Transform Method
Lecture 4: Imaging Theory (2/6) – One-dimensional Fourier transforms
Image Enhancement in the
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F() is the spectrum of the function.
ENG4BF3 Medical Image Processing
2D Fourier transform is separable
EE 638: Principles of Digital Color Imaging Systems
Fourier transforms and
k is the frequency index
7.1 Introduction to Fourier Transforms
Fourier Transform and Spectra
Fourier Transforms.
Presentation transcript:

 Introduction to reciprocal space Fourier Transforms Outline  Introduction to reciprocal space  Fourier transformation  Some simple functions • Area and zero frequency components • 2- dimensions  Separable  Central slice theorem  Spatial frequencies  Filtering  Modulation Transfer Function 22.56 - lecture 3, Fourier imaging

real space reciprocal space 22.56 - lecture 3, Fourier imaging

Reciprocal Space 22.56 - lecture 3, Fourier imaging

Reciprocal Space real imaginary 22.56 - lecture 3, Fourier imaging

Reconstruction 8 Fourier components 16 32 64 128 22.56 - lecture 3, Fourier imaging

For a complete story see: Brigham “Fast Fourier Transform” Fourier Transforms For a complete story see: Brigham “Fast Fourier Transform” Here we want to cover the practical aspects of Fourier Transforms. Define the Fourier Transform as: There are slight variations on this definition (factors of π and the sign in the exponent), we will revisit these latter, i=√-1. Also recall that 22.56 - lecture 3, Fourier imaging

k is a wave-number and has units that are reciprocal to x: x -> cm Reciprocal variables k is a wave-number and has units that are reciprocal to x: x -> cm k -> 2π/cm So while x describes a position in space, k describes a spatial modulation. Reciprocal variables are also called conjugate variables. Another pair of conjugate variables are time and angular frequency. 22.56 - lecture 3, Fourier imaging

Conditions for the Fourier Transform to Exist The sufficient condition for the Fourier transform to exist is that the function g(x) is square integrable, g(x) may be singular or discontinuous and still have a well defined Fourier transform. 22.56 - lecture 3, Fourier imaging

The Fourier transform is complex The Fourier transform G(k) and the original function g(x) are both in general complex. The Fourier transform can be written as, 22.56 - lecture 3, Fourier imaging

The Fourier transform when g(x) is real The Fourier transform G(k) has a particularly simple form when g(x) is purely real So the real part of the Fourier transform reports on the even part of g(x) and the imaginary part on the odd part of g(x). 22.56 - lecture 3, Fourier imaging

The Fourier transform of a delta function The Fourier transform of a delta function should help to convince you that the Fourier transform is quite general (since we can build functions from delta functions). The delta function picks out the zero frequency value, x k 22.56 - lecture 3, Fourier imaging

The Fourier transform of a delta function So it take all spatial frequencies to create a delta function. 22.56 - lecture 3, Fourier imaging

The basis set of functions (sin and cos) are also orthogonal. The Fourier transform The fact that the Fourier transform of a delta function exists shows that the FT is complete. The basis set of functions (sin and cos) are also orthogonal. So think of the Fourier transform as picking out the unique spectrum of coefficients (weights) of the sines and cosines. 22.56 - lecture 3, Fourier imaging

The Fourier transform of the TopHat Function Define the TopHat function as, The Fourier transform is, which reduces to, 22.56 - lecture 3, Fourier imaging

The Fourier transform of the TopHat Function For the TopHat function The Fourier transform is, 22.56 - lecture 3, Fourier imaging

The Fourier reconstruction of the TopHat Function 22.56 - lecture 3, Fourier imaging

The Fourier transform of a cosine Function Define the cosine function as, where k0 is the wave-number of the original function. The Fourier transform is, which reduces to, cosine is real and even, and so the Fourier transform is also real and even. Two delta functions since we can not tell the sign of the spatial frequency. 22.56 - lecture 3, Fourier imaging

The Fourier transform of a sine Function Define the sine function as, where k0 is the wave-number of the original function. The Fourier transform is, which reduces to, sine is real and odd, and so the Fourier transform is imaginary and odd. Two delta functions since we can not tell the sign of the spatial frequency. 22.56 - lecture 3, Fourier imaging

Telling the sense of rotation Looking at a cosine or sine alone one can not tell the sense of rotation (only the frequency) but if you have both then the sign is measurable. 22.56 - lecture 3, Fourier imaging

if g(x) = g(-x), then G(k) = G(-k) Symmetry Even/odd if g(x) = g(-x), then G(k) = G(-k) if g(x) = -g(-x), then G(k) = -G(-k) Conjugate symmetry if g(x) is purely real and even, then G(k) is purely real. if g(x) is purely real and odd, then G(k) is purely imaginary. if g(x) is purely imaginary and even, then G(k) is purely imaginary. if g(x) is purely imaginary and odd, then G(k) is purely real. 22.56 - lecture 3, Fourier imaging

The Fourier transform of the sign function The sign function is important in filtering applications, it is defined as, The FT is calculated by expanding about the origin, 22.56 - lecture 3, Fourier imaging

The Fourier transform of the Heaviside function The Heaviside (or step) function can be explored using the result of the sign function The FT is then, 22.56 - lecture 3, Fourier imaging

Consider the conjugate pair, The shift theorem Consider the conjugate pair, what is the FT of rewrite as, The new term is not a function of x, so you pick up a frequency dependent phase shift. 22.56 - lecture 3, Fourier imaging

The shift theorem 22.56 - lecture 3, Fourier imaging

The similarity theorem Consider the conjugate pair, what is the FT of so the Fourier transform scales inversely with the scaling of g(x). 22.56 - lecture 3, Fourier imaging

The similarity theorem 22.56 - lecture 3, Fourier imaging

The similarity theorem 22.56 - lecture 3, Fourier imaging

Also called the energy theorem, Rayleigh’s theorem Also called the energy theorem, The amount of energy (the weight) of the spectrum is not changed by looking at it in reciprocal space. In other words, you can make the same measurement in either real or reciprocal space. 22.56 - lecture 3, Fourier imaging

The zero frequency point Also weight of the zero frequency point corresponds to the total integrated area of the function g(x) 22.56 - lecture 3, Fourier imaging

The Inverse Fourier Transform Given a function in reciprocal space G(k) we can return to direct space by the inverse FT, To show this, recall that 22.56 - lecture 3, Fourier imaging

The Fourier transform in 2 dimensions The Fourier transform can act in any number of dimensions, It is separable and the order does not matter. 22.56 - lecture 3, Fourier imaging

Central Slice Theorem The equivalence of the zero-frequency rule in 2D is the central slice theorem. or So a slice of the 2-D FT that passes through the origin corresponds to the 1 D FT of the projection in real space. 22.56 - lecture 3, Fourier imaging

Weighting function in k-space. Filtering We can change the information content in the image by manipulating the information in reciprocal space. Weighting function in k-space. 22.56 - lecture 3, Fourier imaging

We can also emphasis the high frequency components. Filtering We can also emphasis the high frequency components. Weighting function in k-space. 22.56 - lecture 3, Fourier imaging

Modulation transfer function 22.56 - lecture 3, Fourier imaging