Lecture 4: Imaging Theory (2/6) – One-dimensional Fourier transforms

Slides:



Advertisements
Similar presentations
Continuous-Time Fourier Transform
Advertisements

Review of 1-D Fourier Theory:
Lecture 7: Basis Functions & Fourier Series
Chapter Four Image Enhancement in the Frequency Domain.
Reminder Fourier Basis: t  [0,1] nZnZ Fourier Series: Fourier Coefficient:
The FFT on a GPU Graphics Hardware 2003 July 27, 2003 Kenneth MorelandEdward Angel Sandia National LabsU. of New Mexico Sandia is a multiprogram laboratory.
Some Properties of the 2-D Fourier Transform Translation Distributivity and Scaling Rotation Periodicity and Conjugate Symmetry Separability Convolution.
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Discrete-Time Convolution Linear Systems and Signals Lecture 8 Spring 2008.
CHAPTER 8 Fourier Filters IMAGE ANALYSIS A. Dermanis.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm.
Fourier Transforms Section Kamen and Heck.
1 The Fourier Series for Discrete- Time Signals Suppose that we are given a periodic sequence with period N. The Fourier series representation for x[n]
(Lecture #08)1 Digital Signal Processing Lecture# 8 Chapter 5.
lecture 4, Convolution and Fourier Convolution Convolution Fourier Convolution Outline  Review linear imaging model  Instrument response function.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Signal and System I The unit step response of an LTI system.
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.
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
Leo Lam © Signals and Systems EE235 Leo Lam.
 Introduction to reciprocal space
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.
2D Fourier Transform.
Digital Image Processing, 2nd ed. www. imageprocessingbook.com © 2001 R. C. Gonzalez & R. E. Woods 1 Review: Linear Systems Some Definitions With reference.
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.
Ch # 11 Fourier Series, Integrals, and Transform 1.
بسم الله الرحمن الرحيم University of Khartoum Department of Electrical and Electronic Engineering Third Year – 2015 Dr. Iman AbuelMaaly Abdelrahman
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Signals & systems Ch.3 Fourier Transform of Signals and LTI System
References Jain (a text book?; IP per se; available)
Jean Baptiste Joseph Fourier
The Fourier Transform Jean Baptiste Joseph Fourier.
11.4 The Chain Rule.
Week 5 The Fourier series and transformation
Lecture 1.26 Spectral analysis of periodic and non-periodic signals.
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Digital Signal Processing Lecture 4 DTFT
The Fourier Transform Jean Baptiste Joseph Fourier.
Fourier Series & The Fourier Transform
Recap: Chapters 1-7: Signals and Systems
The Fourier Transform Jean Baptiste Joseph Fourier.
Chapter 15 Introduction to the Laplace Transform
LAPLACE TRANSFORMS PART-A UNIT-V.
UNIT II Analysis of Continuous Time signal
Sinusoids: continuous time
Math Review CS474/674 – Prof. Bebis.
ENG4BF3 Medical Image Processing
Use Part 1 of the Fundamental Theorem of Calculus to find the derivative of the function. {image}
Section 5.4 Theorems About Definite Integrals
EE 638: Principles of Digital Color Imaging Systems
Fourier Series & The Fourier Transform
Discrete Fourier Transform
Exponential Functions
Phase and Amplitude in Fourier Transforms, Meaning of frequencies
Instructor: S. Narasimhan
The Derivative of an Inverse Function
HKN ECE 210 Exam 3 Review Session
7.10 Single-Sided Exponential
Signals and Systems EE235 Leo Lam ©
Kenneth Moreland Edward Angel Sandia National Labs U. of New Mexico
The Fourier Transform Jean Baptiste Joseph Fourier.
Lecture #8 (Second half) FREQUENCY RESPONSE OF LSI SYSTEMS
Signals and Systems EE235 Lecture 23 Leo Lam ©
Linear Systems Review Objective
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Presentation transcript:

Lecture 4: Imaging Theory (2/6) – One-dimensional Fourier transforms Review of 1-D Fourier Theory Fourier Transform: Inverse Fourier Transform: You may have seen the Fourier transform and its inverse written as: Why use the top version instead? No scaling factor (1/2); easier to remember. Easier to think in Hz than in radians/s

Review of 1-D Fourier Theory, continued Let’s generalize so we can consider functions of variables other than time. Fourier Transform: Inverse Fourier Transform:

Review of 1-D Fourier theory, continued (2)  Orthogonal basis functions f(x) can be viewed as as a linear combination of the complex exponential basis functions. F(u) gives us the magnitude and phase of each of the exponentials that comprise f(x). In fact, the Fourier integral works by sifting out the portion of f(x) that is comprised of the the function exp(+i 2π uo x).

Some Fourier Transform Pairs and Definitions -1/2 1/2 -1 1

Some Fourier Transform Pairs and Definitions, continued

1-D Fourier transform properties If f(x) ↔ F(u) and h(x) ↔ H(u) , Linearity: af(x) + bh(x) ↔ aF(u) + bH(u) Scaling: f(ax) ↔

1-D Fourier transform properties If f(x) ↔ F(u) , Shift: f(x-a) ↔

1-D Fourier transform properties, continued. Say g(x) ↔ G(u). Then, Derivative Theorem: (Emphasizes higher frequencies – high pass filter) Integral Theorem: (Emphasizes lower frequencies – low pass filter)

Even and odd functions and Fourier transforms Any function g(x) can be uniquely decomposed into an even and odd function. e(x) = ½( g(x) + g(-x) ) o(x) = ½( g(x) – g(-x) ) For example, e1 · e2 = even o1 · o2 = even e1 · o1 = odd e1 + e2 = even o1 + o2 = odd

Fourier transforms of even and odd functions Consider the Fourier transforms of even and odd functions. g(x) = e(x) + o(x) Sidebar: E(u) and O(u) can both be complex if e(x) and o(x) are complex. If g(x) is even, then G(u) is even. If g(x) is odd, then G(u) is odd.

Special Cases For a real-valued g(x) ( e(x) , o(x) are both real ), Real part is even in u Imaginary part is odd in u So, G(u) = G*(-u), which is the definition of ~~~~~~~~~~~~~~~~~~~~~~~~ Hermitian Symmetry: G(u) = G*(-u) (even in magnitude, odd in phase)