Exploiting Parallelism in a Monte Carlo Image-Matching Algorithm.

Abstract

Recovering three-dimensional information from a visual scene requires producing the disparity map of matched stereo images. The matching approach discussed in this paper involves the Metropolis algorithm, a simulated annealing technique. Although simple in principle, this stochastic optimization technique requires immense computational resources. Adapting the algorithm for parallel computing is discussed and demonstrated for several computer architectures.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1995
Accession Number
ADA289872

Entities

People

  • Dale Shires

Organizations

  • United States Army Research Laboratory

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Annealing
  • Computer Architecture
  • Computer Programming
  • Computer Stereo Vision
  • Computer Vision
  • Computers
  • Computing System Architectures
  • Gray Scale
  • Image Processing
  • Operating Systems
  • Optimization
  • Parallel Computing
  • Parallel Processing
  • Range Finding
  • Stereo Cameras
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Computer Vision.
  • Operations Research
  • Parallel and Distributed Computing.