. Perform a geometric (ray-optics) construction (i.e., draw in the rays on the diagram) to show where the final image is formed.

Size: px
Start display at page:

Download ". Perform a geometric (ray-optics) construction (i.e., draw in the rays on the diagram) to show where the final image is formed."

Transcription

1 MASSACHUSETTS INSTITUTE of TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece Moder Optics Project Laboratory Optical Sigals, Devices & Systems Problem Set No. 1 Geometric optics Issued Tues. 9/13/2016 Fall Term, Due Tues. 9/20/2016 Readig recommedatio: Class Notes, Chapter 1. Be eat i your work! Problem 1.1 The two-mirror imagig system show o the ext page cosists of a large primary mirror, M 1, with radius of curvature, R 1, ad a small secodary mirror, M 2, with a radius of curvature, R 2. Both mirrors are cocave. I the system, d 1 is the distace of the object from the primary mirror, d 2 is the separatio betwee the mirrors, ad d 3 (ot show) is the distace of the fial image from M 2. (a) I the figure, you are give the special case where d 2 = R 1 2. Perform a geometric (ray-optics) costructio (i.e., draw i the rays o the diagram) to show where the fial image is formed. (b) Is the fial image real or virtual? (c) Show the positio ad orietatio of itermediate images, if ay, ad label them as real or virtual o the diagram. (d) For the case where both the mirror separatio, d 2, is arbitrary ad d 1 {d 2,R 1,R 2 }, ad with the help of the class otes, write dow ad simplify a expressio for the fial image distace, d 3, i terms of d 1, d 2, R 1, ad R 2. 1

2 Problem 1.1, Cotiued... object R 1 R 2 M 2 d 1 d 2 = R 1 /2 M 1 2

3 Problem 1.2 P d P.. h F * F* BFL R 2 R 1 z (a) A ray of light eters a cylidrically symmetric bead of glass ( thick les ) of refractive idex at a height h above its pricipal axis. The les has etrace ad exit faces with radii of curvature R 1 ad R 2 as show. Assumig the usual small-agle ad thi-les approximatios hold for each compoet of the thick les, use the ray-matrix approach to determie the approximate distace F at which the ray crosses the z-axis. (b) Now ru the ray backwards through the bead, keepig it still at a height h above the pricipal axis, so it is icidet of the R 2 facet first. What is the ew value F of F? (c) Does your result deped o h?. (d) Whe d = 0, show that your result for F is i agreemet with the les maker s formula. (e) Whe d = 0, do you get the expected result for two leses i series? (f) Based o your results for (a)-(e), commet o the use of such a bead as a les. For example, does it have a well-defied focal legth? What are its imagig properties? The plaes P ad P are ofte called pricipal plaes. F ad F are called the Effective Focal Legths (EFL). However, i practical use, the tedecy is to measure the Frot Focal Legth (FFL), sometimes called the frot focal distace (FFD), which is the distace from the vertex of the first optical surface to the frot focal poit. A similar defiitio holds for the Back Focal Legth (BFL). The FFL ad the BFL ca be calculated from the EFLs ad R 1 ad R 2 ad d. 3

4 Problem 1.3 Matchig FOV ad etrace pupil of cameras Whe creatig sythetic scees, projectio optics are ofte used to maipulate the source image (typically formed o a real-time display). The figure below shows a 3-les system that is desiged to couple the image o a display ito a camera. The display has a diameter 2D m ad emits light over a full coe agle of 2θ m. The camera has a fixed full agular field of view (FOV)of 2θ s ad a fixed etrace pupil of diameter 2D s. It is assumed the camera has its ow les F 4 (show as a dashed outlie) ad ca therefore form a image of the object geerated by the display. iput plae with display (ρi,ρ i ') F 2 F 3 output plae (ρ o,ρ o ') 2D m 2D s d 1 d 2 d 3 Camera d 4 The goal is to desig the 3-les projectio optics so that o light leavig the display is wasted, ad that maximum image size is achieved iside the camera. That is, we wat to icomig light to match the FOV ad the pupil diameter of the camera. (a) Derive A, B, C, ad D of the ABCD ray-optics matrix (i terms of the focal legths of the leses ad d 1, d 2, d 3 ad d 4 ) for the system bouded by the give object ad the iput plae to the camera. To help elimiate algebraic errors, you may wat to use Mathematica, Maple or Matlab for this exercise. (b) Cosider the special imagig case where we wat to make the image o the display appear to the camera as if the object was ifiitely far away. That is, whe the camera is focused at ifiity, the camera output image must be sharp. I this case, the regio betwee F 3 ad the camera is ofte referred to as collimated space. What coditio o the matrix elemets A, B, C, ad D would have to hold so that this is the case? (c) To match the FOV ad the iput aperture dimesios of the camera, what costraits o the matrix elemets A, B, C, ad D would have to hold to realize these two coditios? (d) For the special case where d 1 =, ad ad F 2 are idetical, draw the ray-optics system correspodig to the matched projectio system. (e) Assumig Case (d), d 2, d 3 ad d 4 are ucostraied. What are the coditios o these 3 variables so that matchig FOV ad etrace pupil occurs simultaeously? 4

5 Problem oly Cosider a microscope with the geometry show below. eyepiece objective y. g. δ F 2 F 2 eye α' + ε itermediate image <F 2 (a) Use the ABCD matrix method to show that the effective focal legth of the two-les combiatio (the distace behid L 2 that collimated iput light comes to a focus)is approximately d 2 F 2 /g, where d 2 is the separatio betwee the leses. For positive values of g, what is your iterpretatio of this result? (b) Use the M system equatio i the otes for the two-les system to calculate the exact (o approximatios) agular magificatio of the microscope. That is, assume d 1 = +ǫ, the itermediate image is placed at a distace a little less tha F 2 from the eyepiece, ad d 3 = -d mi. 5

6 Problem oly A illumiatio poit source is located at the back of a short cylidrical glass slab (coupler) which has a radius of curvature R at its other ed as show. The coupler has a legth d ad a refractive idex. Source Coupler R * d (a) What is the legth, d 1, of the coupler which produces a collimated exitig beam (i air)? (b) What is the legth, d 2, of the coupler so that the poit source is imaged at a equal distace d 2 i air away from the the covex ed of the coupler? The coupler is ow butted axially agaist a log glass rod (light pipe)of the same material ad of the same diameter. The goal is to efficietly trasfer light from the source ito the light pipe, but it turs out that the cotiguous ed of the light pipe also has a covex surface of radius of curvature R as show. Source Coupler R R Light Pipe Plae of iterest * d L (c) Igorig the outer boudaries of the coupler ad the light pipe, what should be the legth, d 3,of the coupler so that the light is collimated withi the light pipe? (d) Agai igorig the outer boudaries of the coupler ad the light pipe, what should be the legth, d 4,of the coupler so that the poit source is is imaged at a equal distace L = 2d 4 i the light pipe away from the covex side of the iterface betwee the coupler ad the light pipe? 6

Final Exam information

Final Exam information Fial Exam iformatio Wedesday, Jue 6, 2012, 9:30 am - 11:18 am Locatio: i recitatio room Comprehesive (covers all course material) 35 multiple-choice questios --> 175 poits Closed book ad otes Make up your

More information

Spherical Mirrors. Types of spherical mirrors. Lecture convex mirror: the. geometrical center is on the. opposite side of the mirror as

Spherical Mirrors. Types of spherical mirrors. Lecture convex mirror: the. geometrical center is on the. opposite side of the mirror as Lecture 14-1 Spherical Mirrors Types of spherical mirrors covex mirror: the geometrical ceter is o the opposite side of the mirror as the object. cocave mirror: the geometrical ceter is o the same side

More information

Lenses and imaging. MIT 2.71/ /10/01 wk2-a-1

Lenses and imaging. MIT 2.71/ /10/01 wk2-a-1 Leses ad imagig Huyges priciple ad why we eed imagig istrumets A simple imagig istrumet: the pihole camera Priciple of image formatio usig leses Quatifyig leses: paraial approimatio & matri approach Focusig

More information

Chapter 18: Ray Optics Questions & Problems

