Final Exam Due on Sunday 05/06

Similar documents
Multiple View Geometry in Computer Vision

CSE 252B: Computer Vision II

Midterm Exam. CS283, Computer Vision Harvard University. Nov. 20, 2009

CS4495/6495 Introduction to Computer Vision. 3D-L3 Fundamental matrix

MAT 211, Spring 2015, Introduction to Linear Algebra.

Topic 2-2: Derivatives of Vector Functions. Textbook: Section 13.2, 13.4

Multiple View Geometry in Computer Vision

Linear Algebra Massoud Malek

Lecture 5. Epipolar Geometry. Professor Silvio Savarese Computational Vision and Geometry Lab. 21-Jan-15. Lecture 5 - Silvio Savarese

UNIVERSITY OF MANITOBA

Solutions for Math 225 Assignment #5 1

Linear Algebra Review. Fei-Fei Li

11 a 12 a 21 a 11 a 22 a 12 a 21. (C.11) A = The determinant of a product of two matrices is given by AB = A B 1 1 = (C.13) and similarly.

Course Notes Math 275 Boise State University. Shari Ultman

Camera calibration Triangulation

Spring /11/2009

Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix

Visual Object Recognition

Written Examination

CSE 252B: Computer Vision II

Exam in TMA4195 Mathematical Modeling Solutions

MATH 3321 Sample Questions for Exam 3. 3y y, C = Perform the indicated operations, if possible: (a) AC (b) AB (c) B + AC (d) CBA

Linear Algebra Review. Fei-Fei Li

2018 Fall 2210Q Section 013 Midterm Exam I Solution

MATH20411 PDEs and Vector Calculus B

Topic 2.3: The Geometry of Derivatives of Vector Functions

MA/OR/ST 706: Nonlinear Programming Midterm Exam Instructor: Dr. Kartik Sivaramakrishnan INSTRUCTIONS

Calculus C (ordinary differential equations)

EE Camera & Image Formation

MATH 425, FINAL EXAM SOLUTIONS

APPM 2360: Final Exam 10:30am 1:00pm, May 6, 2015.

Lecture 7 Spectral methods

Pose estimation from point and line correspondences

0, such that. all. for all. 0, there exists. Name: Continuity. Limits and. calculus. the definitionn. satisfying. limit. However, is the limit of its

YORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #2 Solutions

10.3 Parametric Equations. 1 Math 1432 Dr. Almus

Sec. 1.1: Basics of Vectors

This is a closed book exam. No notes or calculators are permitted. We will drop your lowest scoring question for you.

Multiple Choice. 1.(6 pts) Find symmetric equations of the line L passing through the point (2, 5, 1) and perpendicular to the plane x + 3y z = 9.

Topic 5.1: Line Element and Scalar Line Integrals

CALCULUS ON MANIFOLDS. 1. Riemannian manifolds Recall that for any smooth manifold M, dim M = n, the union T M =

Principal Component Analysis (PCA) CSC411/2515 Tutorial

Structural Dynamics A Graduate Course in Aerospace Engineering

3. Identify and find the general solution of each of the following first order differential equations.

Determining the Translational Speed of a Camera from Time-Varying Optical Flow

Colour. The visible spectrum of light corresponds wavelengths roughly from 400 to 700 nm.

10. Smooth Varieties. 82 Andreas Gathmann

Linear Algebra & Geometry why is linear algebra useful in computer vision?

A Practical Method for Decomposition of the Essential Matrix

LINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS

Module 07 Controllability and Controller Design of Dynamical LTI Systems

Camera Models and Affine Multiple Views Geometry

Deuxième examen partiel A 2013

Math 5587 Midterm II Solutions

EIGENVALUES AND EIGENVECTORS 3

2.2 THE DERIVATIVE 2.3 COMPUTATION OF DERIVATIVES: THE POWER RULE 2.4 THE PRODUCT AND QUOTIENT RULES 2.6 DERIVATIVES OF TRIGONOMETRIC FUNCTIONS

154 Chapter 9 Hints, Answers, and Solutions The particular trajectories are highlighted in the phase portraits below.

