CAMERA-BASED CALIBRATION OF MULTIPLE LASER PROJECTORS FOR COLLABORATIVE PROJECTION

Size: px
Start display at page:

Download "CAMERA-BASED CALIBRATION OF MULTIPLE LASER PROJECTORS FOR COLLABORATIVE PROJECTION"

Transcription

1 CAMERA-BASED CALIBRATION OF MULTIPLE LASER PROJECTORS FOR COLLABORATIVE PROJECTION MENENDEZ Francisco J., HALABI Osama, FUJIMOTO Tadahiro, CHIBA Norishige Department of Computer Science Graduate School of Engineering Iwate Universit [ohalabi fujimoto ABSTRACT In this paper we propose a method to automaticall calibrate and combine multiple laser projectors for collaborative projection. One of the main caveats of toda s laser projectors is the relationship between the speed in which the galvanometers can move and the complexit of the data we are tring to displa. As image complexit grows, we are forced to increase the scanning speed in order to avoid flickering. However, the inertia effect of the rotating mirrors, which manifests as curved deformations in sharp angles, becomes more evident as we force the speeds up. To improve the wa these projectors behave, we propose combining two or more projectors to displa one single image. In this wa, the amount of lines that can be drawn without flickering would increase, without forcing the galvanometers to move at greater speeds or jumping greater angles. Furthermore, to obtain an accurate calibration, we use a digital camera to capture the drawing area of each singular projector and produce the necessar transformations to allow for a full overlap of these areas. 1. INTRODUCTION Using laser light to construct shapes and images is hardl new, however, it has not been until recentl that laser displa technolog has become relativel cheaper and more available. The growing availabilit of this technolog opens a new door for Computer Graphics researchers, as laser projectors have their ver own characteristics that separate them from raster displa and even other vector-based devices. Some of the particular problems associated with laser projection deal mainl with the limitations imposed b the hardware itself. To understand these problems we must first understand how a laser projector works. A laser projection sstem is basicall comprised of three basic parts: 1) A computer or some other electronic source that generates signals that control the projector. 2) A hardware interface that serves as a communication bridge between the computer and the projector. Depending on the technolog, this interface ma exist in the computer as a connected board, inside the projector, as part of its hardware; or as a third, separated component (e.g.: a network-based interface). 3) The projector itself, that usuall consists of one laser beam (three beams in the case of RGB projectors), and a couple of high-speed scanners (mirrors attached to their corresponding galvanometers), that rotate according to the signals sent b the computer, in order to make the laser beam move and displa the desired images. Some of the problems derive from the phsical nature of the method used to move the beam. Limitations in rotation speed lead to problems related with image complexit and flickering. The weight of the mirrors and its inherent rotational inertia causes deformations when drawing sharp angles. Some other problems are directl related with direct ee exposure to the beam. Safet measure should be taken regarding where to place the projector and selecting the appropriate laser power for each occasion. In this paper we aim to solve two of these problems. To keep the beams awa from the audience, we must sometimes place the projector in a position that does not guarantee a correct projection. With the help of a camera, we will show how to overcome this problem. Later on, we will extend this method to combine multiple projectors to increase the refresh rate, and reduce flickering. 1.1 Previous Work There is some previous work regarding projector calibration [BRO05] [RAS98], studing the alignment of various raster projectors, in order to increase the displa area. While our objective is to create a single, collaborative projection area (instead of increasing the size), some basic concepts are similar (such as the use of grids and cameras to calibrate). Also, in our case, the correct alignment of the projection areas is critical, since even the smallest differences can become quite evident. Furthermore, an attempt to reduce flickering was proposed b Abderim et al. [ABD07], b removing unnecessar

2 jumps (blanking lines) as much as possible. In this paper we will not consider the blanking lines problem, but a combination of both methods would theoreticall allow creating more complex imager without the undesired flickering effect that usuall follows. 2. SINGLE PROJECTOR CALIBRATION In a previous work [MEN07] we discussed the need for a simple and efficient wa to displa images regardless of the location of the projector. This was because of the concerns that rose regarding the possibilit of direct ee exposure to the laser beams. As we will explain later, we first need to calibrate each of the involved projectors individuall using the this method, before we can proceed to the multiple-projector calibration. This method uses a camera, placed where the audience would be, and automaticall captures the deformations caused b the projection angle and the irregularities in projection surface, processes the data and creates a calibration grid used to interpolate the coordinates before displaing Capture and image processing To detect the deformations caused b the angle between the projector and the projection surface, as well as its irregularities, we project a pre-defined grid on the surface and then calculate the difference between what we project and what we obtain. In order to recognize the projected grid from the surface, we must first take a picture of the surface without anthing projected on it. Since we want this process to be full automatic, we take advantage of a common feature of most late digital cameras called PTP (Picture Transfer Protocol) [ISO05]. This protocol is what allows cameras to directl send images to inkjet printers to produce prints without the need of a computer. Surprisingl, this protocol also allows for more than just data transfer, but to control man of the camera functions, including taking snapshots. (a) Figure 1: (a) Ideal grid and (b) resulting projection The next step is to detect the grid from the images. To do so, we calculate the difference between the first and second images, using equation (1), where diffimg(x,) will store the color difference of the pixels from imgbase(x,), base image and, imggrid(x,) projected grid, at the x- coordinate, thus removing the background and leaving onl the dots from the projected grid. diffimg( x, ) = max( imgbase( x, ) imggrid ( x, ), 0) (1) This difference image might have some noise product of changes in luminosit or undesired beam reflections. To eliminate these noises, we binarize the difference image, changing the threshold according to the number of dots found, versus the number of dots expected. In other words, if we find more dots than we expect, it is reasonable to suppose those extra dots are caused b noise and then we raise the threshold to filter that noise. This is shown in equation (2), where diffbin(x,) will hold the binar pixels and we use the threshold θ to filter noise. A result of this binarization is shown in figure 2 1 if diffimg( x, ) > θ diffbin( x, ) 0 otherwise (b) (2) Once we have placed the camera where our audience would be, it should not be moved until the calibration process is complete. Using PTP, the computer communicates with the camera and commands it to take the necessar images at the appropriate times, thus eliminating an possible errors caused b pressing the shutter button manuall. After we have taken the first picture of our projection screen, we proceed to take a second picture with a dot grid pattern projected. For calibration purposes, we need this grid to be of an odd number of dots (e.g.: 3x3, 5x5, 7x7, etc). The size of the grid will be determined b the maximum and minimum laser coordinates, and the distance between the projection surface and the projector. An example of this grid can be found in figure 1. Figure 2: Binar difference image. In this step we have isolated the grid from the background Next, we estimate the coordinates, in pixels, of the detected grid points from the binarized image. We accomplish this b choosing the center of each block of pixels that represent one grid dot and store it in memor for further processing.

