Computing visual correspondence: incorporating the probability of a false match

We describe a method for computing visual correspondence which employs a formal model of the probability of a false match. This model estimates the chance that the best match for each point could have occurred at random. The model is effective at identifying points in one image for which there is no corresponding point in the other image, as occurs at depth boundaries in stereo and at motion boundaries in optical flow. More generally, the model can be used to identify points where the best match is of poor quality, as occurs in regions of uniform texture. We describe the similarity measure used in the method and present the formal model of a false match. We also show examples of using the method to compute stereo disparity.<<ETX>>

[1]  Takeo Kanade,et al.  A Multiple-Baseline Stereo , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  W. Eric L. Grimson,et al.  On the Verification of Hypothesized Matches in Model-Based Recognition , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Takeo Kanade,et al.  A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  KanadeT.,et al.  A Stereo Matching Algorithm with an Adaptive Window , 1994 .

[6]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[7]  Daniel P. Huttenlocher,et al.  Comparing Images Using the Hausdorff Distance , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  M. J. Hannah A system for digital stereo image matching , 1989 .

[9]  H. K. Nishihara,et al.  Practical Real-Time Imaging Stereo Matcher , 1984 .

[10]  Michael J. Black,et al.  A framework for the robust estimation of optical flow , 1993, 1993 (4th) International Conference on Computer Vision.