On parallel stereo

We review some of the open issues in computational stereo. In particular, we will discuss the problem of extracting better matching primitives and of dealing with occlusions. Markov Random Field models - an extension of standard regularization - suggest sophisticated stereo matching algorithms. They are, however, ill-suited to efficient, real-time applications. We will conclude reviewing a new simple but fast algorithm implemented by one of us (Drumheller, 1986) on the TMC Connection Machine (TM) computer. Some of its features are: (a) the potential for combining different primitives, including color information; (b) the use of a stronger and new formulation of the uniqueness constraint; and (c) its disparity representation that maps efficiently into the architecture of the Connection Machine computer.

[1]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[2]  A. Habibi Two-dimensional Bayesian estimate of images , 1972 .

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

[4]  D Marr,et al.  Theory of edge detection , 1979, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[5]  B. Julesz,et al.  A disparity gradient limit for binocular fusion. , 1980, Science.

[6]  Harry G. Barrow,et al.  Interpreting Line Drawings as Three-Dimensional Surfaces , 1980, Artif. Intell..

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

[8]  John E. W. Mayhew,et al.  Psychophysical and Computational Studies Towards a Theory of Human Stereopsis , 1981, Artif. Intell..

[9]  F. R. Hansen,et al.  Image segmentation using simple markov field models , 1982, Computer Graphics and Image Processing.

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

[11]  J. L. Marroquin,et al.  Design of Cooperative Networks , 1983 .

[12]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[13]  T. Poggio,et al.  A generalized ordering constraint for stereo correspondence , 1984 .

[14]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  T. Poggio,et al.  Ill-Posed Problems and Regularization Analysis in Early Vision , 1984 .

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

[17]  T. Poggio Vision by man and machine. , 1984, Scientific American.

[18]  V. A. Morozov,et al.  Methods for Solving Incorrectly Posed Problems , 1984 .

[19]  Demetri Terzopoulos,et al.  Multiresolution computation of visible-surface representations , 1984 .

[20]  J. Mayhew,et al.  Disparity Gradient, Lipschitz Continuity, and Computing Binocular Correspondences , 1985 .

[21]  Tomaso Poggio Integrating vision modules with coupled MRFs , 1985 .

[22]  Tomaso Poggio,et al.  Computational vision and regularization theory , 1985, Nature.

[23]  José L. Marroquín,et al.  Probabilistic solution of inverse problems , 1985 .

[24]  W. Daniel Hillis,et al.  The connection machine , 1985 .

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