3 2.2 Grid detection Now we have a set of uncorrelated x- coordinates, in pixel units, representing the dots. However, before we can use this data, we must restore the detected dots into their original grid arrangement. To accomplish this, we first find the corner points, that is, the four points that have the highest and lowest x- values. Taking these four points, we take a first guess at the arrangement, b placing a grid which corners match exactl these four points. The rest of the detected points are matched to the remaining grid points b using a weight function, shown in (3), where pt holds the x- coordinate in pixels of the point we want to match, grid x, holds the x- coordinate in pixels of the possible grid point we are evaluating; alwas preferring that grid point that returns the highest weight value. grid pt if grid has been matched x, x, wmatch( pt, grid ) = x, 0 otherwise w( pt, grid ) = wmatch( pt, grid ) + wmatch( pt, grid ) x, x+ 1, x 1, + wmatch( pt, grid ) + wmatch( pt, grid ) + 2 grid pt x, x, + 1 x, 1 In plain words, this means that for each grid point we evaluate, we will not onl prefer the closest one point, but also consider those grid points that have alread been matched. In this wa, if two points are equidistant from the grid point being considered, the grid point will prefer that one that has the closest matched neighbors. We repeat this process until all grid points have been assigned a point detected from the binar image. Now this grid holds all the detected points in the correct arrangement (see figure 3) However, since the data was taken from an image, these points are expressed in pixel units instead of the original laser projector units. In order to obtain a grid we can actuall use, we need to transform these pixel coordinates into laser coordinates. (3) numbers in pixels. However, since the center of projection for a laser projector is alwas (0, 0), we must translate the grid so the center points are aligned, as shown in equation (4), where optima lcenterx,center is the center, in laser coordinates of the ideal grid we first projected (usuall 0,0), and the observed centerx,center is the center of the observed grid, in pixel units. translate = optimal observed (4) centerx, center centerx, center The correlation between laser units and pixels (pixel-to-laser scale) is estimated b an iterating binar search algorithm. We tr to minimize the equation shown in (5), where optimal holds the ideal grid in laser units and observed is the visuall obtained grid in pixel units. Appling different scale values, we approximate the pixel grid to be as close as possible to the original maximum and minimum values of the projected gird, until we get to the maximum level of iterations or an acceptable error value is reached. The error is estimated as the absolute distance between the corners of both grids (originall projected and visuall obtained). distance( scale) = optimal scale ( observed + translate) 0,0 0,0 + optimal scale ( observed + translate) 0, size 0, size + optimal scale ( observed + translate) size,0 size,0 + optimal scale ( observed + translate) size, size size, size After appling the translation and scaling to the observed grid, we obtain the final calibration grid as the difference between the ideal grid and observed deformation, as shown in equation (6). We can consider this final, scaled grid as the visual deformation caused b the projection angle and surface irregularities, expressed in laser units. However, this is not the correction grid we need. This calibration grid can be thought of an inverted grid that counters the aforementioned deformations, and can be obtained as the difference between the visuall obtained deformation grid and the original projected (not-deformed) grid. ( ) calibrated = 2 optimal observed + translate scale (6) x, x, x, (5) 2.3. Calibration Now that we have a calibration grid we can correct the coordinates of our image and overcome the observed deformations. Figure 3: The observed points arranged in a grid fashion The first step is to correlate the middle point of the grid with the center of the laser projection zone. Namel, in the detected grid, the center point will be a given pair of x- The calibration process starts b taking each vector in the original image and finding which cells it intersects from the initial, unchanged gird. The vector is then broken down into smaller parts, each part full contained in its cell. Each part is then transformed, using bilinear interpolation, so it matches the deformations in the calibration grid. These new set of vectors is what we finall displa with the laser projector.

4 An example of a single-projector calibration can be seen in figure 4. considered an extension of the calibration for a single projector. First, for each projector involved we perform the single calibration method as previousl explained. The next step is a matter of fine-aligning the projection areas and resizing the areas accordingl. (a) (b) To align the projection areas we take the middle point of the grids in pixels, as we observed them in (4), and find the average middle point. Since this middle point is in pixels, we multipl b the pixel-to-laser scale value, for each projector and move the center of the projection area for each projector to the common averaged center b appling a pre-translation to the entire grid, as shown in (7), where translate i is the translate value obtained in (4), for the projector i, and scale i is the scale value obtained from minimizing (5). pretranslate translatei center = nprojectors i = center scale i (7) The scaling problem is solved in a similar wa. We find the average pixel-to-laser scale value of each projector and then appl a pre-scale to the calibration grid prior to make the necessar corrections. (c) Figure 4: (a) Test pattern prior to calibration, (b) compensation due to calibration and (c) final, corrected image. 3. MULTIPLE PROJECTORS CALIBRATION Since our goal is to combine the projection areas for each single projector to work as a single unit, initiall we manuall aim the projectors to be as overlapped as possible, regardless of the projection deformations that ma arouse from this. An example of this setting can be seen in figure 5 To perform the final calibration, we simpl use the new centered, resized grid, instead of the one obtained with the single-calibration method. 4. RESULTS For our experiments we used two ILDA compliant laser projectors. Two interface boards were used. A Pangolin QM2000 internal PCI interface and a QM2000.NET, network based interface. In order to perform the communication, we used the SDK provided b the manufacturer. While, for best results, we should place both projectors to have their projection zones as overlapped as possible, for our experiment we separated the projectors on purpose. Figure 6 shows each projection grid for both projectors, prior calibration. We can see that both size and perspective differ from each other Once we have calibrated each projector individuall, we performed the necessar calculations to overlap the two regions. Projector 1 Projector 2 Audience (digital camera) Figure 5: Calibration grids for both projectors The process for calibrating multiple projectors can be An example of the dual-calibration in action can be seen on figure 7. In this example, we took our universit logo, transformed it into vectors and split it into two parts with similar amount of vectors. In the first image, we see the two parts being projected prior to the calibration takes place. We can see that there is an evident gap between the two parts. After calibration, however, we can see that the original image is restored and correctl displaed To test the effectiveness of our method, we created frames

