Parallel coordination of image operators: model, algorithm and performance

https://doi.org/10.1016/0262-8856(93)90051-HGet rights and content

Abstract

To obtain machine vision algorithms which are robust in the face of variations in image lighting, arrangements of objects, viewing parameters, etc., it is helpful to build into the algorithms an adaptive control mechanism such as a state-space search procedure. Such a procedure dynamically determines an optimal sequence of image processing operators to classify an image or to put its parts into correspondence with a model or set of models. One benefit of structuring the vision algorithm as a state-space search is that a multiplicity of paths toward goal nodes in the state space can be explored concurrently. In this paper, we identify several types of parallelism that may be exploited in vision algorithms based on state-space search. We present a new method, the ‘V algorithm’, which, unlike earlier parallel search algorithms, generates the successors of a state in parallel. In machine vision, this part of the search process is very expensive, and thus V permits substantial speedup. An experimental evaluation of V is presented which is based on a simulation of a character recognition algorithm; the simulation runs on a Sequent Balance 21000 using 16 processors.

References (18)

  • J Schaeffer

    Distributed game-tree searching

    J. Parallel & Distrib. Comput.

    (1989)
  • DH Ballard et al.

    Computer Vision

    (1982)
  • A Rosenfeld

    Computer vision: Basic principles

  • RM Haralick et al.

    Segmentation and its place in machine vision

  • SY Hwang

    State-space search as high-level control for machine vision

  • SL Tanimoto

    Machine vision as state-space search

  • S-Y Hwang

    Synthesis of Vision Algorithms Based on State-Space Search

  • NJ Nilsson

    Principles of Artificial Intelligence

    (1980)
  • VN Rao et al.

    Concurrent access of priority queues

    IEEE Trans. Comput.

    (1988)
There are more references available in the full text version of this article.

Cited by (5)

  • Object Location by Parallel Pose Clustering

    1998, Computer Vision and Image Understanding
  • Image Analysis and Computer Vision: 1993

    1994, Computer Vision and Image Understanding
  • Mesh-based parallel algorithms for ultra fast computer vision

    2007, Handbook of Parallel Computing: Models, Algorithms and Applications

Research supported in part by the National Science Foundation under NSF Grant IRI-8605889.

View full text