You will have the entire period (until 9:00pm) to complete the exam, although the exam is designed to take less time.

Similar documents
CS 559 Computer Graphics Midterm Exam March 22, :30-3:45 pm

Midterm Exam Fundamentals of Computer Graphics (COMP 557) Thurs. Feb. 19, 2015 Professor Michael Langer

Homework #1. Displays, Alpha Compositing, Image Processing, Affine Transformations, Hierarchical Modeling

For each question, indicate whether the statement is true or false by circling T or F, respectively.

Homework #1. Displays, Image Processing, Affine Transformations, Hierarchical Modeling

Transforms 1 Christian Miller CS Fall 2011

Homework #1. Displays, Image Processing, Affine Transformations, Hierarchical Modeling

Today. Parity. General Polygons? Non-Zero Winding Rule. Winding Numbers. CS559 Lecture 11 Polygons, Transformations

Homework #1. Displays, Image Processing, Affine Transformations, Hierarchical modeling, Projections

CS 130 Final. Fall 2015

6.837 Introduction to Computer Graphics Quiz 2 Thursday November 20, :40-4pm One hand-written sheet of notes allowed

Shadows in the graphics pipeline

The exam begins at 2:40pm and ends at 4:00pm. You must turn your exam in when time is announced or risk not having it accepted.

Midterm Exam CS 184: Foundations of Computer Graphics page 1 of 11

Topics and things to know about them:

Overview. By end of the week:

Institutionen för systemteknik

Viewing with Computers (OpenGL)

CT5510: Computer Graphics. Transformation BOCHANG MOON

The exam begins at 2:40pm and ends at 4:00pm. You must turn your exam in when time is announced or risk not having it accepted.

CHAPTER 1 Graphics Systems and Models 3

CS1114 Assignment 5, Part 1

2D/3D Geometric Transformations and Scene Graphs

CS6670: Computer Vision

Homework #2. Hidden Surfaces, Projections, Shading and Texture, Ray Tracing, and Parametric Curves

Game Engineering CS S-05 Linear Transforms

CMSC427: Computer Graphics Lecture Notes Last update: November 21, 2014

Matrices. Chapter Matrix A Mathematical Definition Matrix Dimensions and Notation

(Refer Slide Time: 00:04:20)

Pen Tool, Fill Layers, Color Range, Levels Adjustments, Magic Wand tool, and shadowing techniques

CS 464 Review. Review of Computer Graphics for Final Exam

Computer Graphics I. Midterm Examination. October 23, This is a closed-book exam; only one double-sided sheet of notes is permitted.

To Do. Outline. Translation. Homogeneous Coordinates. Foundations of Computer Graphics. Representation of Points (4-Vectors) Start doing HW 1

How to draw and create shapes

Midterm Exam! CS 184: Foundations of Computer Graphics! page 1 of 14!

I N T R O D U C T I O N T O C O M P U T E R G R A P H I C S

COMP30019 Graphics and Interaction Three-dimensional transformation geometry and perspective

Computer Science 426 Midterm 3/11/04, 1:30PM-2:50PM

Midterm Exam! CS 184: Foundations of Computer Graphics! page 1 of 13!

Linear transformations Affine transformations Transformations in 3D. Graphics 2009/2010, period 1. Lecture 5: linear and affine transformations

Pop Quiz 1 [10 mins]

How to print a Hypercube

CSC 471 midterm 2 Winter Name:

INTRODUCTION TO COMPUTER GRAPHICS. It looks like a matrix Sort of. Viewing III. Projection in Practice. Bin Sheng 10/11/ / 52

MAT 003 Brian Killough s Instructor Notes Saint Leo University

Practice Exam Sample Solutions

Image Warping and Mosacing

CSE328 Fundamentals of Computer Graphics

CSE528 Computer Graphics: Theory, Algorithms, and Applications

CS559 Computer Graphics Fall 2015

Projective Geometry and Camera Models

CS4620/5620. Professor: Kavita Bala. Cornell CS4620/5620 Fall 2012 Lecture Kavita Bala 1 (with previous instructors James/Marschner)

