Analysis of a Cooperative Stereo Algorithm,

Abstract

Marr and Poggio (1976) recently described a cooperative algorithm that solves the correspondence problem for stereopsis. This article uses a probabilistic technique to analyze the convergence of that algorithm, and derives the conditions governing the stability of the solution state. The actual results of applying the algorithm to random-dot stereograms are compared with the probabilistic analysis. A satisfactory mathematical analysis of the asymptotic behavior of the algorithm is possible for a suitable choice of the parameter values and loading rules, and again the actual performance of the algorithm under these conditions is compared with the theoretical predictions. Finally, some problems raised by the analysis of this type of 'cooperative' algorithm are briefly discussed. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1977
Accession Number
ADA055099

Entities

People

  • D. Marr
  • G. Palm
  • T. Poggio

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Cells
  • Computational Science
  • Computations
  • Computer Simulations
  • Computers
  • Continuity
  • Diameters
  • Equations
  • Geometry
  • Inhibition
  • Ions
  • Iterations
  • Mathematical Analysis
  • Mathematical Models
  • Two Dimensional

Readers

  • Computer Vision.
  • Fluid Dynamics.
  • Operations Research