Parallel Algorithms for Irregularly Structured Problems

Volume 980 of the series Lecture Notes in Computer Science pp 301-315


Using the ProSet-Linda prototyping language for investigating MIMD algorithms for model matching in 3-D computer vision

  • W. HasselbringAffiliated withDept. of Computer Science, University of Dortmund Informatik 10 (Software Technology)
  • , R. B. FisherAffiliated withDept. of Artificial Intelligence, University of Edinburgh

* Final gross prices may vary according to local VAT.

Get Access


This paper discusses the development of algorithms for parallel interpretation-tree model matching for 3-D computer vision applications such as object recognition. The algorithms are developed with a prototyping approach using ProSet-Linda. ProSet is a procedural prototyping language based on the theory of finite sets. The coordination language Linda provides a distributed shared memory model, called tuple space, together with some atomic operations on this shared data space. The combination of both languages, viz. ProSet-Linda, is designed for prototyping parallel algorithms.

The classical control algorithm for symbolic data/model matching in computer vision is the Interpretation Tree search algorithm. Parallel execution can increase the execution performance of model matching, but also make feasible entirely new ways of solving matching problems. In the present paper, we emphasize the development of several parallel algorithms with a prototyping approach. The expected improvements attained by the parallel algorithmic variations for interpretation-tree search are analyzed.


model-based vision object recognition parallel search prototyping parallel algorithms