Instructions

Your final upload should have the files arranged in this layout:

<ust login id>.zip

• <ust-login-id>/
  • <ust-login-id>.pdf
  • matlab/

camera2.m (provided)

displayEpipolarF.m (provided)

eightpoint.m (Section 3.1.1)

epipolarCorrespondence.m (Section 3.1.2)

epipolarMatchGUI.m (provided)

essentialMatrix.m (Section 3.1.3)

p2t.m (provided)

testDepth.m (provided)

testRectify.m (provided)

refineF.m (provided)

rectify pair.m (Section 3.2.1)

testTempleCoords.m (Section 3.1.5)

triangulate.m (Section 3.1.4)

warp stereo.m (provided)

Any other helper functions you need

ec/ (optional for extra credit)

get disparity.m (Section 3.2.2)

get depth.m (Section 3.2.3)

estimate params.m (Section 3.3.2)

estimate pose.m (Section 3.3.1)

projectCAD.m (Section 3.3.3)

testPose.m (provided)

testKRt.m (provided)

Please make sure you do follow the submission rules mentioned above before uploading your zip file to CASS. Assignments that violate this submission rule will be penalized by up to 10% of the total score.

7. File paths: Please make sure that any file paths that you use are relative and not absolute.

Not imread(/name/Documents/subdirectory/hw1/data/xyz.jpg) but imread(../data/xyz.jpg).

1 Overview

One of the major areas of computer vision is 3D reconstruction. Given several 2D images of an environment, can we recover the 3D structure of the environment, as well as the position of the camera/robot? This has many uses in robotics and autonomous systems, as understanding the 3D structure of the environment is crucial to navigation. You dont want your robot constantly bumping into walls, or running over human beings!

Figure 1: Example of a robot using SLAM, a 3D reconstruction and localization algorithm

In this assignment there are two programming parts: sparse reconstruction and dense reconstruction. Sparse reconstructions generally contain a number of points, but still manage to describe

Figure 2: The two temple images we have provided to you.

the objects in question. Dense reconstructions are detailed and fine grained. In fields like 3D modelling and graphics, extremely accurate dense reconstructions are invaluable when generating 3D models of real world objects and scenes.

In Part 1, you will be writing a set of functions to generate a sparse point cloud for some test images we have provided to you. The test images are 2 renderings of a temple from two different angles. We have also provided you with a mat file containing good point correspondences between the two images. You will first write a function that computes the fundamental matrix between the two images. Then write a function that uses the epipolar constraint to find more point matches between the two images. Finally, you will write a function that will triangulate the 3D points for each pair of 2D point correspondences.

We have provided you with a few helpful mat files. someCorresps.mat contains good point correspondences. You will use this to compute the Fundamental matrix. intrinsics.mat contains the intrinsic camera matrices, which you will need to compute the full camera projection matrices. Finally templeCoords.mat contains some points on the first image that should be easy to localize in the second image.

In Part 2, we utilize the extrinsic parameters computed by Part 1 to further achieve dense 3D reconstruction of this temple. You will need to compute the rectification parameters. We have provided you with testRectify.m (and some helper functions) that will use your rectification function to warp the stereo pair. You will then optionally use the warped pair to compute a disparity map and finally a dense depth map.

In both cases, multiple images are required, because without two images with a large portion overlapping the problem is mathematically underspecified. It is for this same reason biologists suppose that humans, and other predatory animals such as eagles and dogs, have two front facing eyes. Hunters need to be able to discern depth when chasing their prey. On the other hand herbivores, such as deer and squirrels, have their eyes position on the sides of their head, sacrificing most of their depth perception for a larger field of view. The whole problem of 3D reconstruction is inspired by the fact that humans and many other animals rely on dome degree of depth perception when navigating and interacting with their environment. Giving autonomous systems this information is very useful.

Figure 3: Camera and light source triangle diagram

2 Theory

2.1 Triangulation (5 points)

Structured light is a general way of retrieving 3D structure from a stationary camera. One very interesting way to do this is by using a light source and a thin shadow (maybe cast by a pencil).

See http://www.vision.caltech.edu/bouguetj/ICCV98/ for an example.

