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,

Slides:



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

November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Chapter 3 Image Enhancement in the Spatial Domain.
Diffraction Basics Cora Lind-Kovacs Department of Chemistry & Biochemistry The University of Toledo Toledo, OH 43606
Fourier Transform (Chapter 4)
Fourier Transform A Fourier Transform is an integral transform that re-expresses a function in terms of different sine waves of varying amplitudes, wavelengths,
Fourier Transform – Chapter 13. Image space Cameras (regardless of wave lengths) create images in the spatial domain Pixels represent features (intensity,
Fourier Transform – Chapter 13. Fourier Transform – continuous function Apply the Fourier Series to complex- valued functions using Euler’s notation to.
CS 551 / CS 645 Antialiasing. What is a pixel? A pixel is not… –A box –A disk –A teeny tiny little light A pixel is a point –It has no dimension –It occupies.
A Brief Description of the Crystallographic Experiment
Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain.
lecture 5, Sampling and the Nyquist Condition Sampling Outline  FT of comb function  Sampling Nyquist Condition  sinc interpolation Truncation.
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.
Image Enhancement in the Frequency Domain Part I Image Enhancement in the Frequency Domain Part I Dr. Samir H. Abdul-Jauwad Electrical Engineering Department.
Some Properties of the 2-D Fourier Transform Translation Distributivity and Scaling Rotation Periodicity and Conjugate Symmetry Separability Convolution.
1 Computer Science 631 Lecture 4: Wavelets Ramin Zabih Computer Science Department CORNELL UNIVERSITY.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
The Effects of Symmetry in Real and Reciprocal Space Sven Hovmöller, Stockholm Univertsity Mirror symmetry 4-fold symmetry.
3: Interference, Diffraction and Polarization
Lecture 12 Convolutions and summary of course Remember Phils Problems and your notes = everything Today Convolutions.
Miller Indices And X-ray diffraction
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm.
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.
Diffraction from point scatterers Wave: cos(kx +  t)Wave: cos(kx +  t) + cos(kx’ +  t) max min.
Protein Structure Determination Part 2 -- X-ray Crystallography.
Lesson 5 Conditioning the x-ray beam
Image Processing Fourier Transform 1D Efficient Data Representation Discrete Fourier Transform - 1D Continuous Fourier Transform - 1D Examples.
Introduction to Patterson Function and its Applications
1 Chapter 5 Image Transforms. 2 Image Processing for Pattern Recognition Feature Extraction Acquisition Preprocessing Classification Post Processing Scaling.
Filtering Robert Lin April 29, Outline Why filter? Filtering for Graphics Sampling and Reconstruction Convolution The Fourier Transform Overview.
X-Ray Diffraction Dr. T. Ramlochan March 2010.
Single-crystal X-ray Crystallography ● The most common experimental means of obtaining a detailed picture of a large molecule like a protein. ● Allows.
Chem Patterson Methods In 1935, Patterson showed that the unknown phase information in the equation for electron density:  (xyz) = 1/V ∑ h ∑ k.
09/19/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Dithering.
Fundamentals of Electric Circuits Chapter 18 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chem Structure Factors Until now, we have only typically considered reflections arising from planes in a hypothetical lattice containing one atom.
1. Diffraction intensity 2. Patterson map Lecture
Lecture 11 (end of) Fourier Transforms Remember Phils Problems and your notes = everything Today Finish Fourier.
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.
Methods in Chemistry III – Part 1 Modul M.Che.1101 WS 2010/11 – 8 Modern Methods of Inorganic Chemistry Mi 10:15-12:00, Hörsaal II George Sheldrick
X-ray diffraction X-rays discovered in 1895 – 1 week later first image of hand. X-rays have ~ 0.1 – few A No lenses yet developed for x-rays – so no possibility.
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.
Protein Structure Determination Lecture 4 -- Bragg’s Law and the Fourier Transform.
Solving crystals structures from HREM by crystallographic image processing Xiaodong Zou Structural Chemistry, Stockholm University.
Pattersons The “third space” of crystallography. The “phase problem”
2D Sampling Goal: Represent a 2D function by a finite set of points.
Atomic structure model
Fourier Transform.
Modulation Transfer Function (MTF)
Calculation of Structure Factors
Electromagnetism Around 1800 classical physics knew: - 1/r 2 Force law of attraction between positive & negative charges. - v ×B Force law for a moving.
Before Beginning – Must copy over the p4p file – Enter../xl.p4p. – Enter../xl.hkl. – Do ls to see the files are there – Since the.p4p file has been created.
X-Ray Diffraction Spring 2011.
Fourier transform from r to k: Ã(k) =  A(r) e  i k r d 3 r Inverse FT from k to r: A(k) = (2  )  3  Ã(k) e +i k r d 3 k X-rays scatter off the charge.
Frequency domain analysis and Fourier Transform
Crystallography : How do you do? From Diffraction to structure…. Normally one would use a microscope to view very small objects. If we use a light microscope.
Crystal Structure and Crystallography of Materials Chapter 13: Diffraction Lecture No. 1.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
1. Detector 2. Crystal diffraction conditions
FOURIER THEORY: KEY CONCEPTS IN 2D & 3D
Seminar on X-ray Diffraction
Protein Structure Determination
Fourier Transform.
2D Fourier transform is separable
CSCE 643 Computer Vision: Thinking in Frequency
4. Image Enhancement in Frequency Domain
Fourier transforms and
Fourier Optics P47 – Optics: Unit 8.
Presentation transcript:

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, they are not everywhere. Is this simply a bad image?

Photographic image superposition (averaging) by Roy Markham. The image is shifted and added to the original.

Superimposed images using Adobe Photoshop. I used Markham’s lattice to determine how much to shift by.

How would I figure out the distance and direction to shift if there weren’t a guide? 1. I could guess and pick the answer (image) that I liked best. 2. I could try all possible shifts and pick out the image with the strongest features (measured objectively rather than subjectively). The Fourier transform carries out the essence of method 2.

EM of catalase Optical diffraction pattern weak and strong exposure. (Erikson and Klug, 1971)

Bacterial rhodopsin in glucoseFourier transform of image.

What you see. What you get SpotsExcited

What you see. What you get SpotsExcited Spot positionsUnit cell size and shape

What you see. What you get SpotsExcited Spot positionsUnit cell size and shape Spot sizeSize of coherent domains

What you see. What you get SpotsExcited Spot positionsUnit cell size and shape Spot sizeSize of coherent domains Intensity relative to backgroundSignal/noise ratio

What you see. What you get SpotsExcited Spot positionsUnit cell size and shape Spot sizeSize of coherent domains Intensity relative to backgroundSignal/noise ratio Distance to farthest spotResolution

What you see. What you get SpotsExcited Spot positionsUnit cell size and shape Spot sizeSize of coherent domains Intensity relative to backgroundSignal/noise ratio Distance to farthest spotResolution Amplitude and phases of spotsStructure of molecules

What you see. What you get SpotsExcited Spot positionsUnit cell size and shape Spot sizeSize of coherent domains Intensity relative to backgroundSignal/noise ratio Distance to farthest spotResolution Amplitude and phases of spotsStructure of molecules Positions of Thon ringsAmount of defocus

What you see. What you get SpotsExcited Spot positionsUnit cell size and shape Spot sizeSize of coherent domains Intensity relative to backgroundSignal/noise ratio Distance to farthest spotResolution Amplitude and phases of spotsStructure of molecules Positions of Thon ringsAmount of defocus Ellipticity of Thon ringsAmount of astigmatism

What you see. What you get SpotsExcited Spot positionsUnit cell size and shape Spot sizeSize of coherent domains Intensity relative to backgroundSignal/noise ratio Distance to farthest spotResolution Amplitude and phases of spotsStructure of molecules Positions of Thon ringsAmount of defocus Ellipticity of Thon ringsAmount of astigmatism Asymmetric intensity of Thon ringsAmount of instability

What you see. What you get SpotsExcited Spot positionsUnit cell size and shape Spot sizeSize of coherent domains Intensity relative to backgroundSignal/noise ratio Distance to farthest spotResolution Amplitude and phases of spotsStructure of molecules Positions of Thon ringsAmount of defocus Ellipticity of Thon ringsAmount of astigmatism Asymmetric intensity of Thon ringsAmount of instability Direction of asymmetryDirection of instability

What you see. What you get SpotsExcited Spot positionsUnit cell size and shape Spot sizeSize of coherent domains Intensity relative to backgroundSignal/noise ratio Distance to farthest spotResolution Amplitude and phases of spotsStructure of molecules Positions of Thon ringsAmount of defocus Ellipticity of Thon ringsAmount of astigmatism Asymmetric intensity of Thon ringsAmount of instability Direction of asymmetryDirection of instability

F(X)={sin(  aX)/(  X) -a/2a/2 1/a The Fourier transform of a box. f(x)=1 if –a/2<x<a/2 f(x)=0 otherwise X 

Fourier transform of a constant. f(x)=1 F(X)=  (X) 0X x

x=a Fourier transform of a cosine wave. f(x)=cos(2  x/a) -1/a +1/a F(X)=0.5[  (X+1/a)+  (X-1/a)] | XX

Fourier transform of a Gaussian. f(x)=exp(-  x 2 /a 2 ) F(X)=a exp(-  X 2 a 2 ) a 1/a XX xx

-a a0 -2a-3a2a3a The Fourier transform of a lattice. f(x)=…  (x+a)+  (x)+  (x-a)… -1/a 1/a0 -2/a-3/a2/a3/a F(X)=…  (X+1/a)+  (X)+  (X-1/a)… xx XX

In 2D the transform of a row of periodically placed points is a set of lines. This set of lines is perpendicular to the line joining the points. d f(x) 1/d F(X)

In 3D, the transform of a row of points is a set of planes. The planes are perpendicular to the line joining the points. d f(x) 1/d F(X)

In 3D, the transform of a plane of evenly spaced lines is a plane of evenly placed lines. These lines in real space are perpendicular to the plane containing the lines in reciprocal space (and vice versa). d f(x) 1/d F(X)

If F(X)=FT[f(x)], then f(x)=IFT[F(X)] where FT=Fourier transform & IFT=Inverse Fourier transform. USE: If you can obtain the Fourier transform, F(X), of an object, you can regenerate the object itself. This is the basis of x-ray crystallography and some 3D reconstruction algorithms. 1. Inverse Fourier transform:

FT[ af(x) ] = aF(X) 2. Multiplication by a constant: Special case: FT[ -f(x) ] = -F(X) = F(X)e i  USE: If you multiply the density by a constant, you multiply its Fourier transform by the same constant. If you reverse the contrast of an object, you get the same transform except the phases are changed by 180º (Babinet’s principle). Thus the phases obtained from images of negatively stained objects will differ by 180º from those of an ice-embedded object.

3. The addition of two density distributions (objects): FT[ f(x) + g(x)] = F(X) + G(X) USE: The Fourier transform of a heavy atom derivative is equal to the Fourier transform of the protein plus the Fourier transform of the constellation of heavy atoms. This allows one to use heavy atoms to determine the Fourier transform of the protein if the transform of the heavy atom constellation can be deduced.

4. The Fourier transform of a stretched object: FT[ f(ax) ] = F(x/a) USE: If you stretch/magnify an object by a factor of a, you squeeze/demagnify its transform by factor of a.

5. Rotation of an object: FT[ f{ xcos(a) + ysin(a), -x sin(a) + y cos(a)}] = F { Xcos(a) + Ysin(a), -X sin(a) + Y cos(a)} USE: If you rotate an object by an angle a, you rotate its transform by the same angle.

6. Fourier transform of a shifted object: FT[ f(x-a) ] = F(X)e i  aX USE: If you shift an object by +a, you leave the amplitudes of its transform unchanged but its phases are increased by  aX radians = 180ºaX degrees. The electron diffraction pattern is not sensitive to movement of the specimen since the intensities do not depend on phases. Vibration of the specimen does not affect the electron diffraction patterns as it does the images.

7. The section/projection theorem: FT[  f(x,y,z)dx ] = F(0,Y,Z) USE: The Fourier transform of a projection of a 3D object is equal to a central section of the 3D Fourier transform of the object. An electron micrograph is a projection of a 3D object. Its transform provides one slice of the 3D transform of the 3D object. By combining the transforms of different views, one builds up the 3D transform section by section. One then uses the IFT to convert the 3D transform into a 3D image.

8. The Fourier transform of the product of two distributions: FT[ f(x)g(x) ] = F(X) * G(X) where * denotes convolution USE: This is useful in thinking about the effects of boxing or masking off a particle from the background or in sampling a distribution (multiplying by a lattice). We will look at some of its uses later on.

9. The transform of a real distribution: If the complex part of f(x) is zero, then F(-X) = F * (X) where * indicates the complex conjugate. USE: Thus, centrosymmetrically related reflections have the same amplitude but opposite phases (Friedel’s law). When calculating a transform of an image, one only has to calculate half of it. The other half is related by Friedel’s law.

10. Whatever applies to the FT also applies to the IFT. USE: If the Fourier transform of a cosine wave is a pair of delta functions, then the inverse Fourier transform of a cosine wave is also a pair of delta functions.

Convolution of a molecule with a lattice generates a crystal. Molecule = f(x) lattice = l(x) Set a molecule down at every lattice point. f(x)*l(x)

What is the Fourier transform of a crystal? A crystal is the convolution of a molecule, f, with a lattice, l. L(X) is a lattice, the reciprocal lattice. Thus what one sees in the transform of a crystal is the transform of the molecule, but you can only see it at reciprocal lattice points. FT[ f(x)*l(x) ] = F(X)L(X) To get the transform, multiply the transform, F, of the molecule times the transform, L, of the lattice.

What is the Fourier transform of a sampled (digitized) image? A sampled image is the product of a molecule, f, with a lattice, l. L(X) is a lattice, the reciprocal lattice. Thus what one sees is the transform of the molecule repeated at every reciprocal lattice point. FT[ f(x)l(x) ] = F(X)*L(X) To get the transform, convolute the transform, F, of the molecule with the transform, L, of the sampling lattice.

unsampled image transform finely sampled imageconvoluted transform Nyquist frequency

Since the transform extends infinitely in all direction, the convolution causes overlap of one transform with its neighbors. This is called aliasing. The problem can be appreciated if we more coarsely sample the molecule in the previous example.

finely sampled imageconvoluted transform coarsely sampled image badly aliased example

Tricks to control aliasing: 1. In digitizing, use an aperture that is equal to the step size. 2. Remove any large steps in image density by a. removing any gradient of density across the image, b. floating the image, c. and apodizing the edge of the image

collimating lens diffraction lens image Fourier transform pinhole focusing lens Optical diffractometer d d* = f d = spacing on the image d* = spacing in the Fourier transform f = focal length of the diffraction lens = wavelength of light One gets the intensities (amplitudes) only. To get the phases, one needs to compute the FT.

Fourier transforms have both real and imaginary parts. The real part: F R (X=1/a) =  f(x)cos(360x/a) The imaginary part: F I (X=1/a) =  f(x)sin(360x/a)

One can turn the real and imaginary parts into amplitudes and phases. Amplitude: |F(X=1/a)| = (F R *F R + F I *F I ) 1/2 Phase:  (X=1/a) = tan -1 (F I /F R )

The discrete Fourier transform: what the computer does. An image f(x) is sampled at a lattice of points spaced every  x giving us f(j  x ). The image contains N pixels. The transform is calculated at steps of 1/(N  x): F R [X=k/(N  x)] =  f(j  x)cos(360jk/N) F I [X=k/(N  x)] =  f(j  x)sin(360jk/N) where 0  j  N-1 and 0  k  N-1

The inverse of the discrete Fourier transform: f(x=j  x) = (1/N)  {F R [k/(N  x)]cos(360jk/N) + F I [k/(N  x)]sin(360jk/N)} where 0  j  N-1 and 0  k  N-1 Since f(x) can be exactly regenerated, no information is lost when determining F(X).

Sample calculation: j0123 f(j  x) 1210 k0123 = -1 F R (k/N  x) 4000 F I (k/N  x) k0123 = -1 amplitude4202 phase Friedel’s law

What happens if we more finely sample the image? Image f(x) is sampled at  x/2 instead of  x; it contains 2N instead of N pixels. The transform is sampled at 1/(2N  x/2) = 1/(N  x); i.e. unchanged. However, since there are 2N instead of N steps, the resolution is twice as good.

What happens if we keep the same sampling step in the image but double the number of points (called padding)? If the image f(x) is still sampled at  x, but now contains 2N instead of N pixels, the transform is calculated at steps of 1/(2N  x) which is two times finer than before. However, since there are twice as many steps but each step is half the size, the resolution is unchanged. This trick of more finely sampling is useful when you want to interpolate data in the Fourier transform.