Prof. Feng Liu. Fall /19/2016

Technical Arts 101 Prof. Anupam Saxena Department of Mechanical engineering Indian Institute of Technology, Kanpur. Lecture - 7 Think and Analyze

EXAMINATIONS 2017 TRIMESTER 2

Math background. 2D Geometric Transformations. Implicit representations. Explicit representations. Read: CS 4620 Lecture 6

Quaternions and Exponentials

3D Space is one of the most rewarding areas

Drawing in 3D (viewing, projection, and the rest of the pipeline)

EXAMINATIONS 2016 TRIMESTER 2

3D Viewing Episode 2

CS 4204 Computer Graphics

Answers. Chapter 2. 1) Give the coordinates of the following points:

Project report Augmented reality with ARToolKit

Lecture 5 2D Transformation

TSBK 07! Computer Graphics! Ingemar Ragnemalm, ISY

Adobe Flash CS3 Reference Flash CS3 Application Window

L2 Translations, Reflections, and Rotations Pre-Assessment Per Date

CS223b Midterm Exam, Computer Vision. Monday February 25th, Winter 2008, Prof. Jana Kosecka

CS Exam 1 Review Problems Fall 2017

Computer Graphics Hands-on

Announcements. Image Matching! Source & Destination Images. Image Transformation 2/ 3/ 16. Compare a big image to a small image

Work with Shapes. Concepts CHAPTER. Concepts, page 3-1 Procedures, page 3-5

Graphics pipeline and transformations. Composition of transformations

Module 2 Test Study Guide. Type of Transformation (translation, reflection, rotation, or none-of-theabove). Be as specific as possible.

1 (5 max) 2 (10 max) 3 (20 max) 4 (30 max) 5 (10 max) 6 (15 extra max) total (75 max + 15 extra)

03 Vector Graphics. Multimedia Systems. 2D and 3D Graphics, Transformations

Lecture 4: Transforms. Computer Graphics CMU /15-662, Fall 2016

Read every line of the exam sheet before programming!

Today s class. Viewing transformation Menus Mandelbrot set and pixel drawing. Informationsteknologi

GEOMETRIC TRANSFORMATIONS AND VIEWING

Computer Vision Projective Geometry and Calibration. Pinhole cameras

MATRIX REVIEW PROBLEMS: Our matrix test will be on Friday May 23rd. Here are some problems to help you review.

Spring 2012 Final. CS184 - Foundations of Computer Graphics. University of California at Berkeley

CS 481/681 Advanced Computer Graphics, Spring 2004 Take-Home Midterm Exam

1. Stereo Correspondence. (100 points)

AH Matrices.notebook November 28, 2016

CS 248 Assignment 2 Polygon Scan Converter. CS248 Presented by Abe Davis Stanford University October 17, 2008

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

EECS 487, Fall 2005 Exam 2

Part 3: 2D Transformation

Transforms. COMP 575/770 Spring 2013

Geometric Transformations

Mosaics. Today s Readings

MAT 343 Laboratory 4 Plotting and computer animation in MATLAB

Geometric Transformations and Image Warping

Introduction to Homogeneous Transformations & Robot Kinematics

N-Views (1) Homographies and Projection

CS 184, Fall 1996 Midterm #1 Professor: unknown

Introduction to Computer Vision. Week 3, Fall 2010 Instructor: Prof. Ko Nishino

Transcription:

Page 1 of 6 Exam November 1, 2006 This exam is closed book and closed notes. You will have the entire period (until 9:00pm) to complete the exam, although the exam is designed to take less time. Please write your name and CS login on every page! Write numerical answers in fractional form or use radicals (square root symbols) we would prefer to see than.866. You should not need a calculator for this exam. Unless otherwise noted, assume that everything is a right-handed coordinate system and that angles are measured counter clockwise. E.g. to find the direction of rotation, point your thumb along the axis and curl your fingers. If you need extra space, use the back of a page, but clearly mark what everything is. We may look at your work to determine partial credit. For the short answer questions, concise answers will be rewarded. One or two sentences should do the trick. Note: there are only 70 points on this exam (not 100). Total: / 70

