Given two or more images of the same 3D scene, taken from different points of view, the correspondence problem refers to the task of finding a set of points in one image which can be identified as the same points in another image. To do this,
points or
features in one image are matched with the points or features in another image, thus establishing
corresponding points or
corresponding features, also known as
homologous points or
homologous features. The images can be taken from a different point of view, at different times, or with objects in the scene in general motion relative to the camera(s). Finding corresponding pixels in stereo images is known as the correspondence problem. The result is usually a disparity map, in which a displacement vector to the corresponding pixel of the other image is determined for each pixel of one image. For this purpose, a unique correspondence between the points of the individual images must be established. Since the assignment of the pixels can be highly ambiguous and is not always possible, the correspondence problem is also referred to as a "ill-posed" problem, according to
Hadamard's definition. Furthermore, the solution of the correspondence problem is made more difficult by perspective distortions, noise, and differences in illumination and contrast between the images. The correspondence problem can occur in a stereo situation when two images of the same scene are used, or can be generalised to the N-view correspondence problem. In the latter case, the images may come from either N different cameras photographing at the same time or from one camera which is moving relative to the scene. The problem is made more difficult when the objects in the scene are in motion relative to the camera(s). A typical application of the correspondence problem occurs in
panorama creation or
image stitching — when two or more images which only have a small overlap are to be stitched into a larger composite image. In this case it is necessary to be able to identify a set of corresponding points in a pair of images in order to calculate the transformation of one image to stitch it onto the other image.
Occlusions One of the most significant sources of errors in stereoscopic correspondence determination is the presence of areas in a scene that are only visible from one camera perspective. For the image areas into which these regions of the scene are mapped, no corresponding elements exist in the other stereo image. These image areas are called occlusions. If occlusions are not adequately accounted for during correspondence determination, more or less pronounced miscorrections occur, depending on the approach, resulting in inaccurate depth reconstruction. Therefore, occlusions represent a serious problem in stereo image processing.
Aperture Problem File:Aperture problem.jpg|thumb|The aperture problem – Top: Left and right image sections of a stereo image pair with an object edge parallel (left) and orthogonal (right) to the stereo base. Bottom: Relative horizontal shift dx (disparity) in each case.
Constrains in Stereo Image Processing Due to its specific nature, the correspondence problem, like many other ill-posed problems, can only be uniquely solved by exploiting appropriate prior knowledge. With the help of this prior knowledge, the solution space is appropriately reduced, and the problem is transformed into a "well-posed" problem. The constraints of the solution space relate, on the one hand, to the imaging process and the geometry of the cameras used (epipolar and uniqueness constraint), and on the other hand, to postulated properties of the observed scene (continuity, order, and gradient constrains). == Algorithms ==