Correspondence problem

From Wikipedia, the free encyclopedia

Given two or more images of the same 3D scene, taken from different points of view, the correspondence problem is to find a set of points in one image which can be indentified as the same points in another image. A human can normally solve this problem quick and easy, even when the images contain significant amount of noise. In computer vision the correspondence problem is studied for the case when a computer should solve it automatically with only the images as input. Once the correspondence problem has been solved, resulting in a set of image points which are in correspondence, other methods can be applied to this set to reconstruct the position of the corresponding 3D points in the scene.

A typical example of the correspondence problem occurs when two images of the same scene are used, the stereo correspondence problem.

[edit] See also

• Stereoscopy
• Parallax
• Photogrammetry
• Depth perception
• Stereopsis
• Computer vision

[edit] External links

• Middlebury Stereo Vision page

[edit] Papers

• D. Scharstein and R. Szeliski. A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms. (PDF)