Topics. View Aliasing. CT Sampling Requirements. Sampling Requirements in CT Sampling Theory Aliasing

Size: px
Start display at page:

Download "Topics. View Aliasing. CT Sampling Requirements. Sampling Requirements in CT Sampling Theory Aliasing"

Transcription

1 Topics Bioengineering 280A Principles of Biomedical Imaging Sampling Requirements in CT Sampling Theory Aliasing Fall Quarter 2007 CT/Fourier Lecture 4 CT Sampling Requirements View Aliasing What should the size of the detectors be? How many detectors do we need? How many views do we need? Kak and Slaney 1

2 Aliasing Artifacts Object Effect of Noise Aliasing due to insufficient number of detectors Aliasing due to insufficient number of views Kak and Slaney Analog vs. Digital The Process of Sampling The Analog World: Continuous time/space continuous valued signals or images e.g. vinyl records photographs -ray films. g() The Digital World: Discrete time/space discrete-valued signals or images e.g. CD-Roms DVDs digital photos digital -rays CT MRI ultrasound. Δ sample g[n]=g(n Δ) 2

3 Questions Sampling in the Time Domain How finely do we need to sample? What happens if we don t sample finely enough? Can we reconstruct the original signal or image from its samples? Sampling in Image Space Sampling in k-space 3

4 Sampling in k-space Comb Function comb() = "( # n) % n=# Other names: Impulse train bed of nails shah function. Scaled Comb Function comb # & % ( = )( " ' " * n) n=* = )( * n" ) " n=* = " )( * n") n=* Δ 1D spatial sampling g S () = g() 1 " comb # & % ( " ' Recall the sifting property = g() )( * n") n=* = g(n"))( * n") n=* % # g()"( # a) = g(a) But we can also write % g(a)"( # a) = g(a) % "( # a) = g(a) So g()"( # a) = g(a)"( # a) # # 4

5 1D spatial sampling g() comb(/δ)/ Δ Fourier Transform of comb() F[ comb() ] = comb(k ) % = "(k # n) n=# Δ g S () # F 1 " comb( % " ) & ' ( = 1 " "comb(k ") = )(k " * n) n=* = 1 " n=* )(k * n " ) Fourier Transform of comb(/ Δ) comb(/ Δ)/ Δ Δ F 1/Δ comb(k Δ) 1/Δ k Fourier Transform of g S () [ ] = F g() 1 " comb % F g S () ) * # & (. " '- ) = G(k ) / F 1 " comb # & % (. * " '- = G(k ) / 1 " = 1 " = 1 " 2 3 n= n= n=12 # 0 k 1 n & % ( " ' # G(k ) /0 k 1 n & % ( " ' # G k 1 n & % ( " ' 5

6 Fourier Transform of g S () Nyquist Condition G(k ) G(k ) k -B B k G S (k ) 1/Δ G S (k ) k k =1/Δ 1/Δ To avoid overlap we require that 1/Δ>2B or > 2B where =1/ Δ is the sampling frequency Eample Reconstruction from Samples Assume that the highest spatial frequency in an object is B = 2 cm -1. Thus smallest spatial period is 0.5 cm.. Nyquist theorem says we need to sample with Δ < 1/2B = 0.25 cm =1/Δ G S (k ) Multiply by (1/ )rect(k / ) This corresponds to 2 samples per spatial period. (1/ ) G S (k )rect(k / ) =G(k ) 6

7 Eample Cosine Reconstruction -k 0 k 0 cos(2πk 0 ) >2k 0 Reconstruction from Samples If the Nyquist condition is met then G ˆ S (k ) = 1 G S (k )rect(k / ) = G(k ) And the signal can be reconstructed by convolving the sample with a sinc function -k 0 k 0 -k 0 k 0 =2k 0 g ˆ S () = g S ()" sinc(k s ) ( & = * ' g(n#x)( % n#x) -" sinc(k s ) ) n=%& & ' = g(n#x) sinc(k s ( % n#)) n=%& g() Reconstruction from Samples g S () Cosine Eample with =2k 0 Sample at Δ ˆ g S () sinc(k s ) = sinc( / ") 7

8 Eample with K s =4k 0 Eample with K s =8k 0 Aliasing Aliasing Eample -B B G(k ) k Aliasing occurs when the Nyquist condition is not satisfied. This occurs for 2B 8

