Texture Mapping. Jian Huang. This set of slides references the ones used at Ohio State for instruction.

Size: px
Start display at page:

Download "Texture Mapping. Jian Huang. This set of slides references the ones used at Ohio State for instruction."

Transcription

1 Texture Mappig Jia Huag This set of slides refereces the oes used at Ohio State for istructio.

2 Ca you do this

3 What Dreams May Come

4 Texture Mappig Of course, oe ca model the exact micro-geometry + material property to cotrol the look ad feel of a surface But, it may get extremely costly So, graphics use a more practical approach texture mappig

5 Texture Mappig Particles ad fractals gave us lots of detail iformatio ot easy to model mathematically ad computatioally challegig

6 Texture Mappig (Sophisticated) Illumiatio models gave us photo -realistic lookig surfaces ot easy to model mathematically ad computatioally challegig Phog illumiatio/shadig easy to model relatively quick to compute oly gives us dull surfaces

7 Texture Mappig Surfaces i the wild are very complex Caot model all the fie variatios We eed to fid ways to add surface detail How?

8 Texture Mappig Solutio - (its really a cheat!!) MAP surface detail from a predefied multi-dimesioal table ( texture ) to a simple polygo How?

9 Textures Make A Differece Good textures, whe applied correctly, make a world of differece!

10 A Texture ca be? F(u,v) ==> a cotiuous or discrete fuctio of: { R(u,v), G(u,v), B(u,v) } { I(u,v) } { idex(u,v) } { alpha(u,v) } (trasparecy) { ormals(u,v) } (bump map) { surface_height(u,v) } (displacemet map) Specular color (eviromet map)

11 The Geeralized Pipelie The geeralized pipelie of texture mappig Compute obj space locatio Use proj fuc to fid (u,v) Use corre fuc to fid texel Apply value trasform fuc Modify equatio or fragmet color Fragmet: after rasterizatio, the data are ot pixels yet, but are fragmets. Each fragmet has coordiate, color, depth, ad udergo a series of tests ad ops before showig up i the framebuffer

12 Texture Mappig Problem #1 Fittig a square peg i a roud hole We deal with o-liear trasformatios Which parts map where?

13 Iverse Mappig Need to trasform back to obj/world space to do the iterpolatio Orietatio i 3D image space (.5,1) (.8,1) (.5,.7) (.1,.6) (.6,.2) Foreshorteig

14 Texture Mappig Problem #2 Mappig from a pixel to a texel Aliasig is a huge problem!

15 Mappig to A Texel? Basically map to a image Need to iterpolate Same as. How ca I fid a appropriate value for a arbitrary (ot ecessarily iteger) idex? How would I rotate a image 45 degrees? How would I traslate it 0.5 pixels?

16 Iterpolatio Nearest eighbor Liear Iterpolatio

17 How do we get F(u,v)? We are give a discrete set of values: F[i,j] for i=0,,n, j=0,,m Nearest eighbor: F(u,v) = F[ roud(n*u), roud(m*v) ] Liear Iterpolatio: i = floor(n*u), j = floor(m*v) iterpolate from F[i,j], F[i+1,j], F[i,j+1], F[i+1,j+1] Filterig i geeral!

18 How do we get F(u,v)? Higher-order iterpolatio F(u,v) = å i å j F[i,j] h(u,v) h(u,v) is called the recostructio kerel Gaussia Sic fuctio splies Like liear iterpolatio, eed to fid eighbors. Usually four to sixtee

19 Texture ad Texel Each pixel i a texture map is called a Texel Each Texel is associated with a (u,v) 2D texture coordiate The rage of u, v is [0.0,1.0]

20 (u,v) tuple For ay (u,v) i the rage of (0-1, 0-1), we ca fid the correspodig value i the texture usig some iterpolatio

21 The Projector Fuctio 1. Model the mappig: (x,y,z) -> (u,v) 2. Do the mappig

22 Image space sca For each y /* sca-lie */ For each x /* pixel o sca-lie */ compute u(x,y) ad v(x,y) copy texture(u,v) to image(x,y) Samples the warped texture at the appropriate image pixels. iverse mappig

23 Image space sca Problems: Fidig the iverse mappig Use oe of the aalytical mappigs Bi-liear or triagle iverse mappig May miss parts of the texture map Image Texture

24 Texture Parameterizatio Defiitio: The process of assigig texture coordiates or a texture mappig to a object. The mappig ca be applied: Per-pixel Per-vertex

