Newsgroups: comp.parallel
From: Wilhelm Hasselbring  <willi@athen.informatik.uni-dortmund.de>
Subject: Technical Report available: Investigating Parallel Interpretation-Tree Model Matching Algorithms with ProSet-Linda
Organization: CS Department, University of Dortmund, Germany
Date: Fri, 6 Jan 1995 18:20:21 GMT
Message-ID: <3ejn9g$1ki@fbi-news.informatik.uni-dortmund.de>

The following technical report may be of interest to this group
(Software-Technik Memo Nr. 77, University of Dortmund):

W. Hasselbring and R.B. Fisher:
"Investigating Parallel Interpretation-Tree Model Matching Algorithms
  with ProSet-Linda"

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. This algorithm
  has a high computational complexity when applied to matching problems with
  large numbers of features. This paper examines parallel variations of this
  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
  parallel algorithms with a prototyping approach, not the presentation of
  performance figures displaying increased performance through parallel
  execution. The expected improvements attained by the parallel algorithmic
  variations for interpretation-tree search are analyzed.

  The implementation of ProSet-Linda is briefly discussed."

It is available from:

http://ls10-www.informatik.uni-dortmund.de/LS10/Berichte.html
ftp://genf.informatik.uni-dortmund.de:/pub/Technische-Berichte/Hasselbring-Fisher_SWT-Memo-77.ps.gz

(Note that most of the information on this WWW server is in German)

A BibTeX reference to this report:

@TechReport{HasselbringFisher94,
  author = 	 "W. Hasselbring and R.B. Fisher",
  title = 	 "Investigating Parallel Interpretation-Tree Model Matching
		  Algorithms  with {{\sc ProSet}-Linda}",
  institution =  "University of Dortmund, Dept. of Computer Science",
  year = 	 1994,
  address =	 "Dortmund, Germany",
  type =	 "Software-Technik Memo",
  number =	 "Nr.~77",
  month =	 dec
}

Those interested in a detailed discussion of the employed approach may refer
to:

@Book{Hasselbring94,
  author = 	 "W. Hasselbring",
  title = 	 "Prototyping Parallel Algorithms in a Set-Oriented Language",
  series = 	 "Dissertation (University of Dortmund, Dept. Computer
		  Science)",
  publisher = 	 "Verlag Dr. Kovac",
  address =	 "Hamburg, Germany",
  year = 	 1994,
  isbn = 	 "3-86064-202-2",
  annote =	 "This book presents the design and implementation of an
		  approach to prototyping parallel algorithms with
		  ProSet-Linda. The presented approach to designing and
		  implementing ProSet-Linda relies on the use of 
		  the formal specification language Object-Z and the
		  prototyping language ProSet itself."
}

(not available electronically)

Comments are welcome, Willi

---------------------
Willi Hasselbring       Email: willi@ls10.informatik.uni-dortmund.de
University of Dortmund  Tel.:  ++49 +231 755.4712       ////
FB 4, LS Informatik 10  Fax:   ++49 +231 755.2061     UNI DO  Campus Sued
Software Technology     Baroper Str. 301          \*\\////   Building IV
D-44221 Dortmund, Germany                          \\\///   Room 309


