Stereo korespondence

Abstract

This bachelor work deals with the stereo correspondence problem. This problem can be described as finding all pairs of identical pixels in images, which shows a scene from multiple angles. Currently, there are many methods to solve the stereo correspondence problem. The aim of this work is to introduce these methods and choose one of them to implement. Implemented method is based on dynamic programming. This method was described in detail to explain the principles and solution. It is followed by testing to verify the quality and speed of this method.