25 Iterpolatio Cocepts T is texture Fid textures at vertices first! t 1 y s T a T p T b P 1 1-t 1 s 1-s t 2 1-t 2 P 3 P 2

26 Quads? P 3 P 4 P 2 y s t a t p t b P 1 Biliear Iterpolatio of Depth Values

27 Texture space sca For each v For each u compute x(u,v) ad y(u,v) copy texture(u,v) to image(x,y) Places each texture sample to the mapped image pixel. Forward mappig

28 Texture space sca Problems: May ot fill image Forward mappig eeded Texture Image

29 Simple Projector Fuctios Spherical Cylidrical Plaar For some model, a sigle projector fuctio suffices. But very ofte, a artist may choose to subdivide each object ito parts that use differet projector

30 Plaar Mappig to a 3D Plae Simple Affie trasformatio rotate scale y v traslate z x u

31 Cylidrical Mappig to a Cylider Rotate, traslate ad scale i the uv-plae u -> q v -> z x = r cos(q), y = r si(q) v u

32 Spherical Mappig to Sphere Impossible!!!! Severe distortio at the poles u -> q v -> f x = r si(q) cos(f) y = r si(q) si(f) z = r cos(q)

33 Two-pass Mappig Idea by Bier ad Sloa S: map from texture space to itermediate space O: map from itermediate space to object space

34 Two-pass Mappig Map texture to itermediate: Plae Cylider Sphere Box Map object to same. v u u-axis

35 Texture Mappig O mappig: reflected ray (eviromet map) object ormal object cetroid itermediate surface ormal (ISN) that makes 16 combiatios oly 5 were foud useful

36 Texture Mappig Cylider/ISN (shrikwrap) Works well for solids of revolutio Plae/ISN (projector) Works well for plaar objects Box/ISN Sphere/Cetroid Box/Cetroid Works well for roughly spherical shapes

37 Texture Parameterizatio What is this ISN? Itermediate surface ormal. Needed to hadle cocave objects properly. Sudde flip i texture coordiates whe the object crosses the axis.

38 Texture Parameterizatio Flip directio of vector such that it poits i the same half-space as the outward surface ormal.

39 Texture Parameterizatio Plae/ISN

40 Texture Parameterizatio Plae/ISN Draw vector from poit (vertex or object space pixel poit) i the directio of the texture plae. The vector will itersect the plae at some poit depedig o the coordiate system

41 Texture Parameterizatio Plae/ISN Resembles a slide projector Distortios o surfaces perpedicular to the plae.

42 Texture Parameterizatio Cylider/ISN Distortios o horizotal plaes Draw vector from poit to cylider Vector coects poit to cylider axis

43 Texture Parameterizatio Sphere/ISN Small distortio everywhere. Draw vector from sphere ceter through poit o the surface ad itersect it with the sphere.

44 Iterpolatig Without Explicit Iverse Trasform Sca-coversio ad color/z/ormal iterpolatio take place i scree space, but really, what space should it be i? What about texture coordiates? Do it i clip space, or homogeous coordiates

45 I Clip space Two ed poits of a lie segmet (sca lie) Iterpolate for a poit Q i-betwee

46 I Scree Space From the two ed poits of a lie segmet (sca lie), iterpolate for a poit Q i-betwee: Where: Easy to show: i most occasios, t ad t s are differet

47 From t s to t Chage of variable: choose a ad b such that 1 t s = a/(a + b), t s = b/(a + b) A ad B such that (1 t)= A/(A + B), t = B/(A + B). Easy to get Easy to verify: A = aw 2 ad B = bw 1 is a solutio

48 Texture Coordiates All such iterpolatio happes i homogeeous space. Use A ad B to liearly iterpolate texture coordiates The homogeeous texture coordiate is: (u,v,1)

49 Homogeeous Texture Coordiates u l = A/(A+B) u 1l + B/(A+B)u l 2 w l = A/(A+B) w 1l + B/(A+B)w l 2 = 1 u = u l /w l = u l = (Au 1l + Bu 2l )/(A + B) u = (au 1l + Bu 2l )/(A + B) u = (au 1l /w 1l + bu 2l /w 2l )/(a 1 /w 1l + b 1 /w 2l )

50 Homogeeous Texture Coordiates The homogeeous texture coordiates suitable for liear iterpolatio i scree space is computed simply by Dividig the texture coordiates by scree w Liearly iterpolatig (u/w,v/w,1/w) Dividig the quatities u/w ad v/w by 1/w at each pixel to recover the texture coordiates

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

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