MTHE 227 Problem Set 2 Solutions

Name: ID.NO: Fall 97. PLEASE, BE NEAT AND SHOW ALL YOUR WORK; CIRCLE YOUR ANSWER. NO NOTES, BOOKS, CALCULATORS, TAPE PLAYERS, or COMPUTERS.

Lecture 13 - Wednesday April 29th

1. Find the solution of the following uncontrolled linear system. 2 α 1 1

a b c d e GOOD LUCK! 3. a b c d e 12. a b c d e 4. a b c d e 13. a b c d e 5. a b c d e 14. a b c d e 6. a b c d e 15. a b c d e

Problem Set Number 5, j/2.036j MIT (Fall 2014)

A Study of Kruppa s Equation for Camera Self-calibration

b) The system of ODE s d x = v(x) in U. (2) dt

Course Summary Math 211

Math 164-1: Optimization Instructor: Alpár R. Mészáros

GI07/COMPM012: Mathematical Programming and Research Methods (Part 2) 2. Least Squares and Principal Components Analysis. Massimiliano Pontil

The structure tensor in projective spaces

n=0 ( 1)n /(n + 1) converges, but not

STUDENT NAME: STUDENT SIGNATURE: STUDENT ID NUMBER: SECTION NUMBER RECITATION INSTRUCTOR:

Final 09/14/2017. Notes and electronic aids are not allowed. You must be seated in your assigned row for your exam to be valid.

Good Problems. Math 641

Spring /06/2009

THEODORE VORONOV DIFFERENTIABLE MANIFOLDS. Fall Last updated: November 26, (Under construction.)

A Study of Numerical Elimination for the Solution of Multivariate Polynomial Systems

Math Ordinary Differential Equations

Math 3B: Lecture 1. Noah White. September 23, 2016

Georgia Tech PHYS 6124 Mathematical Methods of Physics I

Math Abstract Linear Algebra Fall 2011, section E1 Practice Final. This is a (long) practice exam. The real exam will consist of 6 problems.

The value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.

PH.D. PRELIMINARY EXAMINATION MATHEMATICS

1. (16) A point charge e moves with velocity v(t) on a trajectory r(t), where t is the time in some lab frame.

Overview of vector calculus. Coordinate systems in space. Distance formula. (Sec. 12.1)

Proton Therapy: 3D Reconstructions from 2D Images

The Hilbert Space of Random Variables

CSE 554 Lecture 6: Deformation I

a b c d e GOOD LUCK! 3. a b c d e 12. a b c d e 4. a b c d e 13. a b c d e 5. a b c d e 14. a b c d e 6. a b c d e 15. a b c d e

Exam 2 MAS 3105 Applied Linear Algebra, Spring 2018

Linear Algebra Practice Problems

Introduction to Machine Learning

Lectures in Discrete Differential Geometry 2 Surfaces

Exam 2. Jeremy Morris. March 23, 2006

Single view metrology

1. Classifying Spaces. Classifying Spaces

RUTGERS UNIVERSITY GRADUATE PROGRAM IN MATHEMATICS Written Qualifying Examination August, Session 1. Algebra

Review For the Final: Problem 1 Find the general solutions of the following DEs. a) x 2 y xy y 2 = 0 solution: = 0 : homogeneous equation.

Two-View Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix

MATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018

Unit Speed Curves. Recall that a curve Α is said to be a unit speed curve if

Transcription:

Final Exam Due on Sunday 05/06 The exam should be completed individually without collaboration. However, you are permitted to consult with the textbooks, notes, slides and even internet resources. If you need hints, please send the instructor emails or come by the office for discussions. Problems are equally weighted. Problem 1 Terms and Definitions Briefly answer the following questions. 1. What are camera s intrinsic and extrinsic (calibration) parameters? 2. What are epipoles and epipolar lines? 3. Explain why the rank of the fundamental matrix is two. 4. What is the Rayleigh quotient? How does it associate with the generalized eigenvalue problem? 5. What is disparity? And what are the epipolar and continuity constraints in stereo correspondence? Problem 2 LevelSet and Segmentation We discussed image segmentation using active contour in class. In this problem, we will work out the mathematics in some details. The main idea is to define a speed function on the image using information extracted from the image and the geometry of the contour. Starting with an initial contour, the speed function F tells us how to evolve the contour in order to get to the target. For example, suppose a contour c = c(t) is given with t the parameter. If p denotes a point on the contour, F (p) gives the instantaneous speed in the normal direction to the contour at that point. That is, if n is the unit normal of the contour at p and V (p) is the velocity of the point p, F (p) = V (p) n. The idea of the level-set based technique is to embed the contour c as the zero level-set of a function Φ(x, y, t) = Φ t (x, y). At any time t = T, the contour is given as c = Φ 1 t=t (0), i.e., the points at which Φ t=t is zero. 1 For example, let Φ t (x, y) = x 2 + y 2 + t 100. What are the zero level-sets of Φ at t = 0, 19 and 36? 2 Determine the speed function F for the example above. In the example above, we are given the values of Φ at every t. In general, only the values of Φ at t = 0 are given, and its values at other time instances are determined by solving a partial differential equation, which we will derive. 3 Let c α denote the contour Φ 1 α (0). Show that the unit normal vector at a point p on the contour is given by Φ α Φ α. 4 Show that the partial differential equation for Φ is given by Φ t + F Φ = 0. 1

This is a straightforward problem: take the total derivatives of Φ(x(t), y(t), t) with respect to t and use (3) above. See the figure. Figure 1: The evolving contour at two different times t = a, b. One point p on the contour is marked and the blue path is the path it travelled between t = a and t = b. Let (x(t), y(t)) denote this path. We have Φ(x(t), y(t), t) = 0 for all t (Why?). Of course, (x (t), y (t)) gives the velocity (not speed!) of the point p at time t. Problem 3 Epipolar Geometry Recall that a camera matrix P is a 3 4 matrix. For a point x given in the homogeneous coordinates x = [x 1 x 2 x 3 x 4 ] t, the corresponding point (again in homogeneous coordinates) on the image is given by P x. One important and useful result that we did not discuss in details is how to find a correct pair of camera matrices given a fundamental matrix F. This result is important because it allows us to start the projective reconstruction (See class slides). 1. We know that the fundamental matrix is a 3 3 matrix with rank two. This implies that its determinant is zero. What is the degree of freedom of a fundamental matrix? 2. Briefly describe how to compute the fundamental matrix using pairs of corresponding pixels (image points). 3. A 4 4 matrix S is skew-symmetric if and only if for every 4 1 vector X, X t SX = 0. Show that a non-zero matrix F is the fundamental matrix corresponding to a pair of camera matrices P 1, P 2 if and only if P t 2F P 1 is skew-symmetric. (This is a very simple problem. Argue geometrically from the fact that every pair of corresponding image points arises from a 3D point, which is expressed in homogeneous coordinates.) 4. Let (P 1, P 2 ) and (P 1, P 2) be two pairs of camera matrices such that P 1 = P 1 H, P 2 = P 2 H for some 4 4 nonsingular matrix H. Show that the fundamental matrices corresponding to these two pairs of camera matrices are the same. 5. Let P = K[R t] denote a camera matrix, where K and R are nonsingular 3 3 matrices that give the intrinsic camera parameters and the rotation (with respect to some world frame), respectively. t 2

