1 Methods in Image Analysis – Lecture 3 Fourier U. Pitt Bioengineering 2630 CMU Robotics Institute 16-725 Spring Term, 2006 George Stetten, M.D., Ph.D.

Slides:



Advertisements
Similar presentations
Continuous-Time Fourier Transform
Advertisements

Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean Hall 5409 T-R 10:30am – 11:50am.
3-D Computational Vision CSc Image Processing II - Fourier Transform.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Fourier Transform – Chapter 13. Image space Cameras (regardless of wave lengths) create images in the spatial domain Pixels represent features (intensity,
Aristotle University of Thessaloniki – Department of Geodesy and Surveying A. DermanisSignals and Spectral Methods in Geoinformatics A. Dermanis Signals.
Fourier Transform – Chapter 13. Fourier Transform – continuous function Apply the Fourier Series to complex- valued functions using Euler’s notation to.
Properties of continuous Fourier Transforms
Reminder Fourier Basis: t  [0,1] nZnZ Fourier Series: Fourier Coefficient:
Fourier Series.
Signal Processing COS 323 COS 323. Digital “Signals” 1D: functions of space or time (e.g., sound)1D: functions of space or time (e.g., sound) 2D: often.
Autumn Analog and Digital Communications Autumn
Math for CSLecture 11 Mathematical Methods for Computer Science Lecture 1.
Fourier Series. is the “fundamental frequency” Fourier Series is the “fundamental frequency”
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Fourier Transform 2D Discrete Fourier Transform - 2D
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
CELLULAR COMMUNICATIONS DSP Intro. Signals: quantization and sampling.
Chapter 4 The Fourier Series and Fourier Transform.
3.0 Fourier Series Representation of Periodic Signals
Systems: Definition Filter
Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm.
Copyright © Shi Ping CUC Chapter 3 Discrete Fourier Transform Review Features in common We need a numerically computable transform, that is Discrete.
ELEC ENG 4035 Communications IV1 School of Electrical & Electronic Engineering 1 Section 2: Frequency Domain Analysis Contents 2.1 Fourier Series 2.2 Fourier.
1 7.1 Discrete Fourier Transform (DFT) 7.2 DFT Properties 7.3 Cyclic Convolution 7.4 Linear Convolution via DFT Chapter 7 Discrete Fourier Transform Section.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Linearity Time Shift and Time Reversal Multiplication Integration.
1 Appendix 02 Linear Systems - Time-invariant systems Linear System Linear System f(t) g(t)
Fundamentals of Electric Circuits Chapter 17
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 2 Signals and Systems (I)
Image Processing © 2002 R. C. Gonzalez & R. E. Woods Lecture 4 Image Enhancement in the Frequency Domain Lecture 4 Image Enhancement.
Basic signals Why use complex exponentials? – Because they are useful building blocks which can be used to represent large and useful classes of signals.
1 Review of Continuous-Time Fourier Series. 2 Example 3.5 T/2 T1T1 -T/2 -T 1 This periodic signal x(t) repeats every T seconds. x(t)=1, for |t|
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Review Resources: Wiki: Superheterodyne Receivers RE: Superheterodyne.
Fourier Series. Introduction Decompose a periodic input signal into primitive periodic components. A periodic sequence T2T3T t f(t)f(t)
1 Fourier Representations of Signals & Linear Time-Invariant Systems Chapter 3.
09/19/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Dithering.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Fourier series: Eigenfunction Approach
Linearity Recall our expressions for the Fourier Transform and its inverse: The property of linearity: Proof: (synthesis) (analysis)
3.0 Fourier Series Representation of Periodic Signals 3.1 Exponential/Sinusoidal Signals as Building Blocks for Many Signals.
Fourier Analysis of Signals and Systems
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Causality Linearity Time Invariance Temporal Models Response to Periodic.
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
1 Methods in Image Analysis – Lecture 3 Fourier CMU Robotics Institute U. Pitt Bioengineering 2630 Spring Term, 2004 George Stetten, M.D., Ph.D.
 Introduction to reciprocal space
Signals and Systems Fall 2003 Lecture #6 23 September CT Fourier series reprise, properties, and examples 2. DT Fourier series 3. DT Fourier series.
بسم الله الرحمن الرحيم University of Khartoum Department of Electrical and Electronic Engineering Third Year – 2015 Dr. Iman AbuelMaaly Abdelrahman
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
Jean Baptiste Joseph Fourier
CS 591 S1 – Computational Audio – Spring 2017
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Digital Signal Processing Lecture 4 DTFT
Image Enhancement in the
UNIT II Analysis of Continuous Time signal
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
EE 638: Principles of Digital Color Imaging Systems
Research Methods in Acoustics Lecture 9: Laplace Transform and z-Transform Jonas Braasch.
UNIT V Linear Time Invariant Discrete-Time Systems
2.2 Fourier Series: Fourier Series and Its Properties
Lecture 15 DTFT: Discrete-Time Fourier Transform
Signals & Systems (CNET - 221) Chapter-4 Fourier Series
Signals & Systems (CNET - 221) Chapter-5 Fourier Transform
Continuous-Time Fourier Transform
Signals and Systems Lecture 15
Signals & Systems (CNET - 221) Chapter-4
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Signals and Systems Lecture 11
Presentation transcript:

1 Methods in Image Analysis – Lecture 3 Fourier U. Pitt Bioengineering 2630 CMU Robotics Institute Spring Term, 2006 George Stetten, M.D., Ph.D.

2 Frequency in time vs. space Classical “signals and systems” usually temporal signals. Image processing uses “spatial” frequency. We will review the classic temporal description first, and then move to 2D and 3D space.

3 Phase vs. Frequency Phase,, is angle, usually represented in radians. (circumference of unit circle) Frequency,, is the rate of change for phase. In a discrete system, the sampling frequency,, is the amount of phase-change per sample.

4 Euler’s Identity

5 Phasor = Complex Number

6 multiplication = rotate and scale

7 Spinning phasor

8

9

10

11 Continuous Fourier Series SynthesisAnalysis is the Fundamental Frequency

12 Selected properties of Fourier Series for real

13 Differentiation boosts high frequencies

14 Integration boosts low frequencies

15 Continuous Fourier Transform SynthesisAnalysis

16 Selected properties of Fourier Transform

17 Special Transform Pairs Impulse has all frequences Average value is at frequency = 0 Aperture produces sync function

18 Discrete signals introduce aliasing Frequency is no longer the rate of phase change in time, but rather the amount of phase change per sample.

19 Sampling > 2 samples per cycle

20 Sampling < 2 samples per cycle

21 Under-sampled sine

22 Discrete Time Fourier Series Sampling frequency is 1 cycle per second, and fundamental frequency is some multiple of that. SynthesisAnalysis

23 Matrix representation

24 Fast Fourier Transform N must be a power of 2 Makes use of the tremendous symmetry within the F -1 matrix O(N log N) rather than O(N 2 )

25 Discrete Time Fourier Transform SynthesisAnalysis Sampling frequency is still 1 cycle per second, but now any frequency are allowed because x[n] is not periodic.

26 The Periodic Spectrum

27 Aliasing Outside the Base Band Perceived as

28 2D Fourier Transform Analysis Synthesis or separating dimensions,

29 Properties Most of the usual properties, such as linearity, etc. Shift-invariant, rather than Time-invariant Parsevals relation becomes Rayleigh’s Theorem Also, Separability, Rotational Invariance, and Projection (see below)

30 Separability

31 Rotation Invariance

32 Projection Combine with rotation, have arbitrary projection.

33 Gaussian seperable Since the Fourier Transform is also separable, the spectra of the 1D Gaussians are, themselves, separable.

34 Hankel Transform For radially symmetrical functions

35 Elliptical Fourier Series for 2D Shape Parametric function, usually with constant velocity. Truncate harmonics to smooth.

36 Fourier shape in 3D Fourier surface of 3D shapes (parameterized on surface). Spherical Harmonics (parameterized in spherical coordinates). Both require coordinate system relative to the object. How to choose? Moments? Problem of poles: singularities cannot be avoided

37 Quaternions – 3D phasors Product is defined such that rotation by arbitrary angles from arbitrary starting points become simple multiplication.

38 Summary Fourier useful for image “processing”, convolution becomes multiplication. Fourier less useful for shape. Fourier is global, while shape is local. Fourier requires object-specific coordinate system.