Parabolic Path to a Best Best-Fit Line:

Parabolic Path to a Best Best-Fit Line: Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be

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

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

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

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

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

Orientation. Orientation 10/28/15

Orientation. Orientation 10/28/15 Orietatio Orietatio We will defie orietatio to mea a object s istataeous rotatioal cofiguratio Thik of it as the rotatioal equivalet of positio 1 Represetig Positios Cartesia coordiates (x,y,z) are a easy

More information

Computer Graphics. Surface Rendering Methods. Content. Polygonal rendering. Global rendering. November 14, 2005

Computer Graphics. Surface Rendering Methods. Content. Polygonal rendering. Global rendering. November 14, 2005 Computer Graphics urface Rederig Methods November 4, 2005 Cotet Polygoal rederig flat shadig Gouraud shadig Phog shadig Global rederig ray tracig radiosity Polygoal Rederig hadig a polygoal mesh flat or

More information

Assigning colour to pixels or fragments. Modelling Illumination. We shall see how it is done in a rasterization model. CS475/CS675 - Lecture 14

Assigning colour to pixels or fragments. Modelling Illumination. We shall see how it is done in a rasterization model. CS475/CS675 - Lecture 14 - Computer Graphics Assigig colour to pixels or fragmets. Modellig Illumiatio Illumiatio Model : The Phog Model For a sigle light source total illumiatio at ay poit is give by: ecture 14: I =k a I a k

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

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

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

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

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

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

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

Math 10C Long Range Plans

Math 10C Long Range Plans Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will

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

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

Reading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9.

Reading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9. Readig Required: Agel.-.3,.5.,.6-.7,.9. Optioal Parametric curves Bartels, Beatty, ad Barsky. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig, 987. Fari. Curves ad Surfaces for

More information

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5.

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5. Morga Kaufma Publishers 26 February, 208 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Virtual Memory Review: The Memory Hierarchy Take advatage of the priciple

More information

Arithmetic Sequences

Arithmetic Sequences . Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered

More information

South Slave Divisional Education Council. Math 10C

South Slave Divisional Education Council. Math 10C South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve

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

Convex hull ( 凸殻 ) property

Convex hull ( 凸殻 ) property Covex hull ( 凸殻 ) property The covex hull of a set of poits S i dimesios is the itersectio of all covex sets cotaiig S. For N poits P,..., P N, the covex hull C is the give by the expressio The covex hull

More information

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit

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

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

Two View Geometry Part 2 Fundamental Matrix Computation

Two View Geometry Part 2 Fundamental Matrix Computation 3D Computer Visio II Two View Geometr Part Fudametal Matri Computatio Nassir Navab based o a course give at UNC b Marc Pollefes & the book Multiple View Geometr b Hartle & Zisserma November 9, 009 Outlie

More information

Image Segmentation EEE 508

Image Segmentation EEE 508 Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.

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

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting) MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give

More information

OCR Statistics 1. Working with data. Section 3: Measures of spread

OCR Statistics 1. Working with data. Section 3: Measures of spread Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.

More information

CMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago

CMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems

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

Graphics (Output) Primitives. Chapters 3 & 4

Graphics (Output) Primitives. Chapters 3 & 4 Graphics (Output) Primitives Chapters 3 & 4 Graphic Output ad Iput Pipelie Sca coversio coverts primitives such as lies, circles, etc. ito pixel values geometric descriptio Þ a fiite scee area Clippig

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

Wavelet Transform. CSE 490 G Introduction to Data Compression Winter Wavelet Transformed Barbara (Enhanced) Wavelet Transformed Barbara (Actual)

Wavelet Transform. CSE 490 G Introduction to Data Compression Winter Wavelet Transformed Barbara (Enhanced) Wavelet Transformed Barbara (Actual) Wavelet Trasform CSE 49 G Itroductio to Data Compressio Witer 6 Wavelet Trasform Codig PACW Wavelet Trasform A family of atios that filters the data ito low resolutio data plus detail data high pass filter

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

Overview Chapter 12 A display model

Overview Chapter 12 A display model Overview Chapter 12 A display model Why graphics? A graphics model Examples Bjare Stroustrup www.stroustrup.com/programmig 3 Why bother with graphics ad GUI? Why bother with graphics ad GUI? It s very

More information