Chapter 18: Ray Optics Questions & Problems Chapter 18: Ray Optics Questios & Problems c -1 2 1 1 1 h s θr= θi 1siθ 1 = 2si θ 2 = θ c = si ( ) + = m = = v s s f h s 1 Example 18.1 At high oo, the su is almost directly above (about 2.0 o from the

More information

AP B mirrors and lenses websheet 23.2

AP B mirrors and lenses websheet 23.2 Name: Class: _ Date: _ ID: A AP B mirrors ad leses websheet 232 Multiple Choice Idetify the choice that best completes the statemet or aswers the questio 1 The of light ca chage whe light is refracted

More information

EE 584 MACHINE VISION

EE 584 MACHINE VISION METU EE 584 Lecture Notes by A.Aydi ALATAN 0 EE 584 MACHINE VISION Itroductio elatio with other areas Image Formatio & Sesig Projectios Brightess Leses Image Sesig METU EE 584 Lecture Notes by A.Aydi ALATAN

More information

Physics 11b Lecture #19

Physics 11b Lecture #19 Physics b Lecture #9 Geometrical Optics S&J Chapter 34, 35 What We Did Last Time Itesity (power/area) of EM waves is give by the Poytig vector See slide #5 of Lecture #8 for a summary EM waves are produced

More information

Lenses and Imaging (Part I)

Lenses and Imaging (Part I) Leses ad Imagig (Part I) Why is imagig ecessary: Huyge s priciple Spherical & parallel ray budles, poits at ifiity efractio at spherical surfaces (paraial approimatio) Optical power ad imagig coditio Matri

More information

Section 4. Imaging and Paraxial Optics

Section 4. Imaging and Paraxial Optics 4-1 Sectio 4 Imagig ad Paraxial Optics Optical Sstems A optical sstem is a collectio of optical elemets (leses ad mirrors). While the optical sstem ca cotai multiple optical elemets, the first order properties

More information

Apparent Depth. B' l'

Apparent Depth. B' l' REFRACTION by PLANE SURFACES Apparet Depth Suppose we have a object B i a medium of idex which is viewed from a medium of idex '. If '

More information

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation The Nature of Light Chapter Reflectio ad Refractio of Light Sectios: 5, 8 Problems: 6, 7, 4, 30, 34, 38 Particles of light are called photos Each photo has a particular eergy E = h ƒ h is Plack s costat

More information

Lenses and Imaging (Part I) Parabloid mirror: perfect focusing

Lenses and Imaging (Part I) Parabloid mirror: perfect focusing Leses ad Imagig (Part I) eview: paraboloid reflector, focusig Why is imagig ecessary: Huyges priciple Spherical & parallel ray budles, poits at ifiity efractio at spherical surfaces (paraial approimatio)

More information

Section 4. Imaging and Paraxial Optics

Section 4. Imaging and Paraxial Optics Sectio 4 Imagig ad Paraxial Optics 4- Optical Sstems A optical sstem is a collectio of optical elemets (leses ad mirrors). While the optical sstem ca cotai multiple optical elemets, the first order properties

More information

Basic Optics: Index of Refraction

Basic Optics: Index of Refraction Basic Optics: Idex of Refractio Deser materials have lower speeds of light Idex of Refractio = where c = speed of light i vacuum v = velocity i medium Eve small chages ca create differece i Higher idex

More information

Aberrations in Lens & Mirrors (Hecht 6.3)

Aberrations in Lens & Mirrors (Hecht 6.3) Aberratios i Les & Mirrors (Hecht 6.3) Aberratios are failures to focus to a "poit" Both mirrors ad les suffer from these Some are failures of paraxial assumptio 3 5 θ θ si( θ ) = θ + L 3! 5! Paraxial

More information

Lens Design II. Lecture 5: Field flattening Herbert Gross. Winter term

Lens Design II. Lecture 5: Field flattening Herbert Gross. Winter term Les Desig II Lecture 5: Field flatteig 05-8-0 Herbert Gross Witer term 05 www.iap.ui-ea.de Prelimiary Schedule 0.0. Aberratios ad optimizatio Repetitio 7.0. Structural modificatios Zero operads, les splittig,

More information

COMP 558 lecture 6 Sept. 27, 2010

COMP 558 lecture 6 Sept. 27, 2010 Radiometry We have discussed how light travels i straight lies through space. We would like to be able to talk about how bright differet light rays are. Imagie a thi cylidrical tube ad cosider the amout

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS) CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