This scheme uses a stationary lamp, and a stationary camera. Then a thin wand is waved above the object, and a shadow plane is cast. From the camera view, you know the angle to a point on the object is , and from the position of the wand, you know the angle at which the shadow is cast from the light source is You also know how far the camera is from the light source, so you know the baseline distance b. Given this information, how can you recover the position of the point in the scene? In other words, can you represent the coordinates (x,z) of the point P by only b,,?

2.2 Fundamental Matrix (15 points)

Suppose two cameras fixate on a point P (see Figure 4) in space such that their optical axes intersect at that point. Show that if the image coordinates are normalized so that the coordinate origin (0,0) coincides with the principal point, the F₃₃ element of the fundamental matrix F is zero.

Figure 4: Figure for Question 2.2. C₁ and C₂ are the optical centers. The principal axes intersect at point P.

3 Programming

3.1 Sparse Reconstruction

In this section, you will be writing a set of function to compute the sparse reconstruction from two sample images of a temple. You will first estimate the Fundamental matrix, compute point correspondences, then plot the results in 3D. It may be helpful to read through Section 3.1.5 right now. In Section 3.1.5 we ask you to write a testing script that will run your whole pipeline. It will be easier to start that now and add to it as you complete each of the questions one after the other.

3.1.1 Implement the eight point algorithm: (10 points)

In this question, youre going to use the eight point algorithm which is covered in class to estimate the fundamental matrix. Please use the point correspondences provided in someCorresp.mat. Write a function with the following signature: function F = eightpoint(pts1, pts2, M)

where x1 and x2 are N 2 matrices corresponding to the (x,y) coordinates of the N points in the first and second image respectively. M is a scale parameter.

• Normalize points and un-normalize F: You should scale the data by dividing each coordinate by M (the maximum of the images width and height). After computing F, you will have to unscale the fundamental matrix.
• You must enforce the rank 2 constraint on F before unscaling. Recall that a valid fundamental matrix F will have all epipolar lines intersect at a certain point, meaning that there exists a non-trivial null space for F. In general, with real points, the eightpoint solution for F will not come with this condition. To enforce the rank 2 condition, decompose F with SVD to get the three matrices U, , V such that F = UV^T. Then force the matrix to be rank 2 by setting the smallest singular value in to zero, giving you a new ⁰. Now compute the proper fundamental matrix with F⁰ = U⁰V^T.
• You may find it helpful to refine the solution by using local minimization. This probably wont fix a completely broken solution, but may make a good solution better by locally minimizing a geometric cost function. For this we have provided m (takes in Fundamental matrix and the two sets of points), which you can call from eightpoint before unscaling F. This function uses matlabs fminsearch to non-linearly search for a better F that minimizes the cost function. For this to work, it needs an initial guess for F that is already close to the minimum.
• Remember that the x-coordinate of a point in the image is its column entry and ycoordinate is the row entry. Also note that eight-point is just a figurative name, it just means that you need at least 8 points; your algorithm should use an over-determined system (N > 8 points).
• To test your estimated F, use the provided function m (takes in F and the two images). This GUI lets you select a point in one of the images and visualize the corresponding epipolar line in the other image like in Figure 5

In your write-up: Please include your recovered F and the visualization of some epipolar lines (similar to Figure 5).

Figure 5: Epipolar lines visualization from displayEpipolarF.m

3.1.2 Find epipolar correspondences: (20 points)

To reconstruct a 3D scene with a pair of stereo images, we need to find many point pairs. A point pair is two points in each image that correspond to the same 3D scene point. With enough of these pairs, when we plot the resulting 3D points, we will have a rough outline of the 3D object. You found point pairs in the previous homework using feature detectors and feature descriptors, and testing a point in one image with every single point in the other image. But here we can use the fundamental matrix to greatly simplify this search.

Figure 6: Epipolar Geometry (source Wikipedia)

Recall from class that given a point x in one image (the left view in Figure 6). Its corresponding 3D scene point p could lie anywhere along the line from the camera center o to the point x. This line, along with a second images camera center o⁰ (the right view in Figure 6) forms a plane. This plane intersects with the image plane of the second camera, resulting in a line l⁰ in the second image which describes all the possible locations that x may be found in the second image. Line l⁰ is the epipolar line, and we only need to search along this line to find a match for point x found in the first image.