Projection Transformations. and

Projection Transformations. and 3D Viewig Projectio Trasormatios a Viewig i Pipelie Implemetatio o 3D Viewig 3-D worl cooriate output primitives Apply ormalizig i trasormatio Clip agaist caoical View Volume 2D evice cooriates Trasorm

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

Derivation of perspective stereo projection matrices with depth, shape and magnification consideration

Derivation of perspective stereo projection matrices with depth, shape and magnification consideration Derivatio of perspective stereo projectio matrices with depth, shape ad magificatio cosideratio Patrick Oberthür Jauary 2014 This essay will show how to costruct a pair of stereoscopic perspective projectio

More information

Diego Nehab. n A Transformation For Extracting New Descriptors of Shape. n Locus of points equidistant from contour

Diego Nehab. n A Transformation For Extracting New Descriptors of Shape. n Locus of points equidistant from contour Diego Nehab A Trasformatio For Extractig New Descriptors of Shape Locus of poits equidistat from cotour Medial Axis Symmetric Axis Skeleto Shock Graph Shaked 96 1 Shape matchig Aimatio Dimesio reductio

More information

Extended Space Mapping with Bézier Patches and Volumes

Extended Space Mapping with Bézier Patches and Volumes Eteded Space Mappig with Béier Patches ad Volumes Bejami Schmitt 1, 2 Aleader Pasko 1 Vladimir Savcheko 1 Abstract We eplore a geeral eteded space mappig as a framework for trasformig a hypersurface i

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

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

Designing a learning system

Designing a learning system CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try

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

Using the Keyboard. Using the Wireless Keyboard. > Using the Keyboard

Using the Keyboard. Using the Wireless Keyboard. > Using the Keyboard 1 A wireless keyboard is supplied with your computer. The wireless keyboard uses a stadard key arragemet with additioal keys that perform specific fuctios. Usig the Wireless Keyboard Two AA alkalie batteries

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

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

Texture Mapping. Introduction to Computer Graphics Torsten Möller. Machiraju/Zhang/Möller

Texture Mapping. Introduction to Computer Graphics Torsten Möller. Machiraju/Zhang/Möller Texture Mapping Introduction to Computer Graphics Torsten Möller 1 Reading Angel - Chapter 7.4-7.10, 9.9 and 11.8 Hughes, van Dam: Chapter 20 (+17) Shirley+Marshner: Chapter 11 2 Overview What is texture

More information

Consider the following population data for the state of California. Year Population

Consider the following population data for the state of California. Year Population Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB

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

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

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

Learning to Shoot a Goal Lecture 8: Learning Models and Skills

Learning to Shoot a Goal Lecture 8: Learning Models and Skills Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.

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

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

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

Lecture 24: Bezier Curves and Surfaces. thou shalt be near unto me Genesis 45:10

Lecture 24: Bezier Curves and Surfaces. thou shalt be near unto me Genesis 45:10 Lecture 24: Bezier Curves ad Surfaces thou shalt be ear uto me Geesis 45:0. Iterpolatio ad Approximatio Freeform curves ad surfaces are smooth shapes ofte describig ma-made objects. The hood of a car,

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

A Very Simple Approach for 3-D to 2-D Mapping

