Digital Stereo Image Matching Techniques

This paper presents an overview of the various classes of algorithms in use for matching points from one digital image of a stereo pair with the corresponding points in the second image of the pair. These techniques primarily use area-based measures, such as correlation between image patches, or edge-based methods that match linear features in images, but also include the use of feature extractors to match single points in images, as well as global optimization techniques that simultaneously match all points in the two images. This paper also describes an automatic system developed at SRI for stereo compilation; this system uses area-based correlation , but applies this basic technique in a variety of novel ways to develop a disparity model for a given stereo image pair. The techniques used are hierarchical in nature, and incorporate iterative refinement, as well as a best-first strategy, in the matching process. To illustrate these techniques, the results of this system on the Image Matching Test A data set recently distributed by ISPRS's Working Group III/4 are presented. Introd uction Automatic techniques for the production of three-dimensional (3-D) data via stereo conlpila-tion are receiving increased interest for a variety of applications, including cartography [Panton, 1978], autonomous vehicle navigation [Hannah, 1980], and industrial automation [Nishihara and Poggio, 1983]. The first and most difficult step in recovering 3-D information frolll a pair of stereo images is that of matching points from one digital image of the pair with the corresponding points in the second image. Many computational algorithms have been used in attempts to solve this problem (see [Brady, 1982] or [Barnard and Fischler, 1982] for surveys of the field). These techniques primarily use area-based measures, such as correlation between image patches, or edge-based methods that match linear features in images, but also include the use of feature extractors to match single points in images, as well as global optimization techniques that simultaneously match all points .in the two images. Area matching techniques are the oldest and simplest of the stereo matching algorithms. Each image point to be matched is in fact the center of a small window of points' in the first or reference image, and this window is statistically compared with similarly sized windows of points in the second or target image of the stereo pair. The measure of match is either a difference metric that is minimized, such as RMS difference, or more commonly …

[1]  Manfred H. Hueckel An Operator Which Locates Edges in Digitized Pictures , 1971, J. ACM.

[2]  L. Quam Computer comparison of pictures , 1971 .

[3]  Marsha Jo Hannah,et al.  Computer matching of areas in stereo images. , 1974 .

[4]  D Marr,et al.  Cooperative computation of stereo disparity. , 1976, Science.

[5]  Marsha Jo Hannah,et al.  Bootstrap Stereo , 1980, AAAI.

[6]  Donald Bernard Gennery,et al.  Modelling the environment of an exploring vehicle by means of stereo vision , 1980 .

[7]  Ellen C. Hildreth,et al.  Implementation Of A Theory Of Edge Detection , 1980 .

[8]  William B. Thompson,et al.  Disparity Analysis of Images , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  P. Burt Fast, Hierarchical Correlations with Gaussian-Like Kernels , 1980 .

[10]  Hans P. Moravec Obstacle avoidance and navigation in the real world by a seeing robot rover , 1980 .

[11]  Thomas O. Binford,et al.  Depth from Edge and Intensity Based Stereo , 1981, IJCAI.

[12]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[13]  Eric L. W. Grimson,et al.  From Images to Surfaces: A Computational Study of the Human Early Visual System , 1981 .

[14]  Martin A. Fischler,et al.  Computational Stereo , 1982, CSUR.

[15]  Michael Brady,et al.  Computational Approaches to Image Understanding , 1982, CSUR.

[16]  Takeo Kanade,et al.  Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Stephen T. Barnard,et al.  Stereo Matching by Hierarchical, Microcanonical Annealing , 1987, IJCAI.

[18]  L. Quam Hierarchical warp stereo , 1987 .

[19]  Jyothi Digge,et al.  Stereo vision for Robotics , 2012 .