Übungsblatt 2 Geometrische und Technische Optik WS 2012/2013

Übungsblatt 2 Geometrische und Technische Optik WS 2012/2013 Übugsblatt 2 Geometrische u Techische Optik WS 202/203 Eie icke Lise besteht aus zwei sphärische Grezfläche mit e beie Krümmugsraie R u R 2, ie eie Absta habe. Die Brechzahle vor er Lise, i er Lise u ach

More information

Vision & Perception. Simple model: simple reflectance/illumination model. image: x(n 1,n 2 )=i(n 1,n 2 )r(n 1,n 2 ) 0 < r(n 1,n 2 ) < 1

Vision & Perception. Simple model: simple reflectance/illumination model. image: x(n 1,n 2 )=i(n 1,n 2 )r(n 1,n 2 ) 0 < r(n 1,n 2 ) < 1 Visio & Perceptio Simple model: simple reflectace/illumiatio model Eye illumiatio source i( 1, 2 ) image: x( 1, 2 )=i( 1, 2 )r( 1, 2 ) reflectace term r( 1, 2 ) where 0 < i( 1, 2 ) < 0 < r( 1, 2 ) < 1

More information

Lighting and Shading. Outline. Raytracing Example. Global Illumination. Local Illumination. Radiosity Example

Lighting and Shading. Outline. Raytracing Example. Global Illumination. Local Illumination. Radiosity Example CSCI 480 Computer Graphics Lecture 9 Lightig ad Shadig Light Sources Phog Illumiatio Model Normal Vectors [Agel Ch. 6.1-6.4] February 13, 2013 Jerej Barbic Uiversity of Souther Califoria http://www-bcf.usc.edu/~jbarbic/cs480-s13/

More information

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical

More information

Lens Design II. Lecture 5: Field flattening Herbert Gross. Winter term

Lens Design II. Lecture 5: Field flattening Herbert Gross. Winter term Les Desig II Lecture 5: Field flatteig 07--3 Herbert Gross Witer term 07 www.iap.ui-ea.de Prelimiary Schedule Les Desig II 07 6.0. Aberratios ad optimizatio Repetitio 3.0. Structural modificatios Zero

More information

EVALUATION OF TRIGONOMETRIC FUNCTIONS

EVALUATION OF TRIGONOMETRIC FUNCTIONS EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special

More information

Computational Geometry

Computational Geometry Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed

More information

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4 1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:

More information

CS Polygon Scan Conversion. Slide 1

CS Polygon Scan Conversion. Slide 1 CS 112 - Polygo Sca Coversio Slide 1 Polygo Classificatio Covex All iterior agles are less tha 180 degrees Cocave Iterior agles ca be greater tha 180 degrees Degeerate polygos If all vertices are colliear

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

Normals. In OpenGL the normal vector is part of the state Set by glnormal*()

Normals. In OpenGL the normal vector is part of the state Set by glnormal*() Ray Tracig 1 Normals OpeG the ormal vector is part of the state Set by glnormal*() -glnormal3f(x, y, z); -glnormal3fv(p); Usually we wat to set the ormal to have uit legth so cosie calculatios are correct

More information

World Scientific Research Journal (WSRJ) ISSN: Research on Fresnel Lens Optical Receiving Antenna in Indoor Visible

World Scientific Research Journal (WSRJ) ISSN: Research on Fresnel Lens Optical Receiving Antenna in Indoor Visible World Scietific Research Joural (WSRJ) ISSN: 2472-3703 www.wsr-j.org Research o Fresel Les Optical Receivig Atea i Idoor Visible Light Commuicatio Zhihua Du College of Electroics Egieerig, Chogqig Uiversity

More information

Thick Lenses and the ABCD Formalism

Thick Lenses and the ABCD Formalism Thick Lenses and the ABCD Formalism Thursday, 10/12/2006 Physics 158 Peter Beyersdorf Document info 12. 1 Class Outline Properties of Thick Lenses Paraxial Ray Matrices General Imaging Systems 12. 2 Thick

More information

The number n of subintervals times the length h of subintervals gives length of interval (b-a).

The number n of subintervals times the length h of subintervals gives length of interval (b-a). Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's

More information

Lecture 2: Spectra of Graphs