Page 2 of 6 Question 1: (4 Points) Define metamer (in the sense used in graphics it has another meaning in chemisty): Metamers are colors that are perceptually indistinguishable. Two different distributions of light that cause the same sensor response. Question 2: (4 Points) If Lightness is linearly coded between 0 and 255, is the difference between 100 and 101, or the difference between 200 and 201 more noticeable (perceptually)? Explain your answer. 100 to 101 it s a 1% difference (while 200 to 201 is a.5% difference, and since the eye sees relative differences that s what matters) Question 3: (8 Points) A quadratic Bezier curve in 2D has its control points at (0,0), (6,6), and (12,0). What are the control points for an identical cubic Bezier curve? (0,0), (4,4), (8,4), (12,0) to match the derivatives, remember that the scaling factor for Beziers is the degree, so: 2(P1-P0) (for points on the quadratic) = 3(P1-P0) (for points on the cubic) Question 4: (5 Points) Which of the following things are artifacts from aliasing? Note: there might be several things that are aliasing, so mark each one as either A for aliasing or N (for not). _N_ A Zebra (black and white) appears gray in a resized picture this is actually evidence of proper sampling to remove the HF _A_ A Zebra appears all black in a resized picture classic point sampling artifact it gets unlucky and picks all black pixels _A_ A small line disappears when a picture is resized pre-filtering would have caused it to be spread out (and dimmed) and not missed _N_ A small dark line becomes a fatter dim line when a picture is resized see the answer above aliasing can make it fatter, but not dimmer _N_ A small black and white checkerboard pattern appears colorful when photographed with a digital camera. aliasing generally doesn t change colors if you can explain the obscure case if it might (in email to the professor), we might give you credit for this

Page 3 of 6 Question 5: (6 Points) For each of the properties, mark P if it is true of a perspective projection, O if its true of an orthographic projection, B if its true of both orthographic and projective, and N if its true of neither. (use P or O only if the property is only true of one type of transformation). _B_ Straight lines are mapped to straight lines _N_ Distances are preserved orthographic only preserves distances that are parallel to the view plane _N_ Angles are preserved _B_ An object can be viewed from its front, side or top _O_ Far away objects appear the same size as closer ones _P_ Requires homogeneous coordinates in order for it to be encoded into a linear transformation. Orthographic is an affine transformation Question 6: (6 Points) Let Aa be the alpha value from image A, Ac be the premultiplied color from image A, Ba be the alpha value from image B, and Bc be the premultipled color from image B. Assume alpha values range from 0 (totally transparent) to 1 (100% full, or fully opaque). One useful compositing operation that we did not discuss in class is the held-out or masked-by operator. If we do A held-out B, we see A only in the places that B isn t. Derive an expression that computes the resulting premultiplied color and alpha value for A held-out B. Your answers should be expressions that use the values Aa, Ba, Ac and Bc. Hint: consider what happens in the 4 overlap cases. You might want to make this clear in your work so we can give you partial credit in the event you get the final answer wrong. (1-Ba) Ac 4 cases: neither=0, A=A, B=0, A&B=0 (e.g. see A, only when it is just A) weight of that quadrant = A (!B) = Aa (1-Ba) since Ac is premultiplied, the answer is: (1-Ba) Ac