Write a function with the following signature:

function pts2 = epipolarCorrespondence(im1, im2, F, pts1)

where im1 and im2 are the two images in the stereo pair. F is the fundamental matrix computed for the two images using your eightpoint function. pts1 is an N 2 matrix containing the (x,y) points in the first image. Your function should return pts2, an N 2 matrix, which contains the corresponding points in the second image.

• To match one point x in image 1, use fundamental matrix to estimate the corresponding epipolar line l⁰ and generate a set of candidate points in the second image.
• For each candidate points x⁰, a similarity score between x and x⁰ is computed. The point among candidates with highest score is treated as epipolar correspondence.
• There are many ways to define the similarity between two points. Feel free to use whatever you want and describe it in your write-up. One possible solution is to select a small window of size w around the point x. Then compare this target window to the window of the candidate point in the second image. For the images we gave you, simple Euclidean distance or Manhattan distance should suffice. Manhattan distance was not covered in class. Consider Googling it.
• Remember to take care of data type and index range.

You can use epipolarMatchGui.m to visually test your function. Your function does not need to be perfect, but it should get most easy points correct, like corners, dots etc

In your write-up: Include a screen shot of epipolarMatchGui running with your implementation of epipolarCorrespondence. Mention the similarity metric you decided to use. Also comment on any cases where your matching algorithm consistently fails, and why you might think this is.

3.1.3 Write a function to compute the essential matrix: (10 points)

In order to get the full camera projection matrices we need to compute the Essential matrix.

So far, we have only been using the Fundamental matrix. Write a function with the following signature: function E = essentialMatrix(F, K1, K2)

where F is the Fundamental matrix computed between two images, K1 and K2 are the intrinsic camera matrices for the first and second image respectively (contained in intrinsics.mat). E is the computed essential matrix. The intrinsic camera parameters are typically acquired through camera calibration.

Refer to the class slides for the relationship between the Fundamental matrix and the Essential matrix.

In your write-up: Write your estimated E matrix for the temple image pair we gave you.

3.1.4 Implement triangulation: (20 points)

Write a function to triangulate pairs of 2D points in the images to a set of 3D points with the signature:

function pts3d = triangulate(P1, pts1, P2, pts2) where pts1 and pts2 are the N 2 matrices with the 2D image coordinates and pts3d is an N 3 matrix with the corresponding 3D points (in all cases, one point per row). P1 and P2 are the 34 camera projection matrices. Remember that you will need to multiply the given intrinsic matrices with your solution for the extrinsic camera matrices to obtain the final camera projection

Figure 7: Epipolar Match visualization. A few errors are alright, but it should get most easy points correct (corners, dots, etc)

matrices. For P1 you can assume no rotation or translation, so the extrinsic matrix is just [I|0]. For P2, pass the essential matrix to the provided camera2.m function to get four possible extrinsic matrices. You will need to determine which of these is the correct one to use (see hint in Section

3.1.5).

Refer to the class slides for one possible triangulation algorithm. Once you have it implemented, check the performance by looking at the re-projection error. To compute the re-projection error, project the estimated 3D points back to the image 1(2) and compute the mean Euclidean error between projected 2D points and pts1(2).

In your write-up: Describe how you detemined which extrinsic matrices is correct. Note that simply rewording the hint is not enough. Report your re-projection error using pts1, pts2 from someCorresp.mat. If implemented correctly, the re-projection error should be less than 1 pixel.

3.1.5 Write a test script that uses templeCoords: (10 points)

You now have all the pieces you need to generate a full 3D reconstruction. Write a test script testTempleCoords.m that does the following:

1. Load the two images and the point correspondences from mat
2. Run eightpoint to compute the fundamental matrix F
3. Load the points in image 1 contained in mat and run your epipolarCorrespondences on them to get the corresponding points in image 2
4. Load mat and compute the essential matrix E.
5. Compute the first camera projection matrix P₁ and use m to compute the four candidates for P₂

Figure 8: Sample Reconstructions