A Very Simple Approach for 3-D to 2-D Mapping A Very Simple Approach for -D to -D appig Sadipa Dey (1 Ajith Abraham ( Sugata Sayal ( Sadipa Dey (1 Ashi Software Private Limited INFINITY Tower II 10 th Floor Plot No. - 4. Block GP Salt Lake Electroics

More information

Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS

Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS 28 Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS Tolerace sythesis deals with the allocatio of tolerace values to various dimesios of idividual compoets

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

Why Do We Care About Lighting? Computer Graphics Lighting. The Surface Normal. Flat Shading (Per-face) Setting a Surface Normal in OpenGL

Why Do We Care About Lighting? Computer Graphics Lighting. The Surface Normal. Flat Shading (Per-face) Setting a Surface Normal in OpenGL Lightig Why Do We Care About Lightig? Lightig dis-ambiguates 3D scees This work is licesed uder a Creative Commos Attributio-NoCommercial- NoDerivatives 4.0 Iteratioal Licese Mike Bailey mjb@cs.oregostate.edu

More information

Math Section 2.2 Polynomial Functions

Math Section 2.2 Polynomial Functions Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably

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 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

Single-view Metrology and Camera Calibration

Single-view Metrology and Camera Calibration Sigle-iew Metrology ad Caera Calibratio Coputer Visio Jia-Bi Huag, Virgiia Tech May slides fro S. Seitz ad D. Hoie Adiistratie stuffs HW 2 due :59 PM o Oct 3 rd HW 2 copetitio o shape aliget Subit your

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

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

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

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

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com)

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com) wwwtheopguptacom wwwimathematiciacom For all the Math-Gya Buy books by OP Gupta A Compilatio By : OP Gupta (WhatsApp @ +9-9650 350 0) For more stuffs o Maths, please visit : wwwtheopguptacom Time Allowed

More information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

The Graphs of Polynomial Functions

The Graphs of Polynomial Functions Sectio 4.3 The Graphs of Polyomial Fuctios Objective 1: Uderstadig the Defiitio of a Polyomial Fuctio Defiitio Polyomial Fuctio 1 2 The fuctio ax a 1x a 2x a1x a0 is a polyomial fuctio of degree where

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

GRADIENT DESCENT. Admin 10/24/13. Assignment 5. David Kauchak CS 451 Fall 2013

GRADIENT DESCENT. Admin 10/24/13. Assignment 5. David Kauchak CS 451 Fall 2013 Adi Assiget 5 GRADIENT DESCENT David Kauchak CS 451 Fall 2013 Math backgroud Liear odels A strog high-bias assuptio is liear separability: i 2 diesios, ca separate classes by a lie i higher diesios, eed

More information

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD) FINIT DIFFRNC TIM DOMAIN MTOD (FDTD) The FDTD method, proposed b Yee, 1966, is aother umerical method, used widel for the solutio of M problems. It is used to solve ope-regio scatterig, radiatio, diffusio,

More information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

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

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence? 6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.

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

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

Reading. Subdivision curves and surfaces. Subdivision curves. Chaikin s algorithm. Recommended:

Reading. Subdivision curves and surfaces. Subdivision curves. Chaikin s algorithm. Recommended: Readig Recommeded: Stollitz, DeRose, ad Salesi. Wavelets for Computer Graphics: Theory ad Applicatios, 996, sectio 6.-6.3, 0., A.5. Subdivisio curves ad surfaces Note: there is a error i Stollitz, et al.,

More information

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters. SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that

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

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

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

Single-view Metrology and Camera Calibration

Single-view Metrology and Camera Calibration Sigle-iew Metrology ad Caera Calibratio Coputer Visio Jia-Bi Huag, Virgiia Tech May slides fro S. Seitz ad D. Hoie Adiistratie stuffs HW 2 due :59 PM o Oct 9 th Ask/discuss questios o Piazza Office hour

More information

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

. Perform a geometric (ray-optics) construction (i.e., draw in the rays on the diagram) to show where the final image is formed. MASSACHUSETTS INSTITUTE of TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece 6.161 Moder Optics Project Laboratory 6.637 Optical Sigals, Devices & Systems Problem Set No. 1 Geometric optics

More information

CS 111: Program Design I Lecture 21: Network Analysis. Robert H. Sloan & Richard Warner University of Illinois at Chicago April 10, 2018

CS 111: Program Design I Lecture 21: Network Analysis. Robert H. Sloan & Richard Warner University of Illinois at Chicago April 10, 2018 CS 111: Program Desig I Lecture 21: Network Aalysis Robert H. Sloa & Richard Warer Uiversity of Illiois at Chicago April 10, 2018 NETWORK ANALYSIS Which displays a graph i the sese of graph/etwork aalysis?

More information

Structure from motion

Structure from motion Structure from motio Digital Visual Effects Yug-Yu Chuag with slides by Richard Szeliski, Steve Seitz, Zhegyou Zhag ad Marc Pollefyes Outlie Epipolar geometry ad fudametal matrix Structure from motio Factorizatio

More information

Area As A Limit & Sigma Notation

Area As A Limit & Sigma Notation Area As A Limit & Sigma Notatio SUGGESTED REFERENCE MATERIAL: As you work through the problems listed below, you should referece Chapter 5.4 of the recommeded textbook (or the equivalet chapter i your

More information

Rendering. Ray Tracing

Rendering. Ray Tracing CS475m - Compter Graphics Lectre 16 : 1 Rederig Drawig images o the compter scree. We hae see oe rederig method already. Isses: Visibility What parts of a scee are isible? Clippig Cllig (Backface ad Occlsio)

More information