5 with increasing complexit and displaed them with both methods (single and dual projection), and changed the scan rate until a noticeable flickering effect appeared. To measure the flickering effect, we set up a camera to take snapshots with a shutter speed of 1/30 th of a second. If the picture taken showed the entire drawing as it was intended, the scan rate was adequate and we can assume that no flicker appears. However, if the picture was incomplete, this meant that the projector failed to refresh at an appropriate speed. The results are shown in figure 8 (a) Figure 6: Calibration grids for both projectors We can see from this result that using two projectors instead of one, allows us to draw more points per frame using almost exactl half the scan-rate. In other words, b using the same regular scan-rate than a single projector, we can achieve images that are twice as complex. 5. CONCLUSIONS We have shown a method that automaticall corrects the deformations caused b projection angles and surface irregularities for single projector. In this wa, we can safel project onto a surface without risking ee injuries on the viewers. We also extended this method b combining two projectors to full overlap, creating a single projection area. This new area can help reduce the flickering effect for complex images with large numbers of vectors, while keeping the same scan-rate. Figure 7: (a) Universit logo before and (b) after calibration e t a R n a c S (b) Single Projector Dual Projector Points Figure 8: Points per frame versus required scan rate to avoid flickering

6 6. FUTURE WORK While we have shown a consistent method for combining multiple laser projectors for collaborative projection, the problem of obtaining an adequate break-down of the image and assigning the responsibilities to each projector according to their capabilities remains to be done. This would be helpful, for example, in a heterogeneous environment, where faster projectors can compensate for slower ones. Another interesting point of stud is to extend this method to handle not onl still frames, but animations as well. In this case, the speed of the projectors must be taken into account to avoid the slower projector lagging behind. Issues such as snchronization and frame-rate will become areas of research. ACKNOWLEDGEMENTS This work was partiall supported b the Japanese Ministr of Education, Science, Sports and Culture, Grant-in-Aid for Explorator Research REFERENCES [ABD07] An Efficient Drawing Algorithm for Laser Graphics, Purkhat ABDERYIM, Osama HALABI and Norishige CHIBA, p9, Tohoku-Section Joint Convention of Institutes of Electrical and Information Engineers 2007 [BRO05] Camera-Based Calibration Techniques for Seamless Multi-Projector Displas. BROWN Michael, MAJUMDER Aditi, YANG Ruigang, IEEE Transactions on Visualization and Computer Graphics, March/April 2005 (Vol. 11, No. 2) pp [ISO05] Picture transfer protocol (PTP) for digital still photograph devices. ISO Standard 15740:2005 [MEN07] Camera-Based Calibration for Laser Projectors, Francisco MENENDEZ, Osama HALABI and Norishige CHIBA, p.3, Tohoku-Section Joint Convention of Institutes of Electrical and Information Engineers 2007 [RAS98] Seamless Projection Overlaps Using Image Warping and Intensit Blending, RASKAR R., WELCH G., and FUCHS H, Fourth International Conference on Virtual Sstems and Multimedia, (Gifu, Japan), Nov. 1998

A CORRECTION ALGORITHM FOR DISTORTED LASER IMAGES

A CORRECTION ALGORITHM FOR DISTORTED LASER IMAGES A CORRECTION ALGORITHM FOR DISTORTED LASER IMAGES MENENDEZ Francisco J., HALABI Osama, FUJIMOTO Tadahiro, CHIBA Norishige Department of Computer Science Graduate School of Engineering Iwate University

More information

MORPHING-BASED VECTORIZED CANDLE ANIMATION FOR LASER GRAPHICS. PURKHET Abderyim, MENENDEZ Francisco. J, HALABI Osama,CHIBA Norishige

MORPHING-BASED VECTORIZED CANDLE ANIMATION FOR LASER GRAPHICS. PURKHET Abderyim, MENENDEZ Francisco. J, HALABI Osama,CHIBA Norishige MORPHING-BASED VECTORIZED CANDLE ANIMATION FOR LASER GRAPHICS PURKHET Abderyim, MENENDEZ Francisco. J, HALABI Osama,CHIBA Norishige Department of Computer Science Graduate School of Engineering Iwate University

More information

Linear Algebra and Image Processing: Additional Theory regarding Computer Graphics and Image Processing not covered by David C.

Linear Algebra and Image Processing: Additional Theory regarding Computer Graphics and Image Processing not covered by David C. Linear Algebra and Image Processing: Additional Theor regarding Computer Graphics and Image Processing not covered b David C. La Dr. D.P. Huijsmans LIACS, Leiden Universit Februar 202 Differences in conventions

More information

CS 335 Graphics and Multimedia. Geometric Warping

CS 335 Graphics and Multimedia. Geometric Warping CS 335 Graphics and Multimedia Geometric Warping Geometric Image Operations Eample transformations Straightforward methods and their problems The affine transformation Transformation algorithms: Forward

More information

Approaches to Simulate the Operation of the Bending Machine

Approaches to Simulate the Operation of the Bending Machine Approaches to Simulate the Operation of the Bending Machine Ornwadee Ratanapinunchai Chanunchida Theerasilp Teerut Suksawai Project Advisors: Dr. Krit Chongsrid and Dr. Waree Kongprawechnon Department

More information

Universiteit Leiden Computer Science

Universiteit Leiden Computer Science Universiteit Leiden Computer Science Optimizing octree updates for visibility determination on dynamic scenes Name: Hans Wortel Student-no: 0607940 Date: 28/07/2011 1st supervisor: Dr. Michael Lew 2nd

More information

Projections. Brian Curless CSE 457 Spring Reading. Shrinking the pinhole. The pinhole camera. Required:

Projections. Brian Curless CSE 457 Spring Reading. Shrinking the pinhole. The pinhole camera. Required: Reading Required: Projections Brian Curless CSE 457 Spring 2013 Angel, 5.1-5.6 Further reading: Fole, et al, Chapter 5.6 and Chapter 6 David F. Rogers and J. Alan Adams, Mathematical Elements for Computer

More information