9 Aliasing Eample Aliasing Eample cos(2πk 0 ) cos(2πk 0 ) -k 0 k 0 -k 0 k 0 =k 0 2k 0 > >k 0 -k 0 k 0 -k 0 k 0 Eample Detector Sampling Requirements 1. C onsider the function g() = cos 2 ( 2"k 0 ). Sketch this function. You sample this signal in the spatial domain with a sampling rate =1/# (e.g. samples spaced at intervals of # ). What is the minimum sampling rate that you can use without aliasing? Give an intuitive eplanation for your answer. Sampling interval Δr Beamwidth Δs 9

10 Smoothing of Projection Smoothing of Projection Projection g s (l") = rect(l /#s) g( l" ) G s (k ") = #ssinc(k #s)g(k ") Beam Width 2/(Δs) Smoothed Projection Sampling Requirements View Aliasing Smoothed Projection Detectors Δr Δs/2 Sampled Smooth Projection Kak and Slaney 10

11 View Sampling Requirements View Sampling -- how many views? Basic idea is that to make the maimum angular sampling the same as the projection sampling. "FOV N views = #r N views360 = "FOV #r N views180 = "N proj 2 = "N proj (for 360 degrees) (for 180 degrees) Eample beamwidth "s = 1 mm Field of View (FOV) = 50 cm "r = "s/2 = 0.5 mm 500 mm/ 0.5 mm = N = 1000 detector samples # * N = 3146 views per 360 degrees 1500 views per 180 degrees CT "Rule of Thumb" N view = N det ectors = N piels 11

Fourier Reconstruction. Polar Version of Inverse FT. Filtered Backprojection [ ] Bioengineering 280A Principles of Biomedical Imaging

Fourier Reconstruction. Polar Version of Inverse FT. Filtered Backprojection [ ] Bioengineering 280A Principles of Biomedical Imaging Fourier Reconstruction Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2014 CT/Fourier Lecture 5 F Interpolate onto Cartesian grid with appropriate density correction then take inverse

More information

Representation of 1D Function

Representation of 1D Function Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2005 Linear Systems Lecture 2 Representation of 1D Function From the sifting property, we can write a 1D function as g( = g(ξδ( ξdξ. To

More information

Representation of 1D Function

Representation of 1D Function Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2005 Linear Systems Lecture 2 Representation of 1D Function From the sifting property, we can write a 1D function as g(x) = g(ξ)δ(x ξ)dξ.

More information

Fourier Sampling. Fourier Sampling. Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2005 Linear Systems Lecture 3.

Fourier Sampling. Fourier Sampling. Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2005 Linear Systems Lecture 3. Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2005 Linear Sstems Lecture 3 Fourier Sampling F Instead of sampling the signal, we sample its Fourier Transform Sample??? F -1 Fourier

More information

Topics. EM spectrum. X-Rays Computed Tomography Direct Inverse and Iterative Inverse Backprojection Projection Theorem Filtered Backprojection

Topics. EM spectrum. X-Rays Computed Tomography Direct Inverse and Iterative Inverse Backprojection Projection Theorem Filtered Backprojection Bioengineering 28A Principles of Biomedical Imaging Fall Quarter 25 X-Rays/CT Lecture Topics X-Rays Computed Tomography Direct Inverse and Iterative Inverse Backprojection Projection Theorem Filtered Backprojection

More information

Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2005 X-Rays/CT Lecture 1. Topics

Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2005 X-Rays/CT Lecture 1. Topics Bioengineering 28A Principles of Biomedical Imaging Fall Quarter 25 X-Rays/CT Lecture Topics X-Rays Computed Tomography Direct Inverse and Iterative Inverse Backprojection Projection Theorem Filtered Backprojection

More information

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals 1. Sampling and Reconstruction 2. Quantization 1 1. Sampling & Reconstruction DSP must interact with an analog world: A to D D to A x(t)

More information

Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2006 X-Rays Lecture 3. Topics

Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2006 X-Rays Lecture 3. Topics Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2006 X-Rays Lecture 3 Topics Address questions from last lecture Review image equation Linearity Delta Functions Superposition Convolution

More information

Quality Improves with More Rays

Quality Improves with More Rays Recap Quality Improves with More Rays Area Area 1 shadow ray 16 shadow rays CS348b Lecture 8 Pat Hanrahan / Matt Pharr, Spring 2018 pixelsamples = 1 jaggies pixelsamples = 16 anti-aliased Sampling and

More information

Module 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals

Module 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals Module 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals Objectives Scope of this lecture: If a Continuous Time (C.T.) signal is to be uniquely represented

More information

Assignment 2 Solutions

Assignment 2 Solutions EE225E/BIOE265 Spring 2012 Principles of MRI Miki Lustig Assignment 2 Solutions 1. Read Nishimura Ch. 3 2. Non-Uniform Sampling. A student has an assignment to monitor the level of Hetch-Hetchi reservoir

More information

Topics. Example. Modulation. [ ] = G(k x. ] = 1 2 G ( k % k x 0) G ( k + k x 0) ] = 1 2 j G ( k x

Topics. Example. Modulation. [ ] = G(k x. ] = 1 2 G ( k % k x 0) G ( k + k x 0) ] = 1 2 j G ( k x Topics Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2008 CT/Fourier Lecture 3 Modulation Modulation Transfer Function Convolution/Multiplication Revisit Projection-Slice Theorem Filtered

More information

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some

More information

Topics. Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2006 CT/Fourier Lecture 2

Topics. Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2006 CT/Fourier Lecture 2 Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2006 CT/Fourier Lecture 2 Topics Modulation Modulation Transfer Function Convolution/Multiplication Revisit Projection-Slice Theorem Filtered

More information

Convolution/Modulation Theorem. 2D Convolution/Multiplication. Application of Convolution Thm. Bioengineering 280A Principles of Biomedical Imaging

Convolution/Modulation Theorem. 2D Convolution/Multiplication. Application of Convolution Thm. Bioengineering 280A Principles of Biomedical Imaging Bioengineering 8A Principles of Biomedical Imaging Fall Quarter 15 CT/Fourier Lecture 4 Convolution/Modulation Theorem [ ] e j πx F{ g(x h(x } = g(u h(x udu = g(u h(x u e j πx = g(uh( e j πu du = H( dxdu

More information

IB Paper 6: Signal and Data Analysis

IB Paper 6: Signal and Data Analysis IB Paper 6: Signal and Data Analysis Handout 5: Sampling Theory S Godsill Signal Processing and Communications Group, Engineering Department, Cambridge, UK Lent 2015 1 / 85 Sampling and Aliasing All of

More information

Signals & Systems. Chapter 7: Sampling. Adapted from: Lecture notes from MIT, Binghamton University, and Purdue. Dr. Hamid R.

Signals & Systems. Chapter 7: Sampling. Adapted from: Lecture notes from MIT, Binghamton University, and Purdue. Dr. Hamid R. Signals & Systems Chapter 7: Sampling Adapted from: Lecture notes from MIT, Binghamton University, and Purdue Dr. Hamid R. Rabiee Fall 2013 Outline 1. The Concept and Representation of Periodic Sampling

More information

Review: Continuous Fourier Transform

Review: Continuous Fourier Transform Review: Continuous Fourier Transform Review: convolution x t h t = x τ h(t τ)dτ Convolution in time domain Derivation Convolution Property Interchange the order of integrals Let Convolution Property By

More information

EE16B - Spring 17 - Lecture 11B Notes 1

EE16B - Spring 17 - Lecture 11B Notes 1 EE6B - Spring 7 - Lecture B Notes Murat Arcak 6 April 207 Licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License. Interpolation with Basis Functions Recall that

More information

6.003: Signals and Systems. Sampling and Quantization

6.003: Signals and Systems. Sampling and Quantization 6.003: Signals and Systems Sampling and Quantization December 1, 2009 Last Time: Sampling and Reconstruction Uniform sampling (sampling interval T ): x[n] = x(nt ) t n Impulse reconstruction: x p (t) =

More information

Topics. EM spectrum. X-Rays Computed Tomography Direct Inverse and Iterative Inverse Backprojection Projection Theorem Filtered Backprojection

Topics. EM spectrum. X-Rays Computed Tomography Direct Inverse and Iterative Inverse Backprojection Projection Theorem Filtered Backprojection Bioengineering 28A Principles of Biomedical Imaging Fall Quarter 24 X-Rays/CT Lecture Topics X-Rays Computed Tomography Direct Inverse and Iterative Inverse Backprojection Projection Theorem Filtered Backprojection

More information

ESE 531: Digital Signal Processing

ESE 531: Digital Signal Processing ESE 531: Digital Signal Processing Lec 9: February 13th, 2018 Downsampling/Upsampling and Practical Interpolation Lecture Outline! CT processing of DT signals! Downsampling! Upsampling 2 Continuous-Time

More information

Sampling in k-space. Aliasing. Aliasing. Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2010 MRI Lecture 3. Slower B z (x)=g x x

Sampling in k-space. Aliasing. Aliasing. Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2010 MRI Lecture 3. Slower B z (x)=g x x Sampling in k-space Bioengineering 80A Principles of Biomedical Imaging Fall Quarer 00 MRI Lecure 3 Thomas Liu, BE80A, UCSD, Fall 008 Aliasing Aliasing Slower B z (G Faser Inuiive view of Aliasing FOV

More information

Fourier transform. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year

Fourier transform. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year Fourier transform Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Methods for Image Processing academic year 27 28 Function transforms Sometimes, operating on a class of functions

More information

The Fourier Transform

The Fourier Transform The Fourier Transorm Fourier Series Fourier Transorm The Basic Theorems and Applications Sampling Bracewell, R. The Fourier Transorm and Its Applications, 3rd ed. New York: McGraw-Hill, 2. Eric W. Weisstein.

More information

Therefore the new Fourier coefficients are. Module 2 : Signals in Frequency Domain Problem Set 2. Problem 1

Therefore the new Fourier coefficients are. Module 2 : Signals in Frequency Domain Problem Set 2. Problem 1 Module 2 : Signals in Frequency Domain Problem Set 2 Problem 1 Let be a periodic signal with fundamental period T and Fourier series coefficients. Derive the Fourier series coefficients of each of the

More information

Biomedical Engineering Image Formation

Biomedical Engineering Image Formation Biomedical Engineering Image Formation PD Dr. Frank G. Zöllner Computer Assisted Clinical Medicine Medical Faculty Mannheim Learning objectives! Understanding the process of image formation! Point spread

More information

BME 50500: Image and Signal Processing in Biomedicine. Lecture 5: Correlation and Power-Spectrum CCNY

BME 50500: Image and Signal Processing in Biomedicine. Lecture 5: Correlation and Power-Spectrum CCNY 1 BME 50500: Image and Signal Processing in Biomedicine Lecture 5: Correlation and Power-Spectrum Lucas C. Parra Biomedical Engineering Department CCNY http://bme.ccny.cuny.edu/faculty/parra/teaching/signal-and-image/

More information

Convolution Theorem Modulation Transfer Function y(t)=g(t)*h(t)

Convolution Theorem Modulation Transfer Function y(t)=g(t)*h(t) MTF = Fourier Transform of PSF Bioengineering 28A Principles of Biomedical Imaging Fall Quarter 214 CT/Fourier Lecture 4 Bushberg et al 21 Convolution Theorem Modulation Transfer Function y(t=g(t*h(t g(t

More information

Digital Signal Processing. Midterm 1 Solution

Digital Signal Processing. Midterm 1 Solution EE 123 University of California, Berkeley Anant Sahai February 15, 27 Digital Signal Processing Instructions Midterm 1 Solution Total time allowed for the exam is 8 minutes Some useful formulas: Discrete

More information

Signal Processing and Linear Systems1 Lecture 4: Characterizing Systems

Signal Processing and Linear Systems1 Lecture 4: Characterizing Systems Signal Processing and Linear Systems Lecture : Characterizing Systems Nicholas Dwork www.stanford.edu/~ndwork Our goal will be to develop a way to learn how the system behaves. In general, this is a very

More information

Biomedical Engineering Image Formation II

Biomedical Engineering Image Formation II Biomedical Engineering Image Formation II PD Dr. Frank G. Zöllner Computer Assisted Clinical Medicine Medical Faculty Mannheim Fourier Series - A Fourier series decomposes periodic functions or periodic

More information

Frequency2: Sampling and Aliasing

Frequency2: Sampling and Aliasing CS 4495 Computer Vision Frequency2: Sampling and Aliasing Aaron Bobick School of Interactive Computing Administrivia Project 1 is due tonight. Submit what you have at the deadline. Next problem set stereo

More information

Digital Signal Processing, Homework 2, Spring 2013, Prof. C.D. Chung. n; 0 n N 1, x [n] = N; N n. ) (n N) u [n N], z N 1. x [n] = u [ n 1] + Y (z) =

Digital Signal Processing, Homework 2, Spring 2013, Prof. C.D. Chung. n; 0 n N 1, x [n] = N; N n. ) (n N) u [n N], z N 1. x [n] = u [ n 1] + Y (z) = Digital Signal Processing, Homework, Spring 0, Prof CD Chung (05%) Page 67, Problem Determine the z-transform of the sequence n; 0 n N, x [n] N; N n x [n] n; 0 n N, N; N n nx [n], z d dz X (z) ) nu [n],

More information

Images have structure at various scales

Images have structure at various scales Images have structure at various scales Frequency Frequency of a signal is how fast it changes Reflects scale of structure A combination of frequencies 0.1 X + 0.3 X + 0.5 X = Fourier transform Can we

More information

Lecture 3: Linear Filters

Lecture 3: Linear Filters Lecture 3: Linear Filters Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Images as functions Linear systems (filters) Convolution and correlation Discrete Fourier Transform (DFT)

More information

Lecture 3: Linear Filters

Lecture 3: Linear Filters Lecture 3: Linear Filters Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Images as functions Linear systems (filters) Convolution and correlation Discrete Fourier Transform (DFT)

More information

Apodization. Gibbs Artifact. Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2013 MRI Lecture 5. rect(k x )

Apodization. Gibbs Artifact. Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2013 MRI Lecture 5. rect(k x ) Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2013 MRI Lecture 5 GE Medical Systems 2003 Gibbs Artifact Apodization rect(k ) Hanning Window h(k )=1/2(1+cos(2πk ) 256256 image 256128

More information

Digital Image Processing

Digital Image Processing Digital Image Processing Part 3: Fourier Transform and Filtering in the Frequency Domain AASS Learning Systems Lab, Dep. Teknik Room T109 (Fr, 11-1 o'clock) achim.lilienthal@oru.se Course Book Chapter

More information

Backprojection. Projections. Projections " $ & cosθ & Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2014 CT/Fourier Lecture 2

Backprojection. Projections. Projections  $ & cosθ & Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2014 CT/Fourier Lecture 2 Backprojection Bioengineering 280A Principles of Biomedical Imaging 3 0 0 0 0 3 0 0 0 0 0 3 0 0 3 0 3 Fall Quarter 2014 CT/Fourier Lecture 2 0 0 0 1 1 1 0 0 0 1 0 0 1 2 1 0 0 1 1 1 0 1 3 1 0 1 1 1 1 1

More information

MRI Physics II: Gradients, Imaging. Douglas C. Noll, Ph.D. Dept. of Biomedical Engineering University of Michigan, Ann Arbor

MRI Physics II: Gradients, Imaging. Douglas C. Noll, Ph.D. Dept. of Biomedical Engineering University of Michigan, Ann Arbor MRI Physics II: Gradients, Imaging Douglas C., Ph.D. Dept. of Biomedical Engineering University of Michigan, Ann Arbor Magnetic Fields in MRI B 0 The main magnetic field. Always on (0.5-7 T) Magnetizes

More information

Spin-Warp Pulse Sequence

Spin-Warp Pulse Sequence Bioengineering 28A Principles of Biomedical Imaging Fall Quarter 25 Linear Systems Lecture Spin-Warp Pulse Sequence RF G x (t G y (t k y k x K-space trajectories EPI Spiral k y k y k x k x Credit: Larry

More information

This theorem guarantees solutions to many problems you will encounter. exists, then f ( c)

This theorem guarantees solutions to many problems you will encounter. exists, then f ( c) Maimum and Minimum Values Etreme Value Theorem If f () is continuous on the closed interval [a, b], then f () achieves both a global (absolute) maimum and global minimum at some numbers c and d in [a,

More information

G52IVG, School of Computer Science, University of Nottingham

G52IVG, School of Computer Science, University of Nottingham Image Transforms Fourier Transform Basic idea 1 Image Transforms Fourier transform theory Let f(x) be a continuous function of a real variable x. The Fourier transform of f(x) is F ( u) f ( x)exp[ j2πux]

More information

3. Lecture. Fourier Transformation Sampling

3. Lecture. Fourier Transformation Sampling 3. Lecture Fourier Transformation Sampling Some slides taken from Digital Image Processing: An Algorithmic Introduction using Java, Wilhelm Burger and Mark James Burge Separability ² The 2D DFT can be

More information

Chap 4. Sampling of Continuous-Time Signals

Chap 4. Sampling of Continuous-Time Signals Digital Signal Processing Chap 4. Sampling of Continuous-Time Signals Chang-Su Kim Digital Processing of Continuous-Time Signals Digital processing of a CT signal involves three basic steps 1. Conversion

More information

ECE 301 Fall 2011 Division 1 Homework 10 Solutions. { 1, for 0.5 t 0.5 x(t) = 0, for 0.5 < t 1

ECE 301 Fall 2011 Division 1 Homework 10 Solutions. { 1, for 0.5 t 0.5 x(t) = 0, for 0.5 < t 1 ECE 3 Fall Division Homework Solutions Problem. Reconstruction of a continuous-time signal from its samples. Let x be a periodic continuous-time signal with period, such that {, for.5 t.5 x(t) =, for.5

More information

EE 261 The Fourier Transform and its Applications Fall 2006 Midterm Exam Solutions

EE 261 The Fourier Transform and its Applications Fall 2006 Midterm Exam Solutions EE 6 The Fourier Transform and its Applications Fall 006 Midterm Exam Solutions There are six questions for a total of 00 points. Please write your answers in the exam booklet provided, and make sure that

More information

EE123 Digital Signal Processing

EE123 Digital Signal Processing EE23 Digital Signal Processing Lecture 7B Sampling What is this Phenomena? https://www.youtube.com/watch?v=cxddi8m_mzk Sampling of Continuous ime Signals (Ch.4) Sampling: Conversion from C. (not quantized)

More information

Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt

Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt Homework 4 May 2017 1. An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt Determine the impulse response of the system. Rewriting as y(t) = t e (t

More information

Information and Communications Security: Encryption and Information Hiding

Information and Communications Security: Encryption and Information Hiding Short Course on Information and Communications Security: Encryption and Information Hiding Tuesday, 10 March Friday, 13 March, 2015 Lecture 5: Signal Analysis Contents The complex exponential The complex

More information

Solution 7 August 2015 ECE301 Signals and Systems: Final Exam. Cover Sheet

Solution 7 August 2015 ECE301 Signals and Systems: Final Exam. Cover Sheet Solution 7 August 2015 ECE301 Signals and Systems: Final Exam Cover Sheet Test Duration: 120 minutes Coverage: Chap. 1, 2, 3, 4, 5, 7 One 8.5" x 11" crib sheet is allowed. Calculators, textbooks, notes

More information

K-space. Spin-Warp Pulse Sequence. At each point in time, the received signal is the Fourier transform of the object s(t) = M( k x

K-space. Spin-Warp Pulse Sequence. At each point in time, the received signal is the Fourier transform of the object s(t) = M( k x Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2015 MRI Lecture 4 k (t) = γ 2π k y (t) = γ 2π K-space At each point in time, the received signal is the Fourier transform of the object

More information

Lecture 8: Signal Reconstruction, DT vs CT Processing. 8.1 Reconstruction of a Band-limited Signal from its Samples

Lecture 8: Signal Reconstruction, DT vs CT Processing. 8.1 Reconstruction of a Band-limited Signal from its Samples EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 8: Signal Reconstruction, D vs C Processing Oct 24, 2001 Prof: J. Bilmes

More information

Fourier Series Example

Fourier Series Example Fourier Series Example Let us compute the Fourier series for the function on the interval [ π,π]. f(x) = x f is an odd function, so the a n are zero, and thus the Fourier series will be of the form f(x)

More information

2A1H Time-Frequency Analysis II

2A1H Time-Frequency Analysis II 2AH Time-Frequency Analysis II Bugs/queries to david.murray@eng.ox.ac.uk HT 209 For any corrections see the course page DW Murray at www.robots.ox.ac.uk/ dwm/courses/2tf. (a) A signal g(t) with period

More information

Fourier Transform Chapter 10 Sampling and Series

Fourier Transform Chapter 10 Sampling and Series Fourier Transform Chapter 0 Sampling and Series Sampling Theorem Sampling Theorem states that, under a certain condition, it is in fact possible to recover with full accuracy the values intervening between

More information

FROM ANALOGUE TO DIGITAL

FROM ANALOGUE TO DIGITAL SIGNALS AND SYSTEMS: PAPER 3C1 HANDOUT 7. Dr David Corrigan 1. Electronic and Electrical Engineering Dept. corrigad@tcd.ie www.mee.tcd.ie/ corrigad FROM ANALOGUE TO DIGITAL To digitize signals it is necessary

More information

Introduction to the Mathematics of Medical Imaging

Introduction to the Mathematics of Medical Imaging Introduction to the Mathematics of Medical Imaging Second Edition Charles L. Epstein University of Pennsylvania Philadelphia, Pennsylvania EiaJTL Society for Industrial and Applied Mathematics Philadelphia

More information

Signal Processing COS 323

Signal Processing COS 323 Signal Processing COS 323 Digital Signals D: functions of space or time e.g., sound 2D: often functions of 2 spatial dimensions e.g. images 3D: functions of 3 spatial dimensions CAT, MRI scans or 2 space,

More information

ESE 531: Digital Signal Processing

ESE 531: Digital Signal Processing ESE 531: Digital Signal Processing Lec 8: February 7th, 2017 Sampling and Reconstruction Lecture Outline! Review " Ideal sampling " Frequency response of sampled signal " Reconstruction " Anti-aliasing

More information

2A1H Time-Frequency Analysis II Bugs/queries to HT 2011 For hints and answers visit dwm/courses/2tf

2A1H Time-Frequency Analysis II Bugs/queries to HT 2011 For hints and answers visit   dwm/courses/2tf Time-Frequency Analysis II (HT 20) 2AH 2AH Time-Frequency Analysis II Bugs/queries to david.murray@eng.ox.ac.uk HT 20 For hints and answers visit www.robots.ox.ac.uk/ dwm/courses/2tf David Murray. A periodic

More information

Index. p, lip, 78 8 function, 107 v, 7-8 w, 7-8 i,7-8 sine, 43 Bo,94-96

Index. p, lip, 78 8 function, 107 v, 7-8 w, 7-8 i,7-8 sine, 43 Bo,94-96 p, lip, 78 8 function, 107 v, 7-8 w, 7-8 i,7-8 sine, 43 Bo,94-96 B 1,94-96 M,94-96 B oro!' 94-96 BIro!' 94-96 I/r, 79 2D linear system, 56 2D FFT, 119 2D Fourier transform, 1, 12, 18,91 2D sinc, 107, 112

More information

ECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam.

ECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam. ECE 35 Spring - Final Exam 9 May ECE 35 Signals and Systems Spring Final Exam - Solutions Three 8 ½ x sheets of notes, and a calculator are allowed during the exam Write all answers neatly and show your

More information

Finite difference modelling, Fourier analysis, and stability

Finite difference modelling, Fourier analysis, and stability Finite difference modelling, Fourier analysis, and stability Peter M. Manning and Gary F. Margrave ABSTRACT This paper uses Fourier analysis to present conclusions about stability and dispersion in finite

More information

Digital Baseband Systems. Reference: Digital Communications John G. Proakis

Digital Baseband Systems. Reference: Digital Communications John G. Proakis Digital Baseband Systems Reference: Digital Communications John G. Proais Baseband Pulse Transmission Baseband digital signals - signals whose spectrum extend down to or near zero frequency. Model of the

More information

9.4 Enhancing the SNR of Digitized Signals

9.4 Enhancing the SNR of Digitized Signals 9.4 Enhancing the SNR of Digitized Signals stepping and averaging compared to ensemble averaging creating and using Fourier transform digital filters removal of Johnson noise and signal distortion using

More information

Computer Vision Lecture 3

Computer Vision Lecture 3 Computer Vision Lecture 3 Linear Filters 03.11.2015 Bastian Leibe RWTH Aachen http://www.vision.rwth-aachen.de leibe@vision.rwth-aachen.de Demo Haribo Classification Code available on the class website...

More information

ESE 531: Digital Signal Processing

ESE 531: Digital Signal Processing ESE 531: Digital Signal Processing Lec 8: February 12th, 2019 Sampling and Reconstruction Lecture Outline! Review " Ideal sampling " Frequency response of sampled signal " Reconstruction " Anti-aliasing

More information

RF Pulse Design. Multi-dimensional Excitation I. M229 Advanced Topics in MRI Kyung Sung, Ph.D Class Business

RF Pulse Design. Multi-dimensional Excitation I. M229 Advanced Topics in MRI Kyung Sung, Ph.D Class Business RF Pulse Design Multi-dimensional Excitation I M229 Advanced Topics in MRI Kyung Sung, Ph.D. 2018.04.10 Class Business Office hours - Instructors: Fri 10-12pm TAs: Xinran Zhong and Zhaohuan Zhang (time:

More information

ECE 425. Image Science and Engineering

ECE 425. Image Science and Engineering ECE 425 Image Science and Engineering Spring Semester 2000 Course Notes Robert A. Schowengerdt schowengerdt@ece.arizona.edu (520) 62-2706 (voice), (520) 62-8076 (fa) ECE402 DEFINITIONS 2 Image science

More information

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n. ECE 3 Fall Division Homework Solutions Problem. Reconstruction of a continuous-time signal from its samples. Consider the following periodic signal, depicted below: {, if n t < n +, for any integer n,

More information

6.034f Neural Net Notes October 28, 2010

6.034f Neural Net Notes October 28, 2010 6.034f Neural Net Notes October 28, 2010 These notes are a supplement to material presented in lecture. I lay out the mathematics more prettily and etend the analysis to handle multiple-neurons per layer.

More information

Fourier Transform in Image Processing. CS/BIOEN 6640 U of Utah Guido Gerig (slides modified from Marcel Prastawa 2012)

Fourier Transform in Image Processing. CS/BIOEN 6640 U of Utah Guido Gerig (slides modified from Marcel Prastawa 2012) Fourier Transform in Image Processing CS/BIOEN 6640 U of Utah Guido Gerig (slides modified from Marcel Prastawa 2012) Basis Decomposition Write a function as a weighted sum of basis functions f ( x) wibi(

More information

Lecture 6 January 21, 2016

Lecture 6 January 21, 2016 MATH 6/CME 37: Applied Fourier Analysis and Winter 06 Elements of Modern Signal Processing Lecture 6 January, 06 Prof. Emmanuel Candes Scribe: Carlos A. Sing-Long, Edited by E. Bates Outline Agenda: Fourier

More information

CS 4495 Computer Vision. Frequency and Fourier Transforms. Aaron Bobick School of Interactive Computing. Frequency and Fourier Transform

CS 4495 Computer Vision. Frequency and Fourier Transforms. Aaron Bobick School of Interactive Computing. Frequency and Fourier Transform CS 4495 Computer Vision Frequency and Fourier Transforms Aaron Bobick School of Interactive Computing Administrivia Project 1 is (still) on line get started now! Readings for this week: FP Chapter 4 (which

More information

X. Chen More on Sampling

X. Chen More on Sampling X. Chen More on Sampling 9 More on Sampling 9.1 Notations denotes the sampling time in second. Ω s = 2π/ and Ω s /2 are, respectively, the sampling frequency and Nyquist frequency in rad/sec. Ω and ω denote,

More information

Computed Tomography Notes, Part 1. The equation that governs the image intensity in projection imaging is:

Computed Tomography Notes, Part 1. The equation that governs the image intensity in projection imaging is: Noll 6 CT Notes : Page Compute Tomograph Notes Part Challenges with Projection X-ra Sstems The equation that governs the image intensit in projection imaging is: z I I ep μ z Projection -ra sstems are

More information

Review: Basic MC Estimator

Review: Basic MC Estimator Overview Earlier lectures Monte Carlo I: Integration Signal processing and sampling Today: Monte Carlo II Noise and variance Efficiency Stratified sampling Importance sampling Review: Basic MC Estimator

More information

3 rd class Mech. Eng. Dept. hamdiahmed.weebly.com Fourier Series

3 rd class Mech. Eng. Dept. hamdiahmed.weebly.com Fourier Series Definition 1 Fourier Series A function f is said to be piecewise continuous on [a, b] if there exists finitely many points a = x 1 < x 2

More information

Fourier Analysis and Imaging Ronald Bracewell L.M. Terman Professor of Electrical Engineering Emeritus Stanford University Stanford, California

Fourier Analysis and Imaging Ronald Bracewell L.M. Terman Professor of Electrical Engineering Emeritus Stanford University Stanford, California Fourier Analysis and Imaging Ronald Bracewell L.M. Terman Professor of Electrical Engineering Emeritus Stanford University Stanford, California 4u Springer Contents fa 1 PREFACE INTRODUCTION xiii 1 11

More information

Tutorial Sheet #2 discrete vs. continuous functions, periodicity, sampling

Tutorial Sheet #2 discrete vs. continuous functions, periodicity, sampling 2.39 utorial Sheet #2 discrete vs. continuous functions, periodicity, sampling We will encounter two classes of signals in this class, continuous-signals and discrete-signals. he distinct mathematical

More information

Additional Pointers. Introduction to Computer Vision. Convolution. Area operations: Linear filtering

Additional Pointers. Introduction to Computer Vision. Convolution. Area operations: Linear filtering Additional Pointers Introduction to Computer Vision CS / ECE 181B andout #4 : Available this afternoon Midterm: May 6, 2004 W #2 due tomorrow Ack: Prof. Matthew Turk for the lecture slides. See my ECE

More information

Discrete Fourier Transform

Discrete Fourier Transform Last lecture I introduced the idea that any function defined on x 0,..., N 1 could be written a sum of sines and cosines. There are two different reasons why this is useful. The first is a general one,

More information

1D Convolution. Convolution g[m] = g[0]δ[m] + g[1]δ[m 1] + g[2]δ[m 2] h[m',k] = L[δ[m k]] = h[ m $ k]

1D Convolution. Convolution g[m] = g[0]δ[m] + g[1]δ[m 1] + g[2]δ[m 2] h[m',k] = L[δ[m k]] = h[ m $ k] cm 5 cm Bioengineering 28A Principles of Biomeical Imaging Assume =/2 Fall Quarter 24 X-Rays Lecture 2 cm 5 cm cm cm Assume =/2 Assume =/2 Convolution g[m] = g[]δ[m] + g[]δ[m ] + g[2]δ[m 2] h[m,k] = L[δ[m

More information

Review of Analog Signal Analysis

Review of Analog Signal Analysis Review of Analog Signal Analysis Chapter Intended Learning Outcomes: (i) Review of Fourier series which is used to analyze continuous-time periodic signals (ii) Review of Fourier transform which is used

More information

Bridge between continuous time and discrete time signals

Bridge between continuous time and discrete time signals 6 Sampling Bridge between continuous time and discrete time signals Sampling theorem complete representation of a continuous time signal by its samples Samplingandreconstruction implementcontinuous timesystems

More information

Topics. Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2004 Lecture 4 2D Fourier Transforms

Topics. Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2004 Lecture 4 2D Fourier Transforms Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2004 Lecture 4 2D Fourier Transforms Topics 1. 2D Signal Representations 2. 2D Fourier Transform 3. Transform Pairs 4. FT Properties 1

More information

VID3: Sampling and Quantization

VID3: Sampling and Quantization Video Transmission VID3: Sampling and Quantization By Prof. Gregory D. Durgin copyright 2009 all rights reserved Claude E. Shannon (1916-2001) Mathematician and Electrical Engineer Worked for Bell Labs

More information

Sound & Vibration Magazine March, Fundamentals of the Discrete Fourier Transform

Sound & Vibration Magazine March, Fundamentals of the Discrete Fourier Transform Fundamentals of the Discrete Fourier Transform Mark H. Richardson Hewlett Packard Corporation Santa Clara, California The Fourier transform is a mathematical procedure that was discovered by a French mathematician

More information

Today s lecture. The Fourier transform. Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm

Today s lecture. The Fourier transform. Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm Today s lecture The Fourier transform What is it? What is it useful for? What are its properties? Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm Jean Baptiste Joseph Fourier

More information

Fourier Transform 4: z-transform (part 2) & Introduction to 2D Fourier Analysis

Fourier Transform 4: z-transform (part 2) & Introduction to 2D Fourier Analysis 052600 VU Signal and Image Processing Fourier Transform 4: z-transform (part 2) & Introduction to 2D Fourier Analysis Torsten Möller + Hrvoje Bogunović + Raphael Sahann torsten.moeller@univie.ac.at hrvoje.bogunovic@meduniwien.ac.at

More information

Edge Detection. Image Processing - Computer Vision

Edge Detection. Image Processing - Computer Vision Image Processing - Lesson 10 Edge Detection Image Processing - Computer Vision Low Level Edge detection masks Gradient Detectors Compass Detectors Second Derivative - Laplace detectors Edge Linking Image

More information

Summary of Lecture 5

Summary of Lecture 5 Summary of Lecture 5 In lecture 5 we learnt how to pick the reproduction levels for the given thresholds. We learnt how to design MSQE optimal (Lloyd-Max) quantizers. We reviewed linear systems, linear

More information

Computer Vision & Digital Image Processing

Computer Vision & Digital Image Processing Computer Vision & Digital Image Processing Image Segmentation Dr. D. J. Jackson Lecture 6- Image segmentation Segmentation divides an image into its constituent parts or objects Level of subdivision depends

More information

ECS 332: Principles of Communications 2012/1. HW 4 Due: Sep 7

ECS 332: Principles of Communications 2012/1. HW 4 Due: Sep 7 ECS 332: Principles of Communications 2012/1 HW 4 Due: Sep 7 Lecturer: Prapun Suksompong, Ph.D. Instructions (a) ONE part of a question will be graded (5 pt). Of course, you do not know which part will

More information

Lecture # 06. Image Processing in Frequency Domain

Lecture # 06. Image Processing in Frequency Domain Digital Image Processing CP-7008 Lecture # 06 Image Processing in Frequency Domain Fall 2011 Outline Fourier Transform Relationship with Image Processing CP-7008: Digital Image Processing Lecture # 6 2

More information

1-D MATH REVIEW CONTINUOUS 1-D FUNCTIONS. Kronecker delta function and its relatives. x 0 = 0

1-D MATH REVIEW CONTINUOUS 1-D FUNCTIONS. Kronecker delta function and its relatives. x 0 = 0 -D MATH REVIEW CONTINUOUS -D FUNCTIONS Kronecker delta function and its relatives delta function δ ( 0 ) 0 = 0 NOTE: The delta function s amplitude is infinite and its area is. The amplitude is shown as

More information

Super-Resolution. Dr. Yossi Rubner. Many slides from Miki Elad - Technion

Super-Resolution. Dr. Yossi Rubner. Many slides from Miki Elad - Technion Super-Resolution Dr. Yossi Rubner yossi@rubner.co.il Many slides from Mii Elad - Technion 5/5/2007 53 images, ratio :4 Example - Video 40 images ratio :4 Example Surveillance Example Enhance Mosaics Super-Resolution

More information

Key Intuition: invertibility

Key Intuition: invertibility Introduction to Fourier Analysis CS 510 Lecture #6 January 30, 2017 In the extreme, a square wave Graphic from http://www.mechatronics.colostate.edu/figures/4-4.jpg 2 Fourier Transform Formally, the Fourier

More information