Answers are grounded in this paper and cite their sources.
A simple stereo algorithm is presented for determining the three-dimensional position of object points in a scene. In this algorithm two independent measures of similarity, the zero-crossing pattern and the intensity gradient, are combined to improve the matching process. Zero-crossing neighborhoods are classified into 16 possible patterns according to their local connectivity. In the matching process a relaxation method is used to find the best matches. Three constraints are incorporated into a single relaxation process, namely, disparity continuity, figural continuity, and smoothness of the probability of matching.
No takes yet. Share an insight, caveat, or question.
Kim et al. (1987) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: