x11;Scalable Parallel Geometric Hashing for Hypercube SIMD Architectures

Abstract

Geometric hashing has recently been introduced as a new paradigm for model based object recognition. The geometric hashing algorithm allows one to find instances of model point patterns in a scene, subject to noise, obscuration, and transformation. In this paper we concentrate on the cases of similarity and rigid transformations and examine the parallelizability of the algorithm. We describe two scalable algorithms for hypercube SIMD architectures. A number of important building block algorithms and several variations to the basic approach are discussed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1991
Accession Number
AD1020185

Entities

People

  • Isidore Rigoutsos
  • Robert Hummel

Organizations

  • Courant Institute of Mathematical Sciences, NYU

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Applied Computer Science
  • Artificial Intelligence
  • Artificial Intelligence Computing
  • Computational Processes
  • Computer Science
  • Computer Vision
  • Identification
  • Image Processing
  • Image Recognition
  • Object Recognition
  • Obscuration
  • Recognition

Fields of Study

  • Computer science

Readers

  • Parallel and Distributed Computing.
  • Theoretical Analysis.