Fourier Optics and Image Analysis
|
|
- Vivian Matthews
- 6 years ago
- Views:
Transcription
1 Laboratory instruction to Fourier Optics and Imae Analysis Sven-Göran Pettersson and Anders Persson updated by Maïté Louisy and Henrik Ekerfelt This laboratory exercise demonstrates some important applications of Fourier optic. It shows how Fourier transformations can be made with optics and how diffractin objects can be modified/analyzed usin appropriate masks in the Fourier plane. Preparation: See problems in the end (all must be solved before the laboratory work). If you fail to show at least an attempt to solve all problems, you will not be allowed to participate in the laboratory exercise. Theory: See the textbook Chapter 4 on Fourier optics expecially 4.2B, 4.3A and 4.4. Also review the properties of the Fourier transform in Appendix A. Set-up for the laboratory work: The principle of the optical set-up used is shown in fiure 1: Spatial filter L1 L2 Object plane FTplane L3 L4 S Imae plane to L3 Fiure 1. The optical processor used for imae processin Screen A HeNe-laser, spatially filtered by a microscope objective and a pinhole, illuminates the object coherently. The wavelenth of the laser liht is 633 nm. A mirror can be placed between the lenses L1 and L2 so that white liht can be entered into the optical system. The lenses L1 and L2 ive toether a ood point imae of the pinhole in the Fourier plane. When an object is placed at the object plane, a two-dimensional Fourier transformation is achieved at the FT-plane. This means that the transmission function is transferred into a combination of spatial frequencies. With the lens L3, an enlared imae of the Fourier plane is projected onto the screen. The lens L4 ives an enlared imae of the object instead. This lens can easily be moved in place or removed from the optical system. The advantae of this set-up is that, the Fourier plane bein accessible, it is possible to filter (or modify) in this plane some frequency components by usin an appropriate transmission mask. We can therefore filter the imae, i.e. modify its spatial properties (the same way we can modify temporal properties of an electronic sinal with low-pass, hih-pass or band-pass filters).
2 Laboratory experiments: 1. Adjustment of the set-up a) Turn on the laser and check that the pinhole is in the riht position b) Identify the different optical components in the Fourier transform set-up. 2. The Fourier transform of some simple objects a) Put the object D2-2 in the object holder. b) Adjust L4 so an imae of the object is seen on the screen. It is now easy to chane between object and transform by enterin or removin the lens L4. c) Compare the objects D2-1 and D2-4. Examine both objects and their transforms. d) Which tranform theorems can you see illustrated? 3. The Fourier transform of many objects a) Enter the object D3-1 (many circular openins). By usin the same reasonin as in the last preparation exercise (fiure P2), try to understand the features of the Fourier transform. b) Compare the transform of object D3-2 (randomly placed circular openins) with the transform of object D3-1. c) Enter the object D3-3 (many more circular openins) and compare with the object D3-2. Why is the Fourier transform like this, what do you learn about the object? 4. The Fourier transform of a periodic object. a) Enter two ratin patterns (object D4-1) in the holder and a mask, so that both ratins can be viewed separately. b) Compare the Fourier transforms of the two patterns. c) Block the zeroth order by insertin a mask (dark spot) in the Fourier plane. Compare the two imaes of the objects when the zeroth order is blocked. (Check the imaes in detail!) 5. The transfer function of a lens a) Put object D5-1 in the holder (sector star). b) Adjust for sharp imae and study the quality of the imae in the centre. What do you learn about the lenses? c) Make a low-pass, hih-pass and band-pass filterin by usin small holes and dark spots. 6. Spatial filterin a) Place the object D6-1 (cross ratin) in the holder. b) Compare the object and the transform. c) Make vertical or horizontal spatial filterin, i.e. transform the rid into a ratin. 7. Simple pattern reconition 2
3 a) Place the object D7-1 in the object plane. Increasin frequency Increasin frequency Fiure 2. Object D7-1. b) Put a metal plate with a small openin (1 mm) in the Fourier plane and study the imae when only the zeroth order is transmitted throuh the system. c) Move the hole in the Fourier plane and study the appearance of the imae. 8. Theta modulation and incoherent illumination a) Place the object D8-1 (three bi circular areas) in the object plane. b) Study the Fourier transform of the object. c) Put a mirror between L1 and L2 and direct white liht into the system. d) Study the imae in the Fourier plane. e) What is the reason for usin monochromatic liht when makin imae processin? f) Filter the Fourier plane with filter D8-2 and study the imae. Adjust so that one area will be red, one yellow and one blue. Theory. For the one-dimensional continuous Fourier transform we have: and (1) Further more for a function f(t), it s Fourier transform F(t) and a real scalin factor a the function f(t/a) has a Fourier transform a F(aν). In this lab, the Convolusion Theorem will be used. The convulsion of two functions f 1 (t) and f 2 (t) with Fourier transforms F 1 (ν) and F 2 (ν) respectively is the same as the inverse Fourier transform of ν ν. 3
4 For the preparation problems all the theorems for the two-dimensional transform are reduced to one dimension. Transforms for special functions and ordinary properties of the Fourier transform can be found in mathematical tables. The discrete Fourier transform How does a Fourier transform look like for a sampled function, e.. a function iven only by its values at a discrete number of points? In this case the Fourier transform is a discrete Fourier transform (DFT) which is a sum of functions with different frequency. If we set the samplin distance x in the object plane to be 1 then we sample the Fourier transform with a samplin distance in frequency f = 1/N, where N is the number of samplin points. We can then label the frequency components by n and the samplin points by k and obtain the DFT as: N 1 Gn k e j 2 ( ) ( ) nk / N, n =... N -1 (2) k Similarly the inverse Fourier transform (IDFT) is iven by: N nk / N k ( ) Gne ( ) j N k, k =... N -1 (3) The normalisation constant 1/N can also be included in DFT instead if one desires. Many of the ordinary properties of the Fourier transform are valid unchaned even for the discrete Fourier transform. This means for example that the DFT is linear, scalin affects both the frequency and the amplitude, and a spatial displacement only affects the phase of the transform and so on. However, some properties are specific for the DFT and IDFT and they are described below: a) The DFT is due to the samplin of a periodic function, exactly determined by its value in N points followin each other: For an inteer p we have: N 1 Gn p N ke j 2 ( ( ) ( ) n p / N ) k / N k (4) N 1 k ( k) e j2nk / N e j2pkn = 1 G( n) (5) b) In the same way samplin in the frequency domain ives rise to periodicity in space. 4
5 1/2x Fiure 3. Aliasin. c) The sample interval is not infinitesimal. This can cause aliasin (fiure 3). Accordin to the sample theorem the oriinal sinal can only be recreated exactly from the sample values if the interval x is shorter than 1/2f max, where f max is the upper frequency limit of the analoues sinal. If the samplin is made too coarse a distorted frequency function is achieved. This is aliasin. d) The number of points, N, is not infinite. This means a truncation of the point series (k) or in a way a multiplication by a "box function". x = Fiure 4. Multiplication by a box function This multiplication in space results in the frequency plane in a convolution with the Fourier transform of the box function, which is a sinc(f) function. Usin a larer number of points decreases this truncation. This reduction is paid by an increased calculation time. Another way of reducin the distortion from truncation is to apply functions with an other appearance than a box. Such functions are called window functions or apodization functions. By a clever selection of the apodization function the amplitude of the side lobes described by the sinc 2 (f)-function can be reduced. e) Convolution can normally be calculated by makin the Fourier transform of the two sinals involved, multiply their transforms and then make the inverse Fourier transform. Due to the earlier discussed periodicity in the DFT and IDFT, the circular convolution sum is achieved: N 1 k ( ) hx ( ) lhk ( ) ( l) l (6) 5
6 The circular convolution means that the two number series (k) and h(k) will be repeated periodically outside the interval [, N-1] before the sum is made. If the circular convolution shall correspond to the ordinary convolution sum it is noteworthy to remember that two sinals with the lenth p, ive a result with the lenth 2p-1. So if the two series (k) and h(k) are expanded with zeroes so that N is reater than 2p-1, then the circular convolution will correspond exactly with the ordinary within the interval [, N-1]. The reason why one is really interested in calculatin the convolution via DFT and IDFT is that it is much faster than to make the calculations directly as lon as the number of points is of the order 64 or reater. Fast Fourier Transform (FFT) To calculate DFT of a number series by writin a proram that directly calculates the N sums in the transform (2) is not wise. N does not need to be so lare before the time to calculate will be unsuitably lon. The time to calculate is N 2, and already N = 32 means 124 operations. Even before computers where available for calculations it was necessary to make Fourier transformations and a stron need to eliminate the dull calculations by hand. As early as 193 a method was presented by C. Runde to minimise the calculations of transforms with 12 and 24 points. By notin some symmetries and periodicity in the calculations of the Fourier transform it was possible for Danielson and Lanczos to present a eneral method for number series of 2 k points that reduced the number of operations from N 2 to N( 2 lon). When the computers were available this method was not known enerally and most calculations where made by the N 2 operations in (2). Not until the beinnin of the 196s was this method rediscovered and presented to a lare number of persons in the article: Cooley, J.W. and Tukey, J.W., "An Alorithm for the Machine Calculation of Complex Fourier Series.", Mathematics of Computation, Vol. 1, April 1965, pp How DFT is calculated in a 2 k points FFT-scheme is described in the followin schematic example: (Sande-Tukey alorithm for computin the DFT - decimation in frequency.) () (1) (2) (3) (4) (5) (6) (7) 1 p= p=1 p=2 p=3 2 p= p=2 p= 3 p= p= p= p=2 p= G() G(4) G(2) G(6) G(1) G(5) G(3) G(7) Fiure 5. Calculation scheme for an 8 points FFT 6
7 The Fourier transform (2) is written by: N 1 k nk Gn ( ) ( k) W where W e j2 / N (1) The calculations are divided into M = 2 lon steps where in each step the number series m (k) is transformed by two calculations. m1 () r m() r m() s (when in upper subroup) (11) p m1( s) m() r m() s W (when in lower subroup) (12) This means that no new computer memory is needed for storin the new values in the number series; m+1 replaces directly the old m. The numbers r, s and p are inteers in the interval [, N-1]. Which values they have are shown for N = 8 in fi. 5. As seen in the fiure the calculations are divided into half as bi subroups for each step in the scheme. The upper part in such a subroup ets the index r while the lower ets the index s in the calculations of (1). For example 1 (5) is iven by equation (12), where r = 1 and s = 5. Correspondinly 2 () is found in equation (11) with r = and s = 2. The exponent p always starts on zero in the columns of each lower subroup; it increases by the step 2 m-1 in the separate columns. This means that p increases by the step 1 in 1, by the step 2 in 2, by the step 4 in 3 (not applicable in this case), and so on. The elements in the G-vector appear in a peculiar order (see fiure 5). The arranement of the elements is iven by bit reversal. If a binary number ives the address of a certain vector in m (k) then this number is reversed and the correct address is found for the G-vector. As an example the element in 3 (3) = 3 (11) is the element G(11) = G(6) and in 3 (1) = 3 (1) we have G(1) = G(4). To increase the calculation speed in the FFT calculations when several vectors of the same lenth shall be transformed, it is useful to calculate a table of the exponentials e j2 n/ N for n =.N-1. Then the time-consumin sine and cosine calculations are only made once. Example Let us calculate 1 (6) if (6) = 7 and (2) = 3. In fi. 5 we have p = 2 at this point. This means that equation (12) is applicable in this case. We have as s = 6 and r = 2: It is easier to find 1 (2), which is iven by equation (11). We have: ( 2) ( 2) ( 6) ( 2 / 8)( 2) / 2 ( 6) ( 2) ( 6) e 4e 4i 1 7
8 Problems 1. Diital part Usin a proram of your choice (preferably Matlab) do the followin tasks. In Appendix I you can find example matlab code for each exercise that you are free to use. a) 1D Fourier transform of a sine wave 1. Plot a sine function with a frequency of 1Hz usin a samplin frequency of 5Hz. 2. Plot its fast Fourier transform (FFT). 3. Move the zero-frequency component to the center of the array. It is useful for visualizin a Fourier transform with the zero-frequency component in the middle of the spectrum. 4. Multiply the sine wave by a Hammin window. What is happenin to the FFT? 5. Repeat tasks 1 to 3 usin samplin frequencies of 2Hz and 21Hz. What do you learn? b) 2D Fourier transform of a rectanle 1. Plot a rectanle. 2. Plot its 2D FFT. 3. Move the zero-frequency component to the center of the array. 4. Try different rectanle sizes. What happens? c) 2D Fourier transform of a circle 1. Plot a circle. 2. Plot its 2D FFT. 3. Move the zero-frequency component to the center of the array. 4. Try different diameter sizes. What happens? 2. Analoue part Collimated liht y Q R O r x n C D Y P X A Plane wave Object (x,y) f Focal plane Fiure P1 The decomposition of the object transmission function (x,y) into Fourier components. 8
9 a) Which spatial frequency is found at a point P in the Fourier plane of a lens with the focal lenth 4 cm if the point is on the Y-axis and is.78 cm from the X- axis? = 633 nm. The fiure P1 shows a eneral Fourier transformation by a lens. b) After the focal plane (or Fourier plane), we can observe the imae of the object by the lens (see Fiure 1). It is therefore possible to filter the object, i.e. modify its spatial properties (the same way we can modify temporal properties of an electronic sinal with low-pass, hih-pass or band-pass filters). Explain how you could perform a low-pass, a hih-pass or a band-pass filter. c) Draw the two functions: a(x) and s(x) defined below. Draw also the convolution of a(x) with s(x). 2 for 1.5 for 3 4 for all other.5 5 where δ(x) is the dirac delta function. d) Fiure P2 illustrates how the Fourier transform of a complicated object is deduced from a combination of some simple transforms, thereby illustratin the convolution theorem. The complete object is shown in Fiure P2 a). We can obtain this object usin three basic components. If we start with an infinite matrix of delta functions (Fiure P2 d)). Then we perform a convolution with a hole (Fiure P2 c)). The result is an infinite matrix of holes. We limit the number of holes by multiplication with a rectanular aperture. Thus we obtain the object in Fiure P2 a). Directly below Fiure P2 a)-d) the Fourier transform of each object is presented in Fiure P2 e)-h). e.. the Fourier transform of Fiure P2 d) is P2 ). In a similar way, we can obtain the Fourier transform of Fiure P2 a) usin the Fourier transform of each basic component shown in Fiure P2 b)-d). Accordin to the Convolusion Theorem a convolusion in space is a multiplication in Fourier space and vice versa. Therefore, instead of convolutin Fiure P2 ) and f), we multiply them. Instead of multiplyin the aforementioned product with e), we convolute it. Thus obtainin the Fourier transform of the more complex object h). Keepin this process in mind, what would be the object (Fiure P2 a)) and the Fourier transform (Fiure P2 h)) be if the window in b) instead was a thin vertical rectanular openin? 9
10 Fiure P2 Combination of different objects and their Fourier transforms. 1
11 Appendix I: Matlab code for computer exercises Part a) %% Sine function %Plot a sine function F1 = 1; %Frequency of the sine wave in Hz Fs = 1; %Samplin frequency in Hz Ts = 1/Fs; %Period of the samplin ncyl = 1; %Number of sine wave cycles to enerate t = :Ts:nCyl*1/F1; %Time base H = sin(2*pi*f1*t); fiure('units','normalized','outerposition',[ 1 1]) subplot(2,3,1); plot(t,h); title(['sine Wave f=', num2str(f1), 'Hz; Samplin fs=', num2str(fs), 'Hz']); xlabel('time(s)'); ylabel('amplitude'); %Plot its FFT F_H = fft(h); %perform the FFT N = lenth(t); n = :N-1; subplot(2,3,2); plot(n,abs(f_h)); %the FFT is complex so we want to plot only the absolute value. title('double Sided FFT - without FFTShift'); xlabel('sample points (N-point DFT)') ylabel(' DFT Values '); %Move the zero-frequency component to the center of the array. F_H_shift = fftshift(f_h); f = Fs*(-N/2+.5:N/2-.5)/N; subplot(2,3,3); plot(f,abs(f_h_shift)); title('double Sided FFT - with FFTShift'); xlabel('frequency (Hz)') ylabel(' DFT Values '); %Multiplication by a Hammin window W = hammin(n); %Creates the Hammin window WH = W'.*H; %Multiplies the sine wave by a Hammin window subplot(2,3,4); plot(t,wh); title(['sine Wave multiplied by a Hammin window f=', num2str(f1), 'Hz; Samplin fs=', num2str(fs), 'Hz']); xlabel('time(s)'); ylabel('amplitude'); F_WH = fft(wh); %perform the FFT subplot(2,3,5); plot(n,abs(f_wh)); %the FFT is complex so we want to plot only the absolute value. title('double Sided FFT - without FFTShift (Hammin window)'); xlabel('sample points (N-point DFT)') ylabel(' DFT Values ');
12 F_WH_shift = fftshift(f_wh); subplot(2,3,6); plot(f,abs(f_wh_shift)); title('double Sided FFT - with FFTShift (Hammin window)'); xlabel('frequency (Hz)') ylabel(' DFT Values '); Optics and optical desin Part b) %%Rectanle %Plot a rectanle N = 3; %number of samplin points Rx = 1/2; %horizontal size of the rectanle in ratio of N Ry = 1/1; %vertical size of the rectanle in ratio of N x = linspace(-2,2,n); y = linspace(-2,2,n); R = zeros(n); Rx1 = floor(1/2*n*(1-rx)); Rx2 = N-Rx1; Ry1 = floor(1/2*n*(1-ry)); Ry2 = N-Ry1; nx = Rx2-Rx1+1; ny = Ry2-Ry1+1; R(Ry1:Ry2,Rx1:Rx2)=ones(ny,nx); %Create the rectanle fiure; imaesc(x,y,r); title('rectanle') xlabel('x') ylabel('y'); %Plot its FFT F_R = fft2(r); fiure; imaesc(x,y,abs(f_r)); %the FFT is complex so we want to plot only the absolute value. title('fft without FFTShift'); xlabel('x') ylabel('y'); %Move the zero-frequency component to the center of the array. F_R_shift = fftshift(f_r); fiure; imaesc(x,y,abs(f_r_shift)); %the FFT is complex so we want to plot only the absolute value. title('fft with FFTShift'); xlabel('x') ylabel('y'); Part c) %%Circle %Plot a circle N = 5; %number of samplin points D = 1/2; %diameter of the circle in ratio of N x = linspace(-2,2,n); 12
13 y = linspace(-2,2,n); C = zeros(n); for k=1:n for l=1:n if (N/2-k)^2+(N/2-l)^2<(D*N/2)^2 C(k,l)=1; end end end fiure; imaesc(x,y,c); title('circle') xlabel('x') ylabel('y'); %Plot its FFT F_C = fft2(c); fiure; imaesc(x,y,abs(f_c)); %the FFT is complex so we want to plot only the absolute value. title('fft without FFTShift'); xlabel('x') ylabel('y'); %Move the zero-frequency component to the center of the array. F_C_shift = fftshift(f_c); fiure; imaesc(x,y,abs(f_c_shift)); %the FFT is complex so we want to plot only the absolute value. title('fft with FFTShift'); xlabel('x') ylabel('y'); 13
IT6502 DIGITAL SIGNAL PROCESSING Unit I - SIGNALS AND SYSTEMS Basic elements of DSP concepts of frequency in Analo and Diital Sinals samplin theorem Discrete time sinals, systems Analysis of discrete time
More informationBoundary value problems - an introduction
Boundary value problems - an introduction Up till now, we ve been worryin about initial value problems in DEs. Also quite common, and enerally much more difficult, are boundary value problems. One oriin
More informationDigital Electronics Paper-EE-204-F SECTION-A
B.Tech 4 th Semester (AEIE) F Scheme, May 24 Diital Electronics Paper-EE-24-F Note : Attempt five questions. Question is compulsory and one question from each of the four sections.. What is a loic ate?
More informationMatrix multiplication: a group-theoretic approach
CSG399: Gems of Theoretical Computer Science. Lec. 21-23. Mar. 27-Apr. 3, 2009. Instructor: Emanuele Viola Scribe: Ravi Sundaram Matrix multiplication: a roup-theoretic approach Given two n n matrices
More informationE The Fast Fourier Transform
Fourier Transform Methods in Finance By Umberto Cherubini Giovanni Della Lunga Sabrina Mulinacci Pietro Rossi Copyright 2010 John Wiley & Sons Ltd E The Fast Fourier Transform E.1 DISCRETE FOURIER TRASFORM
More informationPHY 133 Lab 1 - The Pendulum
3/20/2017 PHY 133 Lab 1 The Pendulum [Stony Brook Physics Laboratory Manuals] Stony Brook Physics Laboratory Manuals PHY 133 Lab 1 - The Pendulum The purpose of this lab is to measure the period of a simple
More informationEfficient method for obtaining parameters of stable pulse in grating compensated dispersion-managed communication systems
3 Conference on Information Sciences and Systems, The Johns Hopkins University, March 12 14, 3 Efficient method for obtainin parameters of stable pulse in ratin compensated dispersion-manaed communication
More informationAmplitude Adaptive ASDM without Envelope Encoding
Amplitude Adaptive ASDM without Envelope Encodin Kaspars Ozols and Rolands Shavelis Institute of Electronics and Computer Science 14 Dzerbenes Str., LV-16, Ria, Latvia Email: kaspars.ozols@edi.lv, shavelis@edi.lv
More informationParametric Equations
Parametric Equations Suppose a cricket jumps off of the round with an initial velocity v 0 at an anle θ. If we take his initial position as the oriin, his horizontal and vertical positions follow the equations:
More informationImpulse Response and Generating Functions of sinc N FIR Filters
ICDT 20 : The Sixth International Conference on Diital Telecommunications Impulse Response and eneratin Functions of sinc FIR Filters J. Le Bihan Laboratoire RESO Ecole ationale d'inénieurs de Brest (EIB)
More informationFundamentals of the DFT (fft) Algorithms
Fundamentals of the DFT (fft) Algorithms D. Sundararajan November 6, 9 Contents 1 The PM DIF DFT Algorithm 1.1 Half-wave symmetry of periodic waveforms.............. 1. The DFT definition and the half-wave
More informationComputer Vision Lecture 3
Demo Haribo Classification Computer Vision Lecture 3 Linear Filters 23..24 Bastian Leibe RWTH Aachen http://www.vision.rwth-aachen.de leibe@vision.rwth-aachen.de Code available on the class website...
More information5 Shallow water Q-G theory.
5 Shallow water Q-G theory. So far we have discussed the fact that lare scale motions in the extra-tropical atmosphere are close to eostrophic balance i.e. the Rossby number is small. We have examined
More informationCE 513: STATISTICAL METHODS
28-8-217/CE 68 CE 513: STATISTICAL METHODS IN CIVIL ENGINEERING Lecture: Introduction to Fourier transforms Dr. Budhaditya Hazra Room: N-37 Department of Civil Engineering 1 Fourier Analysis Fourier Series
More information12.1 Fourier Transform of Discretely Sampled Data
494 Chapter 12. Fast Fourier Transform now is: The PSD-per-unit-time converges to finite values at all frequencies except those where h(t) has a discrete sine-wave (or cosine-wave) component of finite
More informationThere and back again A short trip to Fourier Space. Janet Vonck 23 April 2014
There and back again A short trip to Fourier Space Janet Vonck 23 April 2014 Where can I find a Fourier Transform? Fourier Transforms are ubiquitous in structural biology: X-ray diffraction Spectroscopy
More informationWindow energy rating systems
Window enery ratin systems Claus F. Jensen, MSc Svend Svendsen, Professor 1. INTRODUCTION Different window enery ratin systems are bein developed in Denmark and in Europe. The purpose of a controlled and
More informationLab 4: Introduction to Signal Processing: Fourier Transform
Lab 4: Introduction to Signal Processing: Fourier Transform This laboratory requires the following equipment: Matlab The laboratory duration is approximately 3 hours. Although this laboratory is not graded,
More informationREVIEW: Going from ONE to TWO Dimensions with Kinematics. Review of one dimension, constant acceleration kinematics. v x (t) = v x0 + a x t
Lecture 5: Projectile motion, uniform circular motion 1 REVIEW: Goin from ONE to TWO Dimensions with Kinematics In Lecture 2, we studied the motion of a particle in just one dimension. The concepts of
More informationFourier Transform. sin(n# x)), where! = 2" / L and
Fourier Transform Henning Stahlberg Introduction The tools provided by the Fourier transform are helpful for the analysis of 1D signals (time and frequency (or Fourier) domains), as well as 2D/3D signals
More informationMechanics Cycle 3 Chapter 12++ Chapter 12++ Revisit Circular Motion
Chapter 12++ Revisit Circular Motion Revisit: Anular variables Second laws for radial and tanential acceleration Circular motion CM 2 nd aw with F net To-Do: Vertical circular motion in ravity Complete
More informationConvergence of DFT eigenvalues with cell volume and vacuum level
Converence of DFT eienvalues with cell volume and vacuum level Sohrab Ismail-Beii October 4, 2013 Computin work functions or absolute DFT eienvalues (e.. ionization potentials) requires some care. Obviously,
More informationEE482: Digital Signal Processing Applications
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:305:45 CBC C222 Lecture 8 Frequency Analysis 14/02/18 http://www.ee.unlv.edu/~b1morris/ee482/
More informationFourier Optics - Exam #1 Review
Fourier Optics - Exam #1 Review Ch. 2 2-D Linear Systems A. Fourier Transforms, theorems. - handout --> your note sheet B. Linear Systems C. Applications of above - sampled data and the DFT (supplement
More informationLecture 9: Indirect Imaging 2. Two-Element Interferometer. Van Cittert-Zernike Theorem. Aperture Synthesis Imaging. Outline
Lecture 9: Indirect Imaging 2 Outline 1 Two-Element Interferometer 2 Van Cittert-Zernike Theorem 3 Aperture Synthesis Imaging Cygnus A at 6 cm Image courtesy of NRAO/AUI Very Large Array (VLA), New Mexico,
More informationTransactions of the VŠB Technical University of Ostrava, Mechanical Series No. 2, 2008, vol. LIV, article No. 1618
Transactions of the VŠB Technical University of Ostrava, Mechanical Series No., 008, vol. LIV, article No. 68 Dariusz JANECKI *, Lesze CEDRO ** SAMPLED SIGNALS DIFFERENTIATION USING A FREQUENCY CORRECTED
More informationStoichiometry of the reaction of sodium carbonate with hydrochloric acid
Stoichiometry of the reaction of sodium carbonate with hydrochloric acid Purpose: To calculate the theoretical (expected) yield of product in a reaction. To weih the actual (experimental) mass of product
More informationPHYS 124 Section A01 Final Examination Autumn 2006
PHYS 14 Section A1 Final Examination Autumn 6 Name : S Student ID Number : Instructor : Marc de Montiny Time : Monday, December 18, 6 9: 11: AM Room : Tory Lecture (Turtle) TL-B Instructions : This booklet
More informationFall 2011, EE123 Digital Signal Processing
Lecture 6 Miki Lustig, UCB September 11, 2012 Miki Lustig, UCB DFT and Sampling the DTFT X (e jω ) = e j4ω sin2 (5ω/2) sin 2 (ω/2) 5 x[n] 25 X(e jω ) 4 20 3 15 2 1 0 10 5 1 0 5 10 15 n 0 0 2 4 6 ω 5 reconstructed
More informationDynamical Diffraction
Dynamical versus Kinematical Di raction kinematical theory valid only for very thin crystals Dynamical Diffraction excitation error s 0 primary beam intensity I 0 intensity of other beams consider di racted
More informationInformation 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 informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics L HOSPITAL TYPE RULES FOR OSCILLATION, WITH APPLICATIONS IOSIF PINELIS Department of Mathematical Sciences, Michian Technoloical University, Houhton,
More informationLAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011
University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 2: DTFT, DFT, and DFT Spectral
More information4.3. Solving Friction Problems. Static Friction Problems. Tutorial 1 Static Friction Acting on Several Objects. Sample Problem 1.
Solvin Friction Problems Sometimes friction is desirable and we want to increase the coefficient of friction to help keep objects at rest. For example, a runnin shoe is typically desined to have a lare
More informationPART 1. Review of DSP. f (t)e iωt dt. F(ω) = f (t) = 1 2π. F(ω)e iωt dω. f (t) F (ω) The Fourier Transform. Fourier Transform.
PART 1 Review of DSP Mauricio Sacchi University of Alberta, Edmonton, AB, Canada The Fourier Transform F() = f (t) = 1 2π f (t)e it dt F()e it d Fourier Transform Inverse Transform f (t) F () Part 1 Review
More informationRound-off Error Free Fixed-Point Design of Polynomial FIR Predictors
Round-off Error Free Fixed-Point Desin of Polynomial FIR Predictors Jarno. A. Tanskanen and Vassil S. Dimitrov Institute of Intellient Power Electronics Department of Electrical and Communications Enineerin
More informationTransforms and Orthogonal Bases
Orthogonal Bases Transforms and Orthogonal Bases We now turn back to linear algebra to understand transforms, which map signals between different domains Recall that signals can be interpreted as vectors
More informationIntroduction to FT-IR Spectroscopy
Introduction to FT-IR Spectroscopy An FT-IR Spectrometer is an instrument which acquires broadband NIR to FIR spectra. Unlike a dispersive instrument, i.e. grating monochromator or spectrograph, an FT-IR
More informationONLINE: MATHEMATICS EXTENSION 2 Topic 6 MECHANICS 6.3 HARMONIC MOTION
ONINE: MATHEMATICS EXTENSION Topic 6 MECHANICS 6.3 HARMONIC MOTION Vibrations or oscillations are motions that repeated more or less reularly in time. The topic is very broad and diverse and covers phenomena
More informationEinstein Classes, Unit No. 102, 103, Vardhman Ring Road Plaza, Vikas Puri Extn., Outer Ring Road New Delhi , Ph. : ,
1 O P T I C S 1. Define resolving power of a telescope & microscope and give the expression for its resolving power. 2. Explain briefly the formation of mirage in deserts. 3. The radii of curvature of
More information6 Mole Concept. g mol. g mol. g mol ) + 1( g : mol ratios are the units of molar mass. It does not matter which unit is on the
What is a e? 6 Mole Concept The nature of chemistry is to chane one ecule into one or more new ecules in order to create new substances such as paints, fertilizers, food additives, medicines, etc. When
More informationLAB # 5 HANDOUT. »»» The N-point DFT is converted into two DFTs each of N/2 points. N = -W N Then, the following formulas must be used. = k=0,...
EEE4 Lab Handout. FAST FOURIER TRANSFORM LAB # 5 HANDOUT Data Sequence A = x, x, x, x3, x4, x5, x6, x7»»» The N-point DFT is converted into two DFTs each of N/ points. x, x, x4, x6 x, x3, x5, x7»»» N =e
More information1 CHAPTER 7 PROJECTILES. 7.1 No Air Resistance
CHAPTER 7 PROJECTILES 7 No Air Resistance We suppose that a particle is projected from a point O at the oriin of a coordinate system, the y-axis bein vertical and the x-axis directed alon the round The
More informationAnother possibility is a rotation or reflection, represented by a matrix M.
1 Chapter 25: Planar defects Planar defects: orientation and types Crystalline films often contain internal, 2-D interfaces separatin two reions transformed with respect to one another, but with, otherwise,
More informationA Constant Complexity Fair Scheduler with O(log N) Delay Guarantee
A Constant Complexity Fair Scheduler with O(lo N) Delay Guarantee Den Pan and Yuanyuan Yan 2 Deptment of Computer Science State University of New York at Stony Brook, Stony Brook, NY 79 denpan@cs.sunysb.edu
More information(a) 1m s -2 (b) 2 m s -2 (c) zero (d) -1 m s -2
11 th Physics - Unit 2 Kinematics Solutions for the Textbook Problems One Marks 1. Which one of the followin Cartesian coordinate system is not followed in physics? 5. If a particle has neative velocity
More informationConical Pendulum Linearization Analyses
European J of Physics Education Volume 7 Issue 3 309-70 Dean et al. Conical Pendulum inearization Analyses Kevin Dean Jyothi Mathew Physics Department he Petroleum Institute Abu Dhabi, PO Box 533 United
More informationV DD. M 1 M 2 V i2. V o2 R 1 R 2 C C
UNVERSTY OF CALFORNA Collee of Enineerin Department of Electrical Enineerin and Computer Sciences E. Alon Homework #3 Solutions EECS 40 P. Nuzzo Use the EECS40 90nm CMOS process in all home works and projects
More informationPeriodic motions. Periodic motions are known since the beginning of mankind: Motion of planets around the Sun; Pendulum; And many more...
Periodic motions Periodic motions are known since the beginning of mankind: Motion of planets around the Sun; Pendulum; And many more... Periodic motions There are several quantities which describe a periodic
More information2.71. Final examination. 3 hours (9am 12 noon) Total pages: 7 (seven) PLEASE DO NOT TURN OVER UNTIL EXAM STARTS PLEASE RETURN THIS BOOKLET
2.71 Final examination 3 hours (9am 12 noon) Total pages: 7 (seven) PLEASE DO NOT TURN OVER UNTIL EXAM STARTS Name: PLEASE RETURN THIS BOOKLET WITH YOUR SOLUTION SHEET(S) MASSACHUSETTS INSTITUTE OF TECHNOLOGY
More informationDisclaimer: This lab write-up is not
Disclaimer: This lab write-up is not to be copied, in whole or in part, unless a proper reference is made as to the source. (It is stronly recommended that you use this document only to enerate ideas,
More informationUSE OF FILTERED SMITH PREDICTOR IN DMC
Proceedins of the th Mediterranean Conference on Control and Automation - MED22 Lisbon, Portual, July 9-2, 22. USE OF FILTERED SMITH PREDICTOR IN DMC C. Ramos, M. Martínez, X. Blasco, J.M. Herrero Predictive
More informationEE Camera & Image Formation
Electric Electronic Engineering Bogazici University February 21, 2018 Introduction Introduction Camera models Goal: To understand the image acquisition process. Function of the camera Similar to that of
More informationWhat types of isometric transformations are we talking about here? One common case is a translation by a displacement vector R.
1. Planar Defects Planar defects: orientation and types Crystalline films often contain internal, -D interfaces separatin two reions transformed with respect to one another, but with, otherwise, essentially,
More informationLAB 1: MATLAB - Introduction to Programming. Objective:
LAB 1: MATLAB - Introduction to Programming Objective: The objective of this laboratory is to review how to use MATLAB as a programming tool and to review a classic analytical solution to a steady-state
More informationINTRODUCTION TO THE DFS AND THE DFT
ITRODUCTIO TO THE DFS AD THE DFT otes: This brief handout contains in very brief outline form the lecture notes used for a video lecture in a previous year introducing the DFS and the DFT. This material
More informationLecture 5. The Digital Fourier Transform. (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith)
Lecture 5 The Digital Fourier Transform (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith) 1 -. 8 -. 6 -. 4 -. 2-1 -. 8 -. 6 -. 4 -. 2 -. 2. 4. 6. 8 1
More informationMultimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2
Multimedia Signals and Systems - Audio and Video Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Kunio Takaya Electrical and Computer Engineering University of Saskatchewan December
More informationLinearized optimal power flow
Linearized optimal power flow. Some introductory comments The advantae of the economic dispatch formulation to obtain minimum cost allocation of demand to the eneration units is that it is computationally
More informationComputational Methods for Astrophysics: Fourier Transforms
Computational Methods for Astrophysics: Fourier Transforms John T. Whelan (filling in for Joshua Faber) April 27, 2011 John T. Whelan April 27, 2011 Fourier Transforms 1/13 Fourier Analysis Outline: Fourier
More informationNonlinear Model Reduction of Differential Algebraic Equation (DAE) Systems
Nonlinear Model Reduction of Differential Alebraic Equation DAE Systems Chuili Sun and Jueren Hahn Department of Chemical Enineerin eas A&M University Collee Station X 77843-3 hahn@tamu.edu repared for
More informationEDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT. October 19, 2016
EDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT October 19, 2016 DFT resolution 1 N-point DFT frequency sampled at θ k = 2πk N, so the resolution is f s/n If we want more, we use N
More informationFOURIER TRANSFORMS. At, is sometimes taken as 0.5 or it may not have any specific value. Shifting at
Chapter 2 FOURIER TRANSFORMS 2.1 Introduction The Fourier series expresses any periodic function into a sum of sinusoids. The Fourier transform is the extension of this idea to non-periodic functions by
More information2.2 Differentiation and Integration of Vector-Valued Functions
.. DIFFERENTIATION AND INTEGRATION OF VECTOR-VALUED FUNCTIONS133. Differentiation and Interation of Vector-Valued Functions Simply put, we differentiate and interate vector functions by differentiatin
More informationSIMG Optics for Imaging Solutions to Final Exam
SIMG-733-009 Optics for Imaging Solutions to Final Exam. An imaging system consists of two identical thin lenses each with focal length f = f = +300 mm and diameter d = d =50mm. The lenses are separated
More informationLP Rounding and Combinatorial Algorithms for Minimizing Active and Busy Time
LP Roundin and Combinatorial Alorithms for Minimizin Active and Busy Time Jessica Chan, Samir Khuller, and Koyel Mukherjee University of Maryland, Collee Park {jschan,samir,koyelm}@cs.umd.edu Abstract.
More informationSynthesis of high-order bandpass filters based on coupled-resonator optical waveguides (CROWs)
Synthesis of hih-order bandpass filters based on coupled-resonator optical waveuides (CROWs) Hsi-Chun Liu* and Amnon Yariv Department of Electrical Enineerin, California Institute of Technoloy, Pasadena,
More informationThe Discrete Fourier Transform
In [ ]: cd matlab pwd The Discrete Fourier Transform Scope and Background Reading This session introduces the z-transform which is used in the analysis of discrete time systems. As for the Fourier and
More informationThe Discrete Fourier transform
453.70 Linear Systems, S.M. Tan, The University of uckland 9- Chapter 9 The Discrete Fourier transform 9. DeÞnition When computing spectra on a computer it is not possible to carry out the integrals involved
More informationGeneralization of Vieta's Formula
Rose-Hulman Underraduate Mathematics Journal Volume 7 Issue Article 4 Generalization of Vieta's Formula Al-Jalila Al-Abri Sultan Qaboos University in Oman Follow this and additional wors at: https://scholar.rose-hulman.edu/rhumj
More informationDFT-Based FIR Filtering. See Porat s Book: 4.7, 5.6
DFT-Based FIR Filtering See Porat s Book: 4.7, 5.6 1 Motivation: DTFT View of Filtering There are two views of filtering: * Time Domain * Frequency Domain x[ X f ( θ ) h[ H f ( θ ) Y y[ = h[ * x[ f ( θ
More informationDigital Signal Processing Lab 3: Discrete Fourier Transform
Digital Signal Processing Lab 3: Discrete Fourier Transform Discrete Time Fourier Transform (DTFT) The discrete-time Fourier transform (DTFT) of a sequence x[n] is given by (3.1) which is a continuous
More informationPhysics I : Oscillations and Waves Prof. S. Bharadwaj Department of Physics and Meteorology Indian Institute of Technology, Kharagpur
Physics I : Oscillations and Waves Prof. S. Bharadwaj Department of Physics and Meteorology Indian Institute of Technology, Kharagpur Lecture - 21 Diffraction-II Good morning. In the last class, we had
More informationMathematics for Chemists 2 Lecture 14: Fourier analysis. Fourier series, Fourier transform, DFT/FFT
Mathematics for Chemists 2 Lecture 14: Fourier analysis Fourier series, Fourier transform, DFT/FFT Johannes Kepler University Summer semester 2012 Lecturer: David Sevilla Fourier analysis 1/25 Remembering
More informationLecture 10, Multirate Signal Processing Transforms as Filter Banks. Equivalent Analysis Filters of a DFT
Lecture 10, Multirate Signal Processing Transforms as Filter Banks Equivalent Analysis Filters of a DFT From the definitions in lecture 2 we know that a DFT of a block of signal x is defined as X (k)=
More informationDigital Signal Processing Chapter 10. Fourier Analysis of Discrete- Time Signals and Systems CHI. CES Engineering. Prof. Yasser Mostafa Kadah
Digital Signal Processing Chapter 10 Fourier Analysis of Discrete- Time Signals and Systems Prof. Yasser Mostafa Kadah CHI CES Engineering Discrete-Time Fourier Transform Sampled time domain signal has
More informationFourier 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 informationNANO 703-Notes. Chapter 12-Reciprocal space
1 Chapter 1-Reciprocal space Conical dark-field imain We primarily use DF imain to control imae contrast, thouh STEM-DF can also ive very hih resolution, in some cases. If we have sinle crystal, a -DF
More informationProblems of the 9 th International Physics Olympiads (Budapest, Hungary, 1976)
Problems of the 9 th International Physics Olympiads (Budapest, Hunary, 1976) Theoretical problems Problem 1 A hollow sphere of radius R = 0.5 m rotates about a vertical axis throuh its centre with an
More informationThe Discrete Fourier Transform. Signal Processing PSYCH 711/712 Lecture 3
The Discrete Fourier Transform Signal Processing PSYCH 711/712 Lecture 3 DFT Properties symmetry linearity shifting scaling Symmetry x(n) -1.0-0.5 0.0 0.5 1.0 X(m) -10-5 0 5 10 0 5 10 15 0 5 10 15 n m
More informationLevenberg-Marquardt-based OBS Algorithm using Adaptive Pruning Interval for System Identification with Dynamic Neural Networks
Proceedins of the 29 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, X, USA - October 29 evenber-marquardt-based OBS Alorithm usin Adaptive Prunin Interval for System Identification
More informationAssignment 6. Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Assinment 6 Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Round your answer, if appropriate. 1) A man 6 ft tall walks at a rate of 3 ft/sec
More informationENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin
ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM Dr. Lim Chee Chin Outline Introduction Discrete Fourier Series Properties of Discrete Fourier Series Time domain aliasing due to frequency
More informationRenormalization Group Theory
Chapter 16 Renormalization Group Theory In the previous chapter a procedure was developed where hiher order 2 n cycles were related to lower order cycles throuh a functional composition and rescalin procedure.
More informationA Mathematical Model for the Fire-extinguishing Rocket Flight in a Turbulent Atmosphere
A Mathematical Model for the Fire-extinuishin Rocket Fliht in a Turbulent Atmosphere CRISTINA MIHAILESCU Electromecanica Ploiesti SA Soseaua Ploiesti-Tiroviste, Km 8 ROMANIA crismihailescu@yahoo.com http://www.elmec.ro
More information1999 AAPT PHYSICS OLYMPIAD
1999 AAPT PHYSICS OLYMPIAD Entia non multiplicanda sunt praeter necessitatem 1999 MULTIPLE CHOICE SCREENING TEST 30 QUESTIONS - 40 MINUTES INSTRUCTIONS DO NOT OPEN THIS TEST UNTIL YOU ARE TOLD TO BEGIN
More information! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular
Previously ESE 531: Digital Signal Processing Lec 22: April 18, 2017 Fast Fourier Transform (con t)! Circular Convolution " Linear convolution with circular convolution! Discrete Fourier Transform " Linear
More informationLecture 4 Filtering in the Frequency Domain. Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2016
Lecture 4 Filtering in the Frequency Domain Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2016 Outline Background From Fourier series to Fourier transform Properties of the Fourier
More informationLecture 7 January 26, 2016
MATH 262/CME 372: Applied Fourier Analysis and Winter 26 Elements of Modern Signal Processing Lecture 7 January 26, 26 Prof Emmanuel Candes Scribe: Carlos A Sing-Long, Edited by E Bates Outline Agenda:
More informationOptics for Engineers Chapter 11
Optics for Engineers Chapter 11 Charles A. DiMarzio Northeastern University Nov. 212 Fourier Optics Terminology Field Plane Fourier Plane C Field Amplitude, E(x, y) Ẽ(f x, f y ) Amplitude Point Spread
More informationLecture? Using the FFT for Computation
Course Instructor Dr. Raymond C. Rumpf Office: A 337 Phone: (915) 747 6958 E Mail: rcrumpf@utep.edu Lecture? Using the FFT for Computation EE 4386/5301 Computational Methods in EE Outline What is a Fourier
More informationDSP Algorithm Original PowerPoint slides prepared by S. K. Mitra
Chapter 11 DSP Algorithm Implementations 清大電機系林嘉文 cwlin@ee.nthu.edu.tw Original PowerPoint slides prepared by S. K. Mitra 03-5731152 11-1 Matrix Representation of Digital Consider Filter Structures This
More informationTriangles and Vectors
Chapter 3 Triangles and Vectors As was stated at the start of Chapter 1, trigonometry had its origins in the study of triangles. In fact, the word trigonometry comes from the Greek words for triangle measurement.
More informationNick Egbert MA 158 Lesson 6. Recall that we define +,,, / on functions by performing these operations on the outputs.
Nick Ebert MA 158 Lesson 6 Function arithmetic Recall that we define +,,, / on functions by performin these operations on the outputs. So we have (f + )(x) f(x) + (x) (f )(x) f(x) (x) (f)(x) f(x)(x) (
More informationChapter 2: The Fourier Transform
EEE, EEE Part A : Digital Signal Processing Chapter Chapter : he Fourier ransform he Fourier ransform. Introduction he sampled Fourier transform of a periodic, discrete-time signal is nown as the discrete
More informationRecovery of Piecewise Smooth Images from Few Fourier Samples
Recovery of Piecewise Smooth Imaes from Few Fourier Samples Gre Onie Department of Mathematics University of Iowa Iowa City, Iowa 54 Email: reory-onie@uiowa.edu Mathews Jacob Department of Electric and
More informationPhys 531 Lecture 27 6 December 2005
Phys 531 Lecture 27 6 December 2005 Final Review Last time: introduction to quantum field theory Like QM, but field is quantum variable rather than x, p for particle Understand photons, noise, weird quantum
More informationOptics for Engineers Chapter 11
Optics for Engineers Chapter 11 Charles A. DiMarzio Northeastern University Apr. 214 Fourier Optics Terminology Apr. 214 c C. DiMarzio (Based on Optics for Engineers, CRC Press) slides11r1 1 Fourier Optics
More informationChapter 1 Indices & Standard Form
Chapter 1 Indices & Standard Form Section 1.1 Simplifying Only like (same letters go together; same powers and same letter go together) terms can be grouped together. Example: a 2 + 3ab + 4a 2 5ab + 10
More informationSpatial-Domain Convolution Filters
Spatial-Domain Filtering 9 Spatial-Domain Convolution Filters Consider a linear space-invariant (LSI) system as shown: The two separate inputs to the LSI system, x 1 (m) and x 2 (m), and their corresponding
More information