is the translational component. Show that there is a nonsingular 4 4 matrix H that puts P into the standard form P H = [I 0], where I is the 3 3 identity matrix. 6. Let P 1 = [I 0] and P 2 = [M m] be two camera matrices, where M is a 3 3 (nonsingular) matrix. Show that their fundamental matrix is given by the formula F = [m] M, where [m] is the matrix [m] = 0 m z m y m z 0 m x m y m x 0 Notice that given any vector u, [m] u is the cross product between m and u. straightforward problem. See the slides.). (Again, this is a 7. Given F in the form above. What can you say about the last column m of P 2? (Hint: It is one of the two epipoles. Which one?) 8. Finally, let e denote the epipole determined above. If F denotes a given fundamental matrix, show that a correct pair of camera matrices compatible with F is given by P 1 = [I 0], P 2 = [[e] F e]. (You have to use (3) above.) Problem 4 Shape and Illumination In this problem, we will prove a simplified version of the following result: Given two images I and J, and two linearly independent vectors s, l IR 3, there exists a Lambertian surface S such that the images of S taken under lighting conditions (point sources at infinity) specified by s and l are I and J, respectively. A direct and (rather) counterintuitive consequence of this result is that given two images, it is not possible with absolute certainty to determine whether they are created by the same or different objects! A. Recall that for a Lambertian surface, the radiance (pixel intensity) I at each surface point under a point source at infinity is given by the formula I = ρ max{ L ˆn, 0}, where ρ is the albedo, L is the lighting direction and strength and ˆn is the unit normal vector at the given surface point. We assume infinitesimal pixels; therefore, an image is considered as a nonnegative function defined on a rectangular domain in IR 2, and the two images have the same domain. For this problem, you need to come up with a surface z = f(x, y) for some smooth function f(x, y) that will account for the two given images taken under the two lighting conditions. You have to describe a method (or procedure) that computes f(x, y) given I, J, s and l. For simplicity, you can assume the followings: 1. Intensity is given by the simplified formula I = ρ L ˆn. That is, we don t consider the backside of the surface. 3

2. The two vectors l, s are [1, 0, 1] t and [ 1, 0, 1] t, respectively. The general case follows from a coordinate transform. 3. You do not need to consider the shadow cast by the object onto itself. 4. The two images do not vanish simultaneously, I(x, y) + J(x, y) > 0 for all x, y. 5. Given an ordinary differential equation (ODE) and an one-parameter family of smooth initial conditions (with smooth functions g and h) dz(x) dx = g(x, y), z(0) = h(y), there exists a smooth function Z(x, y) such that Z(0, y) = h(y) and for each fixed y, Z(x, y) is the solution of the above ODE. Hint: The problem statement looks daunting at first, but the problem is not difficult. See the figure. Find an ODE that does the reconstruction over one scanline and patch these curves together using (5) to yield the surface z = f(x, y). The main point is to come up with the correct ODE and argue with it. Use these two equations I(x, y) = ρ(x, y) s ˆn(x, y) = ŝ n(x, y), J(x, y) = ρ(x, y) l ˆn(x, y) = ˆl n(x, y), to figure out the correct tangent vector along each scanline. Recall also that the tangent vector of a curve c(t) = (x(t), y(t), z(t)) is c (t) = (x (t), y (t), z (t)). B. Is there an analogous result for three arbitrary images? Explain. Figure 2: Find an ordinary differential equation that computes the curve c(t) over one horizonal scanline. 4

Problem 5 Principal Component Analysis (PCA) Principal Component Analysis is so ubiquitous these days that I feel obliged to include it. For simplicity, we will work in IR 2. Let p 1,, p K be K data points in IR 2 centered at the origin. We want to find a line L passing through the origin that best approximates the data points, i.e., the line L minimizes the following error function, K E(L) = dist(l, p i ) 2, where dist is the distance between the line L and p i. The line L can be represented by a unit vector u parallels to it. Using Pythagorean theorem, the above sum of squares becomes K K K E(L) = p t ip i u t p i p t i u = p t ip i u t S u, where S = K p ip t i is the covariance matrix. 1. For each data point p i, show that Tr(p i p t i ) = p i 2, where Tr is the trace of the matrix. 2. Show that Tr(S) is K pt i p i. Note that S is symmetric and positive definite (assuming the data is not degenerated); therefore, it has two positive eigenvalues. 3. Show that u ( and L) can be determined by taking the (unit) eigenvector of S corresponding to the largest eigenvalue. 4. Let L be the line (and u the corresponding unit vector) determined above. What is E(L)? Hint: Use the results above, and in case you forgot an important property of Tr that is needed here, the following website should be helpful, http://en.wikipedia.org/wiki/trace_%28linear_algebra%29 5. Suppose now that we know the line L is given by the equation x y = 0. Furthermore, we also know that K pt i p i = 2 and E(L) = 1 2. What is the covariance matrix S? 5