22.058 - lecture 4, Convolution and Fourier Convolution Convolution Fourier Convolution Outline  Review linear imaging model  Instrument response function.

Slides:



Advertisements
Similar presentations
The imaging problem object imaging optics (lenses, etc.) image
Advertisements

IPIM, IST, José Bioucas, Convolution Operators Spectral Representation Bandlimited Signals/Systems Inverse Operator Null and Range Spaces Sampling,
Signal Processing in the Discrete Time Domain Microprocessor Applications (MEE4033) Sogang University Department of Mechanical Engineering.
Review of 1-D Fourier Theory:
Lecture 4 More Convolution, Diffraction, and Reciprocal Space.
Lecture 5 Fourier Optics. Class Test I: Mark Distribution Mean: 40% Standard deviation: 23%
Optoelectronic Systems Lab., Dept. of Mechatronic Tech., NTNU Dr. Gao-Wei Chang 1 Chap 5 Wave-optics Analysis of Coherent Systems.
BMME 560 & BME 590I Medical Imaging: X-ray, CT, and Nuclear Methods Introductory Topics Part 1.
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.
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
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.
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
lecture 5, Sampling and the Nyquist Condition Sampling Outline  FT of comb function  Sampling Nyquist Condition  sinc interpolation Truncation.
Digital Image Processing, 2nd ed. www. imageprocessingbook.com © 2001 R. C. Gonzalez & R. E. Woods 1 Objective To provide background material in support.
Some Properties of the 2-D Fourier Transform Translation Distributivity and Scaling Rotation Periodicity and Conjugate Symmetry Separability Convolution.
Comp 665 Convolution. Questions? Ask here first. Likely someone else has the same question.
Lecture 9: Fourier Transform Properties and Examples
University of Texas at Austin CS395T - Advanced Image Synthesis Spring 2006 Don Fussell Fourier Transforms.
Basic Image Processing January 26, 30 and February 1.
Chapter 4 The Fourier Transform EE 207 Dr. Adil Balghonaim.
lecture 2, linear imaging systems Linear Imaging Systems Example: The Pinhole camera Outline  General goals, definitions  Linear Imaging Systems.
Linear Systems – why study them? Develop general analysis tools for all modalities Applicable beyond medical imaging Tools provide valuable insights for.
Detecting Electrons: CCD vs Film Practical CryoEM Course July 26, 2005 Christopher Booth.
BMI II SS06 – Class 2 “Linear Systems 2” Slide 1 Biomedical Imaging II Class 2 – Mathematical Preliminaries: Signal Transfer and Linear Systems Theory.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Linearity Time Shift and Time Reversal Multiplication Integration.
Biophotonics lecture 9. November Last time (Monday 7. November)  Review of Fourier Transforms (will be repeated in part today)  Contrast enhancing.
1 Waves 8 Lecture 8 Fourier Analysis. D Aims: ëFourier Theory: > Description of waveforms in terms of a superposition of harmonic waves. > Fourier series.
Fourier theory We know a lot about waves at a single  : n( , v p ( , R(  absorption(  … Analyze arbitrary in terms of these, because Fourier.
Lecture 24: CT Fourier Transform
Optoelectronic Systems Lab., Dept. of Mechatronic Tech., NTNU Dr. Gao-Wei Chang 1 Chap 6 Frequency analysis of optical imaging systems.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
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.
Linearity Recall our expressions for the Fourier Transform and its inverse: The property of linearity: Proof: (synthesis) (analysis)
7- 1 Chapter 7: Fourier Analysis Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic (T) function f(x) can be written as the sum of sines.
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
2D Sampling Goal: Represent a 2D function by a finite set of points.
EE 207 Dr. Adil Balghonaim Chapter 4 The Fourier Transform.
Modulation Transfer Function (MTF)
 Introduction to reciprocal space
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.
Fourier transforms One-dimensional transforms Complex exponential representation:  Fourier transform   Inverse Fourier transform  In.
The Fourier Transform.
Math for CS Fourier Transforms
1 Lecture 06 EEE 341 Introduction to Communication Engineering.
Computer Vision – 2D Signal & System Hanyang University Jong-Il Park.
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.
Chapter 11 Fourier optics
Biointelligence Laboratory, Seoul National University
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Lecture 4: Imaging Theory (2/6) – One-dimensional Fourier transforms
Modern imaging techniques in biology
ENG4BF3 Medical Image Processing
Outline Linear Shift-invariant system Linear filters
2D Fourier transform is separable
EE 638: Principles of Digital Color Imaging Systems
Outline Linear Shift-invariant system Linear filters
Digital Image Processing
Basic Image Processing
Lecture 3: Imaging Theory (1/6) – Linear systems and convolution
Fourier Optics P47 – Optics: Unit 8.
7.7 Fourier Transform Theorems, Part II
Linear Systems Review Objective
Chapter 11 Fourier optics
LECTURE 11: FOURIER TRANSFORM PROPERTIES
پردازش تصاویر دیجیتالی
Even Discrete Cosine Transform The Chinese University of Hong Kong
Presentation transcript:

lecture 4, Convolution and Fourier Convolution Convolution Fourier Convolution Outline  Review linear imaging model  Instrument response function vs Point spread function  Convolution integrals Fourier Convolution Reciprocal space and the Modulation transfer function  Optical transfer function  Examples of convolutions  Fourier filtering  Deconvolution  Example from imaging lab Optimal inverse filters and noise

lecture 4, Convolution and Fourier Convolution Instrument Response Function The Instrument Response Function is a conditional mapping, the form of the map depends on the point that is being mapped. This is often given the symbol h(r|r’). Of course we want the entire output from the whole object function, and so we need to know the IRF at all points.

lecture 4, Convolution and Fourier Convolution Space Invariance Now in addition to every point being mapped independently onto the detector, imaging that the form of the mapping does not vary over space (is independent of r 0 ). Such a mapping is called isoplantic. For this case the instrument response function is not conditional. The Point Spread Function (PSF) is a spatially invariant approximation of the IRF.

lecture 4, Convolution and Fourier Convolution Space Invariance Since the Point Spread Function describes the same blurring over the entire sample, The image may be described as a convolution, or,

lecture 4, Convolution and Fourier Convolution Convolution Integrals Let’s look at some examples of convolution integrals, So there are four steps in calculating a convolution integral: #1. Fold h(x’) about the line x’=0 #2. Displace h(x’) by x #3. Multiply h(x-x’) * g(x’) #4. Integrate

lecture 4, Convolution and Fourier Convolution Convolution Integrals Consider the following two functions: #1. Fold h(x’) about the line x’=0 #2. Displace h(x’) by x x

lecture 4, Convolution and Fourier Convolution Convolution Integrals

lecture 4, Convolution and Fourier Convolution Convolution Integrals Consider the following two functions:

lecture 4, Convolution and Fourier Convolution Convolution Integrals

lecture 4, Convolution and Fourier Convolution Some Properties of the Convolution commutative: associative: multiple convolutions can be carried out in any order. distributive:

lecture 4, Convolution and Fourier Convolution Recall that we defined the convolution integral as, One of the most central results of Fourier Theory is the convolution theorem (also called the Wiener-Khitchine theorem. where, Convolution Integral

lecture 4, Convolution and Fourier Convolution Convolution Theorem In other words, convolution in real space is equivalent to multiplication in reciprocal space.

lecture 4, Convolution and Fourier Convolution Convolution Integral Example We saw previously that the convolution of two top-hat functions (with the same widths) is a triangle function. Given this, what is the Fourier transform of the triangle function? = ?

lecture 4, Convolution and Fourier Convolution Proof of the Convolution Theorem The inverse FT of f(x) is, and the FT of the shifted g(x), that is g(x’-x)

lecture 4, Convolution and Fourier Convolution Proof of the Convolution Theorem So we can rewrite the convolution integral, as, change the order of integration and extract a delta function,

lecture 4, Convolution and Fourier Convolution Proof of the Convolution Theorem or, Integration over the delta function selects out the k’=k value.

lecture 4, Convolution and Fourier Convolution Proof of the Convolution Theorem This is written as an inverse Fourier transformation. A Fourier transform of both sides yields the desired result.

lecture 4, Convolution and Fourier Convolution Fourier Convolution

lecture 4, Convolution and Fourier Convolution Reciprocal Space real space reciprocal space

lecture 4, Convolution and Fourier Convolution Filtering We can change the information content in the image by manipulating the information in reciprocal space. Weighting function in k-space.

lecture 4, Convolution and Fourier Convolution Filtering We can also emphasis the high frequency components. Weighting function in k-space.

lecture 4, Convolution and Fourier Convolution Modulation transfer function

lecture 4, Convolution and Fourier Convolution Optics with lens

lecture 4, Convolution and Fourier Convolution Optics with lens

lecture 4, Convolution and Fourier Convolution Optics with lens

lecture 4, Convolution and Fourier Convolution Optics with lens 2D FT

lecture 4, Convolution and Fourier Convolution Optics with lens Projections

lecture 4, Convolution and Fourier Convolution Optics with lens Projections

lecture 4, Convolution and Fourier Convolution Optics with pinhole

lecture 4, Convolution and Fourier Convolution

2D FT

lecture 4, Convolution and Fourier Convolution Optics with pinhole Projections

lecture 4, Convolution and Fourier Convolution Projections

lecture 4, Convolution and Fourier Convolution Deconvolution to determine MTF of Pinhole

lecture 4, Convolution and Fourier Convolution FT to determine PSF of Pinhole

lecture 4, Convolution and Fourier Convolution Filtered FT to determine PSF of Pinhole