Hasselbring, Wilhelm and Fischer, Robert (1995) Using the ProSet-Linda Prototyping Language for Investigating MIMD Algorithms for Model Matching in 3-D Computer Vision. [Paper] In: Parallel Algorithms for Irregularly Structured Problems (IRREGULAR 1995). , September 1995, Lyon, France . Proceedings Parallel Algorithms for Irregularly Structured Problems (IRREGULAR 1995). ; pp. 301-315 . Lecture Notes in Computer Science, 980 .

Preview

Text Irregular1995.pdf - Accepted Version Download (225kB) | Preview

Abstract

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.

Actions (login required)

View Item