Cookies on this website

We use cookies to ensure that we give you the best experience on our website. If you click 'Accept all cookies' we'll assume that you are happy to receive all cookies and you won't see this message again. If you click 'Reject all non-essential cookies' only necessary cookies providing core functionality such as security, network management, and accessibility will be enabled. Click 'Find out more' for information on how to change your cookie settings.

We present a parallel implementation of an algorithm designed to recognize fully parameterized objects from 3D data. For the purpose of recognition, the mapping of sensed features with model features is structured as an interpretation tree. However, with the use of parameterized models, most of the computation performed during the tree search is actually spent in the updating step of the object parameters, this process being executed through a SUP/INF network. A major contribution of our implementation is the exploitation of the intrinsic parallelism of the SUP/INF network, while the interpretation tree search is also distributed on our transputer based MIMD architecture. © 1994.

Original publication




Journal article


Image and Vision Computing

Publication Date





573 - 582