Determining the 2d transformation that brings one image into alignment (registers it) with another. And

Determining the 2d transformation that brings one image into alignment (registers it) with another. And Last two lectures: Representing an image as a weighted combination of other images. Toda: A different kind of coordinate sstem change. Solving the biggest problem in using eigenfaces? Toda Recognition

More information

D-Calib: Calibration Software for Multiple Cameras System

D-Calib: Calibration Software for Multiple Cameras System D-Calib: Calibration Software for Multiple Cameras Sstem uko Uematsu Tomoaki Teshima Hideo Saito Keio Universit okohama Japan {u-ko tomoaki saito}@ozawa.ics.keio.ac.jp Cao Honghua Librar Inc. Japan cao@librar-inc.co.jp

More information

Stereo: the graph cut method

Stereo: the graph cut method Stereo: the graph cut method Last lecture we looked at a simple version of the Marr-Poggio algorithm for solving the binocular correspondence problem along epipolar lines in rectified images. The main

More information

Introduction to Homogeneous Transformations & Robot Kinematics

Introduction to Homogeneous Transformations & Robot Kinematics Introduction to Homogeneous Transformations & Robot Kinematics Jennifer Ka Rowan Universit Computer Science Department. Drawing Dimensional Frames in 2 Dimensions We will be working in -D coordinates,

More information

Discover how to solve this problem in this chapter.

Discover how to solve this problem in this chapter. A 2 cm tall object is 12 cm in front of a spherical mirror. A 1.2 cm tall erect image is then obtained. What kind of mirror is used (concave, plane or convex) and what is its focal length? www.totalsafes.co.uk/interior-convex-mirror-900mm.html

More information

Optional: Building a processor from scratch

Optional: Building a processor from scratch Optional: Building a processor from scratch In this assignment we are going build a computer processor from the ground up, starting with transistors, and ending with a small but powerful processor. The

More information

20 Calculus and Structures

20 Calculus and Structures 0 Calculus and Structures CHAPTER FUNCTIONS Calculus and Structures Copright LESSON FUNCTIONS. FUNCTIONS A function f is a relationship between an input and an output and a set of instructions as to how

More information

<www.excelunusual.com>

<www.excelunusual.com> Excel anaglph stereoscop #3 3D-D perspective conversion formulas b George Lungu - While the previous section introduced the reader to the general principles of anaglph stereoscop, this section explains

More information

CS 2770: Intro to Computer Vision. Multiple Views. Prof. Adriana Kovashka University of Pittsburgh March 14, 2017

CS 2770: Intro to Computer Vision. Multiple Views. Prof. Adriana Kovashka University of Pittsburgh March 14, 2017 CS 277: Intro to Computer Vision Multiple Views Prof. Adriana Kovashka Universit of Pittsburgh March 4, 27 Plan for toda Affine and projective image transformations Homographies and image mosaics Stereo

More information

Introduction to Homogeneous Transformations & Robot Kinematics

Introduction to Homogeneous Transformations & Robot Kinematics Introduction to Homogeneous Transformations & Robot Kinematics Jennifer Ka, Rowan Universit Computer Science Department Januar 25. Drawing Dimensional Frames in 2 Dimensions We will be working in -D coordinates,

More information

Computer Graphics. Si Lu. Fall er_graphics.htm 10/11/2017

Computer Graphics. Si Lu. Fall er_graphics.htm 10/11/2017 Computer Graphics Si Lu Fall 27 http://www.cs.pd.edu/~lusi/cs447/cs447_547_comput er_graphics.htm //27 Last time Filtering Resampling 2 Toda Compositing NPR 3D Graphics Toolkits Transformations 3 Demo

More information

Today s class. Geometric objects and transformations. Informationsteknologi. Wednesday, November 7, 2007 Computer Graphics - Class 5 1

Today s class. Geometric objects and transformations. Informationsteknologi. Wednesday, November 7, 2007 Computer Graphics - Class 5 1 Toda s class Geometric objects and transformations Wednesda, November 7, 27 Computer Graphics - Class 5 Vector operations Review of vector operations needed for working in computer graphics adding two

More information

Grid and Mesh Generation. Introduction to its Concepts and Methods

Grid and Mesh Generation. Introduction to its Concepts and Methods Grid and Mesh Generation Introduction to its Concepts and Methods Elements in a CFD software sstem Introduction What is a grid? The arrangement of the discrete points throughout the flow field is simpl

More information

DIGITAL ORTHOPHOTO GENERATION

DIGITAL ORTHOPHOTO GENERATION DIGITAL ORTHOPHOTO GENERATION Manuel JAUREGUI, José VÍLCHE, Leira CHACÓN. Universit of Los Andes, Venezuela Engineering Facult, Photogramdemr Institute, Email leirac@ing.ula.ven Working Group IV/2 KEY

More information

Image Metamorphosis By Affine Transformations

Image Metamorphosis By Affine Transformations Image Metamorphosis B Affine Transformations Tim Mers and Peter Spiegel December 16, 2005 Abstract Among the man was to manipulate an image is a technique known as morphing. Image morphing is a special

More information

EECS 556 Image Processing W 09

EECS 556 Image Processing W 09 EECS 556 Image Processing W 09 Motion estimation Global vs. Local Motion Block Motion Estimation Optical Flow Estimation (normal equation) Man slides of this lecture are courtes of prof Milanfar (UCSC)

More information

y = f(x) x (x, f(x)) f(x) g(x) = f(x) + 2 (x, g(x)) 0 (0, 1) 1 3 (0, 3) 2 (2, 3) 3 5 (2, 5) 4 (4, 3) 3 5 (4, 5) 5 (5, 5) 5 7 (5, 7)

y = f(x) x (x, f(x)) f(x) g(x) = f(x) + 2 (x, g(x)) 0 (0, 1) 1 3 (0, 3) 2 (2, 3) 3 5 (2, 5) 4 (4, 3) 3 5 (4, 5) 5 (5, 5) 5 7 (5, 7) 0 Relations and Functions.7 Transformations In this section, we stud how the graphs of functions change, or transform, when certain specialized modifications are made to their formulas. The transformations

More information

Scan Conversion- Polygons

Scan Conversion- Polygons Scan Conversion- olgons Flood Fill Algorithm Chapter 9 Scan Conversion (part ) Drawing olgons on Raster Displa Input polgon with rasterized edges = (x,) point inside Goal: Fill interior with specified

