Diffraction from point scatterers Wave: cos(kx +  t)Wave: cos(kx +  t) + cos(kx’ +  t) max min.

Slides:



Advertisements
Similar presentations
Review of 1-D Fourier Theory:
Advertisements

Diffraction Basics Cora Lind-Kovacs Department of Chemistry & Biochemistry The University of Toledo Toledo, OH 43606
Engineering Mathematics Class #15 Fourier Series, Integrals, and Transforms (Part 3) Sheng-Fang Huang.
Fourier Transform – Chapter 13. Image space Cameras (regardless of wave lengths) create images in the spatial domain Pixels represent features (intensity,
Environmental Data Analysis with MatLab Lecture 9: Fourier Series.
(0,0) RECIPROCAL LATTICE (0,1) (1,1) (2,1) (3,1) REAL LATTICE a b a* b*
Fourier Transform – Chapter 13. Fourier Transform – continuous function Apply the Fourier Series to complex- valued functions using Euler’s notation to.
Digital Image Processing
Computer Graphics Recitation 6. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi Some slides.
Fourier Transform and its applications.
Computer Graphics Recitation 7. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
Sampling (Section 4.3) CS474/674 – Prof. Bebis. Sampling How many samples should we obtain to minimize information loss during sampling? Hint: take enough.
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.
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.
Advanced Computer Graphics (Spring 2006) COMS 4162, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi
Image Enhancement in the Frequency Domain Part I Image Enhancement in the Frequency Domain Part I Dr. Samir H. Abdul-Jauwad Electrical Engineering Department.
CPSC 641 Computer Graphics: Fourier Transform Jinxiang Chai.
Advanced Computer Graphics (Spring 2005) COMS 4162, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi
Continuous Time Signals All signals in nature are in continuous time.
PA214 Waves and Fields Fourier Methods Blue book New chapter 12 Fourier sine series Application to the wave equation Fourier cosine series Fourier full.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
The Frequency Domain Sinusoidal tidal waves Copy of Katsushika Hokusai The Great Wave off Kanagawa at
Sampling and Antialiasing CMSC 491/635. Abstract Vector Spaces Addition –C = A + B = B + A –(A + B) + C = A + (B + C) –given A, B, A + X = B for only.
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 3 Ravi Ramamoorthi
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Fourier Transform Basic idea.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Integral Transform Dongsup Kim Department of Biosystems, KAIST Fall, 2004.
A helical tube of virus head protein. The protein subunits can be seen clearly in some places but not others. Although we see some regularities,
Protein Structure Determination Part 2 -- X-ray Crystallography.
Image Processing Fourier Transform 1D Efficient Data Representation Discrete Fourier Transform - 1D Continuous Fourier Transform - 1D Examples.
Feb 11, 2011 The transformed trigonometric functions.
Introduction to Patterson Function and its Applications
Diffraction: Real Sample (From Chapter 5 of Textbook 2, Chapter 9 of reference 1,) Different sizes, strains, amorphous, ordering  Diffraction peaks.
1 Waves 8 Lecture 8 Fourier Analysis. D Aims: ëFourier Theory: > Description of waveforms in terms of a superposition of harmonic waves. > Fourier series.
Chapter 4: Image Enhancement in the Frequency Domain Chapter 4: Image Enhancement in the Frequency Domain.
09/19/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Dithering.
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.
October 29, 2013Computer Vision Lecture 13: Fourier Transform II 1 The Fourier Transform In the previous lecture, we discussed the Hough transform. There.
Image Processing Basics. What are images? An image is a 2-d rectilinear array of pixels.
Astronomical Data Analysis I
Page 1 X-ray crystallography: "molecular photography" Object Irradiate Scattering lens Combination Image Need wavelengths smaller than or on the order.
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.
02/05/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Mach Banding –Humans exaggerate sharp boundaries, but not fuzzy ones.
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
Fourier Transform.
 Introduction to reciprocal space
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Basic idea Input Image, I(x,y) (spatial domain) Mathematical Transformation.
Frequency space, fourier transforms, and image analysis
The Frequency Domain Digital Image Processing – Chapter 8.
The Fourier Transform.
Fourier series. Examples Fourier Transform The Fourier transform is a generalization of the complex Fourier series in the limit complexFourier series.
Sampling (Section 4.3) CS474/674 – Prof. Bebis.
Advanced Computer Graphics
Linear Filters and Edges Chapters 7 and 8
FOURIER THEORY: KEY CONCEPTS IN 2D & 3D
Integral Transform Method
Linear Filters and Edges Chapters 7 and 8
Image Enhancement in the
Dr. Nikos Desypris, Oct Lecture 3
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
CSCE 643 Computer Vision: Image Sampling and Filtering
Digital Image Processing
8.6 Autocorrelation instrument, mathematical definition, and properties autocorrelation and Fourier transforms cosine and sine waves sum of cosines Johnson.
Discrete Fourier Transform
Presentation transcript:

Diffraction from point scatterers Wave: cos(kx +  t)Wave: cos(kx +  t) + cos(kx’ +  t) max min

Diffraction from 2 points At finite distance: Fresnel diffraction At  : Frauenhofer diffraction

Frauenhofer diffraction  Bragg’s Law d dsin(  ) – difference in path for lower ray A 1 cos(2  x/  ) + A 2 cos(2  x/  +  2 )  2 = 2  dsin(  )/ If dsin(  ) = n, get max because two cosine terms are in phase A 1 cos(2  x/  ) A 2 cos(2  x/  +  2 )

Frauenhofer diffraction: sum of sin terms Sum of 2 point scatterers:A 1 cos(2  x/  ) + A 2 cos(2  x/  +  2 ) Sum of n point scatterers (cosine transform): Any periodic function can be broken down into sum of sines and cosines with same fundamental period Fourier transform: sum of sin terms

Fourier transforms x -a 0 a f(x) Discrete transform ok for periodic objects Continuous transform for non-periodic objects

Box function and its transform b(x) = 1 - l <= l b(x) = 0 x l - l 0 l x

Sync function (transform of box) x x

Lattice function (and transform) s Delta fcn:  (x) = , when x=0 (normalized area =1)  [s(x)] = S(x) 1/s X x

Convolution Convolution: x -a 0 a c(x) a x f1f1 f2f2

Cross-Correlation Correlation of f 1 &f 2 : x -a 0 a c(x) x f1f1 f2f2 x C(f 1 f 2 ) f 1 (x) * = f 1 (x) when real fcn

Auto-correlation  Patterson fcn Patterson function: auto-correlation Inverse transform of Product of F 1 * F 2

Convolution Theorem - l 0 l x -1/2 l 1/2 l 2/2 l -2/2 l -4/2 l  a x  1/a X

F 1 ·F 2 x l 1/a - 4/a -3/a -2/a -1/a 0 1/a 2/a 3/a 4/a 1D crystal

Truncating the crystal (finite size) -3a -2a -1a 0 1a 2a 3a x b(x) = 1, when -3 > x < 3 -3a -2a -1a 0 1a 2a 3a  - 4/a -3/a -2/a -1/a 0 1/a 2/a 3/a 4/a

Boxing an crystal image instead of sharp reflections, get sync functions with width inversely related to box size

Image (em grid) diffraction

Smaller area (same mag) Black = zero density

Floating an image (to avoid sharp edges) b(x) f(x) b(x)·f(x) Floating: subtracts background High contrast edges diffract strongly

Boxed area - floated

Image sampling (for digital FT) Shannon-Nyquist sampling limit: Finest spatial period must be sampled >2x Otherwise  aliasing (jaggies) Must see peaks and valleys of a feature 2d d

Fast Fourier Transform N x N image Real numbers N/2 x N transform (complex numbers) orig 0,0N/2,0 0,N/2 0,-N/2 Spatial frequency corresponding To 2 pixels in orig image Reciprocal pixels In transform 1/size-of-image-pixels

Image (em grid) diffraction

Say 5 Å pixel size in image and 40 x 40 pixels in image 0,0 0,20 0,-20 20,0 40 pixels in recip space  5 A resolution 20 pixels in recip space  10 A resolution (this is max in transform, consistent with Shannon-Nyquist sampling limit 1 pixel in recip space  40x5=200 A resol (i.e., frame size of image – max spatial freq) 10 A 200 A 0,0 0,10 0,-10 10,0 20 A200 A 2x reduced sampling: {

Lower sampling interval (2x)

Aliasing 0,0 0,20 0, A 200 A 0,0 0,20 0, A 200 A  Central transform sideband

aliasing

Aliasing cont 0 1/d

Lower sampling rate

aliasing