6. Run your triangulate function using the four sets of camera matrix candidates, the points from mat and their computed correspondences. 7. Figure out the correct P₂ and the corresponding 3D points.

Hint: Youll get 4 projection matrix candidates for camera 2 from the essential matrix. The correct configuration is the one for which most of the 3D points are in front of both cameras (positive depth).

7. Use matlabs plot3 function to plot these point correspondences on screen
8. Save your computed rotation matrix (R1, R2) and translation (t1, t2) to the file

../data/extrinsics.mat. These extrinsic parameters will be used in the next section.

We will use your test script to run your code, so be sure it runs smoothly. In particular, use relative paths to load files, not absolute paths.

In your write-up: Include 3 images of your final reconstruction of the templeCoords points, from different angles.

3.2 Dense Reconstruction

In applications such as 3D modelling, 3D printing, and AR/VR, a sparse model is not enough. When users are viewing the reconstruction, it is much more pleasing to deal with a dense reconstruction. To do this, it is helpful to rectify the images to make matching easier. In this section, you will be writing a set of functions to perform a dense reconstruction on our temple examples. Given the provided intrinsic and computed extrinsic parameters, you will need to write a function to compute the rectification parameters of the two images. The rectified images are such that the epipolar lines are horizontal, so searching for correspondences becomes a simple linear. This will be done for every point. Finally, you can optionally compute the disparity and depth map.

3.2.1 Image Rectification (10 points)

Write a program that computes rectification matrices.

function [M1,M2,K1n,K2n,R1n,R2n,t1n,t2n] = rectify pair (K1,K2,R1,R2,t1,t2)

This function takes left and right camera parameters (K,R,t) and returns left and right rectification matrices (M1,M2) and updated camera parameters. You can test your function using the provided script testRectify.m.

From what we learned in class, the rectify pair function should consecutively run the following steps:

1. Compute the optical center c₁ and c₂ of each camera by c = (KR)¹(Kt).
2. Compute the new rotation matrix R_e = [r₁ r₂ r₃]^T where r₁,r₂,r₃ R³¹ are orthonormal vectors that represent x-, y-, and z-axes of the camera reference frame, respectively.
   • The new x-axis (r₁) is parallel to the baseline: r₁ = (c₁ c₂)/||c₁ c₂||.
   • The new y-axis (r₂) is orthogonal to x and to any arbitrary unit vector, which we set to be the z unit vector of the old left matrix: r₂ is the cross product of R₁(3,🙂^T and r₁.
   • The new z-axis (r₃) is orthogonal to x and y: r₃ is the cross product of r₂ and r₁.
3. Compute the new intrinsic parameter K_e . We can use an arbitrary one. In our test code, we just let .
4. Compute the new translation: t₁ = Rc_{e 1}, t₂ = Rc_{e 2}.
5. Finally, the rectification matrix of the first camera can be obtained by

M1 = (Ke1Re1)(KR)1 (1)

M₂ can be computed from the same formula.

Once you have finished, run testRectify.m (Be sure to have the extrinsics saved by your testTempleCoords.m). This script will test your rectification code on the temple images using the provided intrinsic parameters and your computed extrinsic paramters. It will also save the estimated rectification matrix and updated camera parameters in temple.mat, which will be used by the next test script testDepth.m.

In your write-up: Include a screen shot of the result of running testRectify.m on temple images. The results should show some epipolar lines that are perfectly horizontal, with corresponding points in both images lying on the same line.

3.2.2 Dense window matching to find per pixel disparity (extra credit) (20 points)

Write a program that creates a disparity map from a pair of rectified images (im1 and im2).

function dispM = get disparity(im1,im2,maxDisp,windowSize) where maxDisp is the maximum disparity and windowSize is the window size. The output dispM has the same dimension as im1 and im2. Since im1 and im2 are rectified, computing correspondences is reduced to a 1-D search problem.

The dispM(y, x) is

dispM(y,x) = arg min dist(im1(y,x),im2(y,x d)), (2)

0dmaxDisp

where dist(im1(y,x),im2im2(y + i,x + j d))² with w is (windowSize 1)/2. This summation on the window can be easily computed by using the conv2 Matlab function (i.e. convolve with a mask of ones(windowSize,windowSize)) Note that this is not the only way to implement this.

3.2.3 Depth map (extra credit) (10 points)

Write a function that creates a depth map from a disparity map (dispM).

function depthM = get depth(dispM,K1,K2,R1,R2,t1,t2)

Use the fact that depthM(y,x) = b f/dispM(y,x) where b is the baseline and f is the focal length of camera. For simplicity, assume that b = ||c₁ c₂|| (i.e., distance between optical centers) and f = K₁(1,1). Finally, let depthM(y,x) = 0 whenever dispM(y,x) = 0 to avoid dividing by 0.

You can now test your disparity and depth map functions using testDepth.m. Be sure to have the rectification saved (by running testRectify.m). This function will rectify the images, then compute the disparity map and the depth map.

In your write-up: Include images of your disparity map and your depth map.

3.3 Pose Estimation (Extra Credit)

In this section, you will implement what you have learned on class to estimate both the intrinsic and extrinsic parameters of camera given 2D points x on image and their corresponding 3D points X. In other words, given a set of matched points {X_i,x_i} and camera model

(X;p) = , (3)

we want to find the estimate of the camera matrix P R³⁴, as well as intrinsic parameter matrix K R³³, camera rotation R R³³ and camera translation t R³, such that

P = K[R|t]. (4)

3.3.1 Estimate camera matrix P (10 points)

Write a function that estimates the camera matrix P given 2D and 3D points x,X.

function P = estimate pose(x, X),

where x is 2 N matrix denoting the (x,y) coordinates of the N points on the image plane and X is 3 N matrix denoting the (x,y,z) coordinates of the corresponding points in the 3D world. Recall that this camera matrix can be computed using the same strategy as homography estimation by Direct Linear Transform (DLT). Once you finish this function, you can run the provided script testPose.m to test your implementation.

In your write-up: Include the output of the script testPose.

3.3.2 Estimate intrinsic/extrinsic parameters (20 points)

Write a function that estimates both intrinsic and extrinsic parameters from camera matrix.

function [K, R, t] = estimate params(P)

From what we learned on class, the estimate params should consecutively run the following steps:

1. Compute the camera center c by using SVD. Hint: c is the eigenvector corresponding to the smallest eigenvalue.
2. Compute the intrinsic K and rotation R by using QR decomposition. K is a right upper triangle matrix while R is a orthonormal matrix. Checking this answer^[1] might help.
3. Compute the translation by t = Rc.

Once you finish your implementation, you can run the provided script testKRt.m. In your write-up: Include the output of the script testKRt.

3.3.3 Project a CAD model to the image (20 points)

Now you will utilize what you have implemented to estimate the camera matrix from a real image,shown in Figure 9(left), and project the 3D object (CAD model), shown in Figure 9(right), back on to the image plane.

Figure 9: The provided image and 3D CAD model

Write a script projectCAD.m that does the following:

1. Load an image image, a CAD model cad, 2D points x and 3D points X from mat.
2. Run estimate pose and estimate params to estimate camera matrix P, intrinsic matrix K, rotation matrix R, and translation t.
3. Use your estimated camera matrix P to project the given 3D points X onto the image.
4. Plot the given 2D points x and the projected 3D points on screen. An example is shown in Figure 10(left). Hint: use plot.
5. Draw the CAD model rotated by your estimated rotation R on screen. An example is shown in Figure 10(middle). Hint: use trimesh.
6. Project the CADs all vertices onto the image and draw the projected CAD model overlapping with the 2D image. An example is shown in Figure 10(right). Hint: use patch.

In your write-up: Include the three images similar to Figure 10. You have to use different colors from Figure 10. For example, green circle for given 2D points, black points for projected 3D points, blue CAD model, and red projected CAD model overlapping on the image. You will get NO credit if you use the same color.

Figure 10: Project a CAD model back onto the image. Left: the image annotated with given 2D points (blue circle) and projected 3D points (red points); Middle: the CAD model rotated by estimated R; Right: the image overlapping with projected CAD model.

[1] http://math.stackexchange.com/questions/1640695/rq-decomposition