More information

Face Detection on Similar Color Photographs

Face Detection on Similar Color Photographs Face Detection on Similar Color Photographs Scott Leahy EE368: Digital Image Processing Professor: Bernd Girod Stanford University Spring 2003 Final Project: Face Detection Leahy, 2/2 Table of Contents

More information

Blacksburg, VA July 24 th 30 th, 2010 Georeferencing images and scanned maps Page 1. Georeference

Blacksburg, VA July 24 th 30 th, 2010 Georeferencing images and scanned maps Page 1. Georeference George McLeod Prepared by: With support from: NSF DUE-0903270 in partnership with: Geospatial Technician Education Through Virginia s Community Colleges (GTEVCC) Georeference The process of defining how

More information

A Vision System for Automatic State Determination of Grid Based Board Games

A Vision System for Automatic State Determination of Grid Based Board Games A Vision System for Automatic State Determination of Grid Based Board Games Michael Bryson Computer Science and Engineering, University of South Carolina, 29208 Abstract. Numerous programs have been written

More information

Grade 7/8 Math Circles Fall October 9/10/11 Angles and Light

Grade 7/8 Math Circles Fall October 9/10/11 Angles and Light Facult of Mathematics Waterloo, Ontario N2L 3G1 Grade 7/8 Math Circles Fall 2018 - October 9/10/11 Angles and Light Centre for Education in Mathematics and Computing Toda we will be learning about angles.

More information

Rev Name Date

Rev Name Date Name Date TI-8+ GC 10+ Using the Y= menu, Automatic and Ask Tables Objectives: Input functions into the Y= menu Use TBLSET and TABLE to set up and view tables In addition to the calculating screen and

More information

COMP Computer Graphics and Image Processing. a6: Projections. In part 2 of our study of Viewing, we ll look at. COMP27112 Toby Howard

COMP Computer Graphics and Image Processing. a6: Projections. In part 2 of our study of Viewing, we ll look at. COMP27112 Toby Howard Computer Graphics and Image Processing a6: Projections Tob.Howard@manchester.ac.uk Introduction In part 2 of our stud of Viewing, we ll look at The theor of geometrical planar projections Classes of projections

More information

Quad-Tree Based Geometric-Adapted Cartesian Grid Generation

Quad-Tree Based Geometric-Adapted Cartesian Grid Generation Quad-Tree Based Geometric-Adapted Cartesian Grid Generation EMRE KARA1, AHMET ĐHSAN KUTLAR1, MEHMET HALUK AKSEL 1Department of Mechanical Engineering Universit of Gaziantep 7310 Gaziantep TURKEY Mechanical

More information

Lesson 11 Skills Maintenance. Activity 1. Model. The addition problem is = 4. The subtraction problem is 5 9 = 4.

Lesson 11 Skills Maintenance. Activity 1. Model. The addition problem is = 4. The subtraction problem is 5 9 = 4. Lesson Skills Maintenance Lesson Planner Vocabular Development -coordinate -coordinate point of origin Skills Maintenance ddition and Subtraction of Positive and Negative Integers Problem Solving: We look

More information

Lens Screw Pad Arm (a) Glasses frames Screw (b) Parts Bridge Nose Pad Fig. 2 Name of parts composing glasses flames Temple Endpiece 2.2 Geometric mode

Lens Screw Pad Arm (a) Glasses frames Screw (b) Parts Bridge Nose Pad Fig. 2 Name of parts composing glasses flames Temple Endpiece 2.2 Geometric mode 3D Fitting Simulation of Glasses Frames Using Individual s Face Model Noriaki TAMURA and Katsuhiro KITAJIMA Toko Universit of Agriculture and Technolog, Toko, Japan E-mail: 50008834305@st.tuat.ac.jp, kitajima@cc.tuat.ac.jp

More information

Transformations of Functions. 1. Shifting, reflecting, and stretching graphs Symmetry of functions and equations

Transformations of Functions. 1. Shifting, reflecting, and stretching graphs Symmetry of functions and equations Chapter Transformations of Functions TOPICS.5.. Shifting, reflecting, and stretching graphs Smmetr of functions and equations TOPIC Horizontal Shifting/ Translation Horizontal Shifting/ Translation Shifting,

More information

8. Hidden Surface Elimination

8. Hidden Surface Elimination 8. Hidden Surface Elimination Identification and Removal of parts of picture that are not visible from a chosen viewing position. 1 8. Hidden Surface Elimination Basic idea: Overwriting Paint things in

More information

1. We ll look at: Types of geometrical transformation. Vector and matrix representations

1. We ll look at: Types of geometrical transformation. Vector and matrix representations Tob Howard COMP272 Computer Graphics and Image Processing 3: Transformations Tob.Howard@manchester.ac.uk Introduction We ll look at: Tpes of geometrical transformation Vector and matri representations

More information

2.2 Absolute Value Functions

2.2 Absolute Value Functions . Absolute Value Functions 7. Absolute Value Functions There are a few was to describe what is meant b the absolute value of a real number. You ma have been taught that is the distance from the real number

More information

2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into

2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into 2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into the viewport of the current application window. A pixel

More information

E V ER-growing global competition forces. Accuracy Analysis and Improvement for Direct Laser Sintering

E V ER-growing global competition forces. Accuracy Analysis and Improvement for Direct Laser Sintering Accurac Analsis and Improvement for Direct Laser Sintering Y. Tang 1, H. T. Loh 12, J. Y. H. Fuh 2, Y. S. Wong 2, L. Lu 2, Y. Ning 2, X. Wang 2 1 Singapore-MIT Alliance, National Universit of Singapore

More information

LINEAR PROGRAMMING. Straight line graphs LESSON

LINEAR PROGRAMMING. Straight line graphs LESSON LINEAR PROGRAMMING Traditionall we appl our knowledge of Linear Programming to help us solve real world problems (which is referred to as modelling). Linear Programming is often linked to the field of

More information

Color Characterization and Calibration of an External Display

Color Characterization and Calibration of an External Display Color Characterization and Calibration of an External Display Andrew Crocker, Austin Martin, Jon Sandness Department of Math, Statistics, and Computer Science St. Olaf College 1500 St. Olaf Avenue, Northfield,

More information

EE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm

EE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm EE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm Group 1: Mina A. Makar Stanford University mamakar@stanford.edu Abstract In this report, we investigate the application of the Scale-Invariant

More information

Section 4.2 Graphing Lines

Section 4.2 Graphing Lines Section. Graphing Lines Objectives In this section, ou will learn to: To successfull complete this section, ou need to understand: Identif collinear points. The order of operations (1.) Graph the line

More information

Warping, Morphing and Mosaics

Warping, Morphing and Mosaics Computational Photograph and Video: Warping, Morphing and Mosaics Prof. Marc Pollefes Dr. Gabriel Brostow Toda s schedule Last week s recap Warping Morphing Mosaics Toda s schedule Last week s recap Warping

More information

Multi-Instrument Analysis From Point and Raster Data

Multi-Instrument Analysis From Point and Raster Data Technical Report: alg04-02 Februar 02,2004 Sang-Chul Lee, slee40@uiuc.edu Peter Bajcs, pbajcs@ncsa.uiuc.edu Automated Learning Group National Center for Supercomputing Applications 605 East Springfield

More information

Disparity Fusion Using Depth and Stereo Cameras for Accurate Stereo Correspondence

Disparity Fusion Using Depth and Stereo Cameras for Accurate Stereo Correspondence Disparit Fusion Using Depth and Stereo Cameras for Accurate Stereo Correspondence Woo-Seok Jang and Yo-Sung Ho Gwangju Institute of Science and Technolog GIST 123 Cheomdan-gwagiro Buk-gu Gwangju 500-712

More information

University of Technology Building & Construction Department / Remote Sensing & GIS lecture

University of Technology Building & Construction Department / Remote Sensing & GIS lecture 5. Corrections 5.1 Introduction 5.2 Radiometric Correction 5.3 Geometric corrections 5.3.1 Systematic distortions 5.3.2 Nonsystematic distortions 5.4 Image Rectification 5.5 Ground Control Points (GCPs)

More information

Graphs and Functions

Graphs and Functions CHAPTER Graphs and Functions. Graphing Equations. Introduction to Functions. Graphing Linear Functions. The Slope of a Line. Equations of Lines Integrated Review Linear Equations in Two Variables.6 Graphing

More information

Grade 7/8 Math Circles Fall October 9/10/11 Angles and Light

Grade 7/8 Math Circles Fall October 9/10/11 Angles and Light Facult of Mathematics Waterloo, Ontario N2L 3G1 Grade 7/8 Math Circles Fall 2018 - October 9/10/11 Angles and Light Centre for Education in Mathematics and Computing Toda we will be learning about angles.

More information

Web-Friendly Sites. Planning & Design 1

Web-Friendly Sites. Planning & Design 1 Planning & Design 1 This tutorial presents useful tips and tricks to help you achieve a more Web-friendly design and make your sites more efficient. The following topics are discussed: How Z-order and

More information

UNIVERSITY OF CALIFORNIA RIVERSIDE MAGIC CAMERA. A project report submitted in partial satisfaction of the requirements of the degree of

UNIVERSITY OF CALIFORNIA RIVERSIDE MAGIC CAMERA. A project report submitted in partial satisfaction of the requirements of the degree of UNIVERSITY OF CALIFORNIA RIVERSIDE MAGIC CAMERA A project report submitted in partial satisfaction of the requirements of the degree of Master of Science in Computer Science by Adam Meadows June 2006 Project

More information

Character Recognition

Character Recognition Character Recognition 5.1 INTRODUCTION Recognition is one of the important steps in image processing. There are different methods such as Histogram method, Hough transformation, Neural computing approaches

More information

A Step-by-step guide to creating a Professional PowerPoint Presentation

A Step-by-step guide to creating a Professional PowerPoint Presentation Quick introduction to Microsoft PowerPoint A Step-by-step guide to creating a Professional PowerPoint Presentation Created by Cruse Control creative services Tel +44 (0) 1923 842 295 training@crusecontrol.com

More information

Broad field that includes low-level operations as well as complex high-level algorithms

Broad field that includes low-level operations as well as complex high-level algorithms Image processing About Broad field that includes low-level operations as well as complex high-level algorithms Low-level image processing Computer vision Computational photography Several procedures and

More information

Clustering Part 2. A Partitional Clustering

Clustering Part 2. A Partitional Clustering Universit of Florida CISE department Gator Engineering Clustering Part Dr. Sanja Ranka Professor Computer and Information Science and Engineering Universit of Florida, Gainesville Universit of Florida

More information

Double Integrals in Polar Coordinates

Double Integrals in Polar Coordinates Double Integrals in Polar Coordinates. A flat plate is in the shape of the region in the first quadrant ling between the circles + and +. The densit of the plate at point, is + kilograms per square meter

More information

Proposal of a Touch Panel Like Operation Method For Presentation with a Projector Using Laser Pointer

Proposal of a Touch Panel Like Operation Method For Presentation with a Projector Using Laser Pointer Proposal of a Touch Panel Like Operation Method For Presentation with a Projector Using Laser Pointer Yua Kawahara a,* and Lifeng Zhang a a Kushu Institute of Technolog, 1-1 Sensui-cho Tobata-ku, Kitakushu

More information

EE795: Computer Vision and Intelligent Systems

EE795: Computer Vision and Intelligent Systems EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 WRI C225 Lecture 02 130124 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Basics Image Formation Image Processing 3 Intelligent

More information

form are graphed in Cartesian coordinates, and are graphed in Cartesian coordinates.

form are graphed in Cartesian coordinates, and are graphed in Cartesian coordinates. Plot 3D Introduction Plot 3D graphs objects in three dimensions. It has five basic modes: 1. Cartesian mode, where surfaces defined by equations of the form are graphed in Cartesian coordinates, 2. cylindrical

More information

Perspective Projection Transformation

Perspective Projection Transformation Perspective Projection Transformation Where does a point of a scene appear in an image?? p p Transformation in 3 steps:. scene coordinates => camera coordinates. projection of camera coordinates into image

More information

Processing 3D Surface Data

Processing 3D Surface Data Processing 3D Surface Data Computer Animation and Visualisation Lecture 12 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing

More information

A High Speed Face Measurement System

