Weakness of stereo matching algorithm

1. What is stereo matching algorithm?
2. What is stereoscopic disparity?
3. What is stereo matching cost?
4. How does stereo block matching work?

What is stereo matching algorithm?

Stereo matching or disparity estimation is the process of finding the pixels in the multiscopic views that correspond to the same 3D point in the scene. The rectified epipolar geometry simplifies this process of finding correspondences on the same epipolar line.

What is stereoscopic disparity?

The disparity is the apparent motion of objects between a pair of stereo images. To experience this, try closing one eye and then rapidly open it while closing the other one. You will note that closer objects will move significantly while objects further away will move very little. This phenomenon is called disparity.

What is stereo matching cost?

For matching cost computation, the most commonly used one is the absolute difference (AD) to calculate the difference between the intensity of corresponding pixels to measure the likelihood. After that, cost measures like SAD (Sum of Absolute Difference) and SSD (Sum of Squared Difference) are also widely used.

How does stereo block matching work?

Block matching is the most widely used method for disparity estimation and is simple and effective to implement. The basic idea of block matching is to segment the target image into fixed size blocks and find for each block the corresponding block that provides the best match from the reference image.