Depth Mapping Algorithm Performance Analysis

Introduction

We will implement various disparity estimation algorithms and compare their performance.

Background

Disparity and Depth

Depth information about a scene can be captured using a stereo camera (2 cameras that are separated horizontally but aligned vertically). The stereo image pair taken by the stereo camera contains this depth information in the horizontal differences (when comparing the stereo image pair, objects closer to the camera will be more horizontally displaced). These differences (also called disparities) can be used to determine the relative distance from the camera for different objects in the scene. In Figure 1, you can see such differences on the left where the red and blue don't match up.

Figure 1. Anaglyph of stereo image pair (left) and example disparity map computed from the same stereo image pair (right)

Disparity and depth can be related by the following equation (where x-x' is disparity, z is depth, f is the focal length, and B is the interocular distance). !!!!!!!!!!!!OSCAR WRITE STUFF HERE!!!!!!!!!!!!!!!!!!!!!!

$x-x^{\prime }=\frac{Bf}{z}$

Figure 2. Diagram to Calculate Disparity and Depth

Image Rectification

In order to extract depth information, the stereo image pair must first be rectified (i.e. the images must be transformed in some way such that the only differences that remain are horizontal differences corresponding to the distance of the object from the camera).

Figure 3. Epipolar

Results

Sum of Squared Differences

Sum of Absolute Difference

• Performance with default parameters

Reference image

Disparity Map without semi-global matching

Disparity Map with semi-global matching

• Effect of Block Size and Smoothing

Census Transformation

Disparity Map from Census Transformation

Appendix II

You can write math equations as follows: $y=x+5$

You can include images as follows (you will need to upload the image first using the toolbox on the left bar.):

caption