A High Speed Face Measurement System A High Speed Face Measurement System Kazuhide HASEGAWA, Kazuyuki HATTORI and Yukio SATO Department of Electrical and Computer Engineering, Nagoya Institute of Technology Gokiso, Showa, Nagoya, Japan, 466-8555

More information

2.4 Polynomial and Rational Functions

2.4 Polynomial and Rational Functions Polnomial Functions Given a linear function f() = m + b, we can add a square term, and get a quadratic function g() = a 2 + f() = a 2 + m + b. We can continue adding terms of higher degrees, e.g. we can

More information

CS 157: Assignment 6

CS 157: Assignment 6 CS 7: Assignment Douglas R. Lanman 8 Ma Problem : Evaluating Conve Polgons This write-up presents several simple algorithms for determining whether a given set of twodimensional points defines a conve

More information

PARAMETRIC EQUATIONS AND POLAR COORDINATES

PARAMETRIC EQUATIONS AND POLAR COORDINATES 9 ARAMETRIC EQUATIONS AND OLAR COORDINATES So far we have described plane curves b giving as a function of f or as a function of t or b giving a relation between and that defines implicitl as a function

More information

Section 2.2: Absolute Value Functions, from College Algebra: Corrected Edition by Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a

Section 2.2: Absolute Value Functions, from College Algebra: Corrected Edition by Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a Section.: Absolute Value Functions, from College Algebra: Corrected Edition b Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a Creative Commons Attribution-NonCommercial-ShareAlike.0 license.

More information

Study on Image Retrieval Method of Integrating Color and Texture

Study on Image Retrieval Method of Integrating Color and Texture International Journal of Science Vol. No.1 015 ISSN: 1813-4890 Stud on Image Retrieval Method of Integrating Color and Texture Lei Liu a, Xiafu Lv b, Junpeng Chen, Bohua Wang College of automation, Chongqing

More information

Unit 2: Function Transformation Chapter 1

Unit 2: Function Transformation Chapter 1 Basic Transformations Reflections Inverses Unit 2: Function Transformation Chapter 1 Section 1.1: Horizontal and Vertical Transformations A of a function alters the and an combination of the of the graph.

More information

UNIT P1: PURE MATHEMATICS 1 QUADRATICS

UNIT P1: PURE MATHEMATICS 1 QUADRATICS QUADRATICS Candidates should able to: carr out the process of completing the square for a quadratic polnomial, and use this form, e.g. to locate the vertex of the graph of or to sketch the graph; find

More information

Computer Graphics. Attributes of Graphics Primitives. Somsak Walairacht, Computer Engineering, KMITL 1

Computer Graphics. Attributes of Graphics Primitives. Somsak Walairacht, Computer Engineering, KMITL 1 Computer Graphics Chapter 4 Attributes of Graphics Primitives Somsak Walairacht, Computer Engineering, KMITL 1 Outline OpenGL State Variables Point Attributes t Line Attributes Fill-Area Attributes Scan-Line

More information

Scanning Real World Objects without Worries 3D Reconstruction

Scanning Real World Objects without Worries 3D Reconstruction Scanning Real World Objects without Worries 3D Reconstruction 1. Overview Feng Li 308262 Kuan Tian 308263 This document is written for the 3D reconstruction part in the course Scanning real world objects

More information

Geometric Image Transformations and Related Topics

Geometric Image Transformations and Related Topics Geometric Image Transformations and Related Topics 9 th Lesson on Image Processing Martina Mudrová 2004 Topics What will be the topic of the following lesson? Geometric image transformations Interpolation

More information

What and Why Transformations?

What and Why Transformations? 2D transformations What and Wh Transformations? What? : The geometrical changes of an object from a current state to modified state. Changing an object s position (translation), orientation (rotation)

More information

MAN-522: COMPUTER VISION SET-2 Projections and Camera Calibration

MAN-522: COMPUTER VISION SET-2 Projections and Camera Calibration MAN-522: COMPUTER VISION SET-2 Projections and Camera Calibration Image formation How are objects in the world captured in an image? Phsical parameters of image formation Geometric Tpe of projection Camera

More information

CPSC 314, Midterm Exam. 8 March 2010

CPSC 314, Midterm Exam. 8 March 2010 CPSC, Midterm Eam 8 March 00 Closed book, no electronic devices besides (simple, nongraphing) calculators. Cell phones must be turned off. Place our photo ID face up on our desk. One single-sided sheet

More information

DEVELOPMENT OF REAL TIME 3-D MEASUREMENT SYSTEM USING INTENSITY RATIO METHOD

DEVELOPMENT OF REAL TIME 3-D MEASUREMENT SYSTEM USING INTENSITY RATIO METHOD DEVELOPMENT OF REAL TIME 3-D MEASUREMENT SYSTEM USING INTENSITY RATIO METHOD Takeo MIYASAKA and Kazuo ARAKI Graduate School of Computer and Cognitive Sciences, Chukyo University, Japan miyasaka@grad.sccs.chukto-u.ac.jp,

More information

A Practical Camera Calibration System on Mobile Phones

A Practical Camera Calibration System on Mobile Phones Advanced Science and echnolog Letters Vol.7 (Culture and Contents echnolog 0), pp.6-0 http://dx.doi.org/0.57/astl.0.7. A Practical Camera Calibration Sstem on Mobile Phones Lu Bo, aegkeun hangbo Department

More information

Graphics Hardware and Display Devices

Graphics Hardware and Display Devices Graphics Hardware and Display Devices CSE328 Lectures Graphics/Visualization Hardware Many graphics/visualization algorithms can be implemented efficiently and inexpensively in hardware Facilitates interactive

More information

Graphing Calculator Graphing with the TI-86

Graphing Calculator Graphing with the TI-86 Graphing Calculator Graphing with the TI-86 I. Introduction The TI-86 has fift kes, man of which perform multiple functions when used in combination. Each ke has a smbol printed on its face. When a ke

More information

Painter s Algorithm: Problems

Painter s Algorithm: Problems Universit of British Columbia CPSC Computer Graphics Jan-Apr 0 Tamara Munzner Hidden Surfaces Clarification: Blinn-Phong Model onl change vs Phong model is to have the specular calculation to use (h n)

More information

Getting Started with montaj GridKnit

Getting Started with montaj GridKnit Getting Started with montaj GridKnit Today s explorers use regional and local geophysical compilations of magnetic, radiometric and apparent resistivity data to perform comprehensive geologic interpretations