Lecture 2: Spectra of Graphs Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion EECS 442 Computer visio Multiple view geometry Affie structure from Motio - Affie structure from motio problem - Algebraic methods - Factorizatio methods Readig: [HZ] Chapters: 6,4,8 [FP] Chapter: 2 Some

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

Lower Bounds for Sorting

Lower Bounds for Sorting Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to

More information

Get Solution of These Packages & Learn by Video Tutorials on GEOMETRICAL OPTICS

Get Solution of These Packages & Learn by Video Tutorials on   GEOMETRICAL OPTICS . CONDITION FOR F RECTILINEAR PROP OPAGATION OF LIGHT : (ONLY FORF INFORMA ORMATION NOTE IN JEE SYLLABUS) Some part of the optics ca be uderstood if we assume that light travels i a straight lie ad it

More information

27 Refraction, Dispersion, Internal Reflection

27 Refraction, Dispersion, Internal Reflection Chapter 7 Refractio, Dispersio, Iteral Reflectio 7 Refractio, Dispersio, Iteral Reflectio Whe we talked about thi film iterferece, we said that whe light ecouters a smooth iterface betwee two trasparet

More information

Counting Regions in the Plane and More 1

Counting Regions in the Plane and More 1 Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o

More information

Visualization of Gauss-Bonnet Theorem

Visualization of Gauss-Bonnet Theorem Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000. 5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator

More information

A Taste of Maya. Character Setup

A Taste of Maya. Character Setup This tutorial goes through the steps to add aimatio cotrols to a previously modeled character. The character i the scee below is wearig clothes made with Cloth ad the sceery has bee created with Pait Effects.

More information

APPLICATION OF THE NIST 18 TERM ERROR MODEL TO CYLINDRICAL NEAR-FIELD ANTENNA MEASUREMENTS

APPLICATION OF THE NIST 18 TERM ERROR MODEL TO CYLINDRICAL NEAR-FIELD ANTENNA MEASUREMENTS PPLICTION OF THE NIST 18 TERM ERROR MODEL TO CYLINDRICL NER-FIELD NTENN MESUREMENTS lle C. Newell*, David Lee** *Nearfield Systems Ic. 133 East 3 rd St., Bldg. 54 Carso, C 9745 **David Florida Laboratory,

More information

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein 068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig

More information

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion EECS 442 Computer visio Multiple view geometry Affie structure from Motio - Affie structure from motio problem - Algebraic methods - Factorizatio methods Readig: [HZ] Chapters: 6,4,8 [FP] Chapter: 2 Some

More information

Light and shading. Source: A. Efros

Light and shading. Source: A. Efros Light ad shadig Source: A. Efros Image formatio What determies the brightess of a image piel? Sesor characteristics Light source properties Eposure Surface shape ad orietatio Optics Surface reflectace

More information

Optimal Mapped Mesh on the Circle

Optimal Mapped Mesh on the Circle Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad

More information

Lecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV

Lecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV Lecture 7 7 Refractio ad Sell s Law Readig Assigmet: Read Kipis Chapter 4 Refractio of Light, Sectio III, IV 7. History I Eglish-speakig coutries, the law of refractio is kow as Sell s Law, after the Dutch

More information

Chapter 7: Geometrical Optics

Chapter 7: Geometrical Optics Chapter 7: Geometrical Optics 7. Reflection at a Spherical Surface L.O 7.. State laws of reflection Laws of reflection state: L.O The incident ray, the reflected ray and the normal all lie in the same

More information

Parametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015

Parametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015 Readig Required: Agel 0.-0.3, 0.5., 0.6-0.7, 0.9 Parametric curves Bria Curless CSE 457 Sprig 05 Optioal Bartels, Beatty, ad Barsy. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig,

More information

Paraxial into real surfaces

Paraxial into real surfaces Paraxial into real surfaces Curvature, Radius Power lens and mirrors lens maker equation mirror and lens in contact Principle planes Real Surfaces Refractive via Fermat s Principle Calculate optical path

More information

Computer Graphics Hardware An Overview

Computer Graphics Hardware An Overview Computer Graphics Hardware A Overview Graphics System Moitor Iput devices CPU/Memory GPU Raster Graphics System Raster: A array of picture elemets Based o raster-sca TV techology The scree (ad a picture)