Page 4 of 6 Question 7: (7 Points) Let the signal F be [ 3 3 6 9 3 9 3 3 9 ] Let the kernel G be 1/3 [1 1 1] (assume that it is zero elsewhere) Compute F convolved with G using reflection to handle the boundaries of F. Your answer should be a signal that is the same length as F. Depending on how you do reflection, you could get: [ 3 4 6 6 7 5 5 5 5 ] or [ 3 4 6 6 7 5 5 5 7 ] (both are OK) There s a fine point: do the end values get repeated? With reflection the signal could either be: [6 3 3 3 3 6 9 3 9 3 3 9 9 3 3] or [9 6 3 3 3 6 9 3 9 3 3 9 3 3 9] I always think of it as the latter, but its hard for me to say the former is wrong. Questions 8 and 9: For the following questions, consider a simple graphics toolkit that works like OpenGL (that is, it has a matrix stack, and the transformation commands post-multiply themselves onto it): Translate(x,y) post-multiplies a translation matrix onto the top of the matrix stack Rotate(a) rotates (counter clockwise around the origin) by a degrees Scale((x,y) scales by x and y. BOTH X and Y MUST BE POSITIVE ReflectY() reflects around the Y axis (note: this changes the X positions) Push() pushes a copy of the top element on the matrix stack Pop() removes the top element from the matrix stack Block(letter) draws an alphabet block with the letter inside. The block is a unit square, with its lower left corner at (0,0) and its upper left corner at (1,1). You can assume that the letter A is symmetric about its vertical center, and the letters B, C, D and E are symmetric about their horizontal centers. Here s an example program and its output: Push Translate(2,2) Block( A ) Pop Block( B ) A B

B Page 5 of 6 Question 8: (6 Points) Notice that there is no ReflectX command to reflex about the X axis. Give a few lines of code (using the provided commands) that perform that function (of concatenating a reflection about the X axis on the stack). (note: the parameters for scale must both be positive, so that obvious solution is not allowed). Rot 90 Rot 180 reflecty or ReflectY Rot -90 Question 9: (10 points) Suppose the translate command was broken so that it only took values 0 or 1 for X and Y. (e.g. translate(1,0) or translate(1,1) or translate(0,1) work, but translate(2,0) would not). Give the shortest program you can think of for drawing the following picture (You will get no points for a program that draws the wrong picture, and will be penalized for your program being longer than the shortest possible answer). A C B Scale(3, 3) Block('C') Translate(0, 1) Scale(1/3, 1/3) Block('A') Scale(5,1) Translate(1, 0) Scale(1/5, 1) Block('B') ReflectY Scale(10,1) Trans(1,0) Scale(1/10,1) Block('B') If you got a correct picture with 14 lines or less, you get full credit. (bonus point if you found an even shorter answer) 1 point off for each extra line, for each illegal command (non-identity translate) 3 points off for each block that is in the wrong place (or has the letter wrong note the left B is backwards)

Page 6 of 6 Question 10: (6 Points) The Catmull-Rom Basis Matrix is: 0 1 0 0-1/2 0 ½ 0 1-5/2 2-1/2-1/2 3/2-3/2 ½ A Catmull-Rom spline segment has its control points at (5 2/3,5 3/4), (10 1/2,10), (20 7/8,10), and (25 3/8,5). What is the value of the spline at u=1? (20 7/8, 10) it interpolates P2 (the matrix is a red herring) What is the 1 st derivative (a vector) at u=1? (7 7/16, -5/2) = (P4-P2)/2 Question 11: (2 Points) Given a rotation matrix R and a translation matrix T, the composition R -1 TR is equivalent to: a) A rotation b) A translation c) A shear d) A scale e) None of the above Question 12: (2 Points) What is the effect of transforming a 3D object by the following 4x4 matrix, assuming we are working in homogeneous coordinates? 3 0 0 0 a) Translates the object 0 3 0 0 0 0 3 0 0 0 0 3 b) Scales the object up c) Scales the object down d) Produces a perspective view of the object e) Does nothing to the object Question 13: (4 Points) A robot designer creates a synthetic monkey with a vision system that is similar to a new world monkey in that it has two types of photo receptors. The designer makes one type of photoreceptor sensitive only to green light, and the other type only sensitive to red light. The robot passes its tests for identifying bananas in pictures presented on the CRT screen of the designer s computer, but cannot find bananas in the jungle. Explain: The photoreceptors don t see yellow light. The monitor doesn t actually display yellow it only displays red and green. We (and the monkey) are faked into thinking its yellow. Or, to use the terminology from Q1: yellow and red-green are metamers.