More information

Measurement of 3D Foot Shape Deformation in Motion

Measurement of 3D Foot Shape Deformation in Motion Measurement of 3D Foot Shape Deformation in Motion Makoto Kimura Masaaki Mochimaru Takeo Kanade Digital Human Research Center National Institute of Advanced Industrial Science and Technology, Japan The

More information

Understand the Slope-Intercept Equation for a Line

Understand the Slope-Intercept Equation for a Line Lesson Part : Introduction Understand the Slope-Intercept Equation for a Line Focus on Math Concepts CCLS 8.EE..6 How can ou show that an equation in the form 5 mx b defines a line? You have discovered

More information

EE795: Computer Vision and Intelligent Systems

EE795: Computer Vision and Intelligent Systems EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 WRI C225 Lecture 04 130131 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Histogram Equalization Image Filtering Linear

More information

Computer Graphics. Jeng-Sheng Yeh 葉正聖 Ming Chuan University (modified from Bing-Yu Chen s slides)

Computer Graphics. Jeng-Sheng Yeh 葉正聖 Ming Chuan University (modified from Bing-Yu Chen s slides) Computer Graphics Jeng-Sheng Yeh 葉正聖 Ming Chuan Universit (modified from Bing-Yu Chen s slides) Viewing in 3D 3D Viewing Process Specification of an Arbitrar 3D View Orthographic Parallel Projection Perspective

More information

Exponential and Logarithmic Functions

Exponential and Logarithmic Functions Eponential and Logarithmic Functions Figure Electron micrograph of E. Coli bacteria (credit: Mattosaurus, Wikimedia Commons) CHAPTER OUTLINE. Eponential Functions. Logarithmic Properties. Graphs of Eponential

More information

AUTOMATIC DRAWING FOR TRAFFIC MARKING WITH MMS LIDAR INTENSITY

AUTOMATIC DRAWING FOR TRAFFIC MARKING WITH MMS LIDAR INTENSITY AUTOMATIC DRAWING FOR TRAFFIC MARKING WITH MMS LIDAR INTENSITY G. Takahashi a, H. Takeda a, Y. Shimano a a Spatial Information Division, Kokusai Kogyo Co., Ltd., Tokyo, Japan - (genki_takahashi, hiroshi1_takeda,

More information

Last Time. Correct Transparent Shadow. Does Ray Tracing Simulate Physics? Does Ray Tracing Simulate Physics? Refraction and the Lifeguard Problem

Last Time. Correct Transparent Shadow. Does Ray Tracing Simulate Physics? Does Ray Tracing Simulate Physics? Refraction and the Lifeguard Problem Graphics Pipeline: Projective Last Time Shadows cast ra to light stop after first intersection Reflection & Refraction compute direction of recursive ra Recursive Ra Tracing maimum number of bounces OR

More information

VISUAL NAVIGATION SYSTEM ON WINDSHIELD HEAD-UP DISPLAY

VISUAL NAVIGATION SYSTEM ON WINDSHIELD HEAD-UP DISPLAY VISUAL NAVIGATION SYSTEM ON WINDSHIELD HEAD-UP DISPLAY Akihiko SATO *, Itaru KITAHARA, Yoshinari KAMEDA, Yuichi OHTA Department of Intelligent Interaction Technologies, Graduate School of Systems and Information

More information

Exponential and Logarithmic Functions

Exponential and Logarithmic Functions Eponential and Logarithmic Functions Figure Electron micrograph of E. Coli bacteria (credit: Mattosaurus, Wikimedia Commons) Chapter Outline. Eponential Functions. Logarithmic Properties. Graphs of Eponential

More information

Processing 3D Surface Data

Processing 3D Surface Data Processing 3D Surface Data Computer Animation and Visualisation Lecture 17 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing

More information

Affine and Projective Transformations

Affine and Projective Transformations CS 674: Intro to Computer Vision Affine and Projective Transformations Prof. Adriana Kovaska Universit of Pittsburg October 3, 26 Alignment problem We previousl discussed ow to matc features across images,

More information

REPORT DOCUMENTATION PAGE

REPORT DOCUMENTATION PAGE REPORT DOCUMENTATION PAGE Form Approved OMB No. 0704-088 Public reporting burden for this collection of information is estimated to average hour per response, including the time for reviewing instructions,

More information

Developed in Consultation with Tennessee Educators

Developed in Consultation with Tennessee Educators Developed in Consultation with Tennessee Educators Table of Contents Letter to the Student........................................ Test-Taking Checklist........................................ Tennessee

More information

Warps and Morphs. Mike Land and Tara Puzin Linear Algebra College of the Redwoods December 2, 2002

Warps and Morphs. Mike Land and Tara Puzin Linear Algebra College of the Redwoods December 2, 2002 Warps and Morphs Mike Land and Tara Puzin Linear Algebra College of the Redwoods December 2, 2002 Abstract There is a interesting technique in the movie industry called metamorphosis, this technique morphs

More information

CS4620/5620: Lecture 14 Pipeline

CS4620/5620: Lecture 14 Pipeline CS4620/5620: Lecture 14 Pipeline 1 Rasterizing triangles Summary 1! evaluation of linear functions on pixel grid 2! functions defined by parameter values at vertices 3! using extra parameters to determine

More information

Critique: Efficient Iris Recognition by Characterizing Key Local Variations

Critique: Efficient Iris Recognition by Characterizing Key Local Variations Critique: Efficient Iris Recognition by Characterizing Key Local Variations Authors: L. Ma, T. Tan, Y. Wang, D. Zhang Published: IEEE Transactions on Image Processing, Vol. 13, No. 6 Critique By: Christopher

More information

CHAPTER 9: Quadratic Equations and Functions

CHAPTER 9: Quadratic Equations and Functions Notes # CHAPTER : Quadratic Equations and Functions -: Exploring Quadratic Graphs A. Intro to Graphs of Quadratic Equations: = ax + bx + c A is a function that can be written in the form = ax + bx + c

More information

Direct Rendering. Direct Rendering Goals

Direct Rendering. Direct Rendering Goals May 2, 2005 Goals General Goals Small memory footprint Fast rendering High-quality results identical to those of Saffron V1 using distance-based anti-aliasing and alignment zones Goals Specific Goals Avoid

More information