More information

Chapter 7: Geometrical Optics. The branch of physics which studies the properties of light using the ray model of light.

Chapter 7: Geometrical Optics. The branch of physics which studies the properties of light using the ray model of light. Chapter 7: Geometrical Optics The branch of physics which studies the properties of light using the ray model of light. Overview Geometrical Optics Spherical Mirror Refraction Thin Lens f u v r and f 2

More information

The Platonic solids The five regular polyhedra

The Platonic solids The five regular polyhedra The Platoic solids The five regular polyhedra Ole Witt-Hase jauary 7 www.olewitthase.dk Cotets. Polygos.... Topologically cosideratios.... Euler s polyhedro theorem.... Regular ets o a sphere.... The dihedral

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

Homework 1 Solutions MA 522 Fall 2017

Homework 1 Solutions MA 522 Fall 2017 Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear

More information

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio

More information

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

Thompson s Group F (p + 1) is not Minimally Almost Convex

Thompson s Group F (p + 1) is not Minimally Almost Convex Thompso s Group F (p + ) is ot Miimally Almost Covex Claire Wladis Thompso s Group F (p + ). A Descriptio of F (p + ) Thompso s group F (p + ) ca be defied as the group of piecewiseliear orietatio-preservig

More information

PH880 Topics in Physics

PH880 Topics in Physics PH880 Topics in Physics Modern Optical Imaging (Fall 2010) The minimum path principle n(x,y,z) Γ Γ has the minimum optical path length, compared to the alternative paths. nxyzdl (,, ) Γ Thelaw of reflection

More information

How do we evaluate algorithms?

How do we evaluate algorithms? F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:

More information

1 Graph Sparsfication

1 Graph Sparsfication CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider

More information

Computer Graphics. Shading. Page. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science, Technion. The Physics

Computer Graphics. Shading. Page. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science, Technion. The Physics Comuter Grahics Illumiatio Models & The Physics 2 Local vs. Global Illumiatio Models Examle Local model direct ad local iteractio of each object with the light. Ambiet Diffuse Global model: iteractios

More information

Optics Course (Phys 311) Geometrical Optics Refraction through Lenses

Optics Course (Phys 311) Geometrical Optics Refraction through Lenses Optics Course (Phys ) Geometrical Optics Refraction through Lenses Lecturer: Dr Zeina Hashim Slide 1 Objectives covered in this lesson : 1. Refraction through single spherical refracting surfaces. 2. Lenses:

More information

Field Guide to. Geometrical Optics. John E. Greivenkamp. University of Arizona. SPIE Field Guides Volume FG01. John E. Greivenkamp, Series Editor

Field Guide to. Geometrical Optics. John E. Greivenkamp. University of Arizona. SPIE Field Guides Volume FG01. John E. Greivenkamp, Series Editor Field Guide to Geometrical Optics Joh E. Greivekamp Uiversity of Arizoa SPIE Field Guides Volume FG01 Joh E. Greivekamp, Series Editor Belligham, Washigto USA Library of Cogress Catalogig-i-Publicatio

More information

Panel Methods : Mini-Lecture. David Willis

Panel Methods : Mini-Lecture. David Willis Pael Methods : Mii-Lecture David Willis 3D - Pael Method Examples Other Applicatios of Pael Methods http://www.flowsol.co.uk/ http://oe.mit.edu/flowlab/ Boudary Elemet Methods Pael methods belog to a broader

More information

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 ) EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders

More information

EE123 Digital Signal Processing

EE123 Digital Signal Processing Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add

More information

Fast Fourier Transform (FFT) Algorithms

Fast Fourier Transform (FFT) Algorithms Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform

More information

Assignment 5; Due Friday, February 10

Assignment 5; Due Friday, February 10 Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors

More information

EE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control

EE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,

More information

1. Sketch a concave polygon and explain why it is both concave and a polygon. A polygon is a simple closed curve that is the union of line segments.

1. Sketch a concave polygon and explain why it is both concave and a polygon. A polygon is a simple closed curve that is the union of line segments. SOLUTIONS MATH / Fial Review Questios, F5. Sketch a cocave polygo ad explai why it is both cocave ad a polygo. A polygo is a simple closed curve that is the uio of lie segmets. A polygo is cocave if it

More information

Matrix representation of a solution of a combinatorial problem of the group theory

Matrix representation of a solution of a combinatorial problem of the group theory Matrix represetatio of a solutio of a combiatorial problem of the group theory Krasimir Yordzhev, Lilyaa Totia Faculty of Mathematics ad Natural Scieces South-West Uiversity 66 Iva Mihailov Str, 2700 Blagoevgrad,

More information

prerequisites: 6.046, 6.041/2, ability to do proofs Randomized algorithms: make random choices during run. Main benefits:

prerequisites: 6.046, 6.041/2, ability to do proofs Randomized algorithms: make random choices during run. Main benefits: Itro Admiistrivia. Sigup sheet. prerequisites: 6.046, 6.041/2, ability to do proofs homework weekly (first ext week) collaboratio idepedet homeworks gradig requiremet term project books. questio: scribig?

More information

Force Network Analysis using Complementary Energy

Force Network Analysis using Complementary Energy orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Propagation of light: rays versus wave fronts; geometrical and physical optics

Propagation of light: rays versus wave fronts; geometrical and physical optics Propagatio of light: rays versus wave frots; geometrical ad physical optics A ray is a imagiary lie alog the directio of propagatio of the light wave: this lie is perpedicular to the wave frot If descriptio

More information

CSE 417: Algorithms and Computational Complexity

CSE 417: Algorithms and Computational Complexity Time CSE 47: Algorithms ad Computatioal Readig assigmet Read Chapter of The ALGORITHM Desig Maual Aalysis & Sortig Autum 00 Paul Beame aalysis Problem size Worst-case complexity: max # steps algorithm

More information

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3

More information

Lecture 5. Counting Sort / Radix Sort

Lecture 5. Counting Sort / Radix Sort Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

Mathematics and Art Activity - Basic Plane Tessellation with GeoGebra

Mathematics and Art Activity - Basic Plane Tessellation with GeoGebra 1 Mathematics ad Art Activity - Basic Plae Tessellatio with GeoGebra Worksheet: Explorig Regular Edge-Edge Tessellatios of the Cartesia Plae ad the Mathematics behid it. Goal: To eable Maths educators

More information

Project 2.5 Improved Euler Implementation

Project 2.5 Improved Euler Implementation Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

Refraction at a single curved spherical surface

Refraction at a single curved spherical surface Refraction at a single curved spherical surface This is the beginning of a sequence of classes which will introduce simple and complex lens systems We will start with some terminology which will become

More information

Mathematical Stat I: solutions of homework 1

Mathematical Stat I: solutions of homework 1 Mathematical Stat I: solutios of homework Name: Studet Id N:. Suppose we tur over cards simultaeously from two well shuffled decks of ordiary playig cards. We say we obtai a exact match o a particular

More information

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

Intro to Scientific Computing: Solutions

Intro to Scientific Computing: Solutions Itro to Scietific Computig: Solutios Dr. David M. Goulet. How may steps does it take to separate 3 objects ito groups of 4? We start with 5 objects ad apply 3 steps of the algorithm to reduce the pile

More information

COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design

COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad

More information

Lecture # 09: Flow visualization techniques: schlieren and shadowgraphy

Lecture # 09: Flow visualization techniques: schlieren and shadowgraphy AerE 344 Lecture Notes Lecture # 9: Flow visualizatio techiques: schliere ad shadowgraph Dr. Hui Hu Dr. Re M Waldma Departmet of Aerospace Egieerig owa State Uiversit Ames, owa 5, U.S.A Sources/ Further

More information

Leica Lino Accurate, self-levelling point and line lasers

Leica Lino Accurate, self-levelling point and line lasers Leica Lio Accurate, self-levellig poit ad lie lasers Setup, Switch o, Ready! With the Leica Lio everythig is plumb ad perfectly aliged Leica Lios project lies or poits to millimeter accuracy, leavig your

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

General Physics II. Mirrors & Lenses

General Physics II. Mirrors & Lenses General Physics II Mirrors & Lenses Nothing New! For the next several lectures we will be studying geometrical optics. You already know the fundamentals of what is going on!!! Reflection: θ 1 = θ r incident

More information