Implementation of Apply on a transputer array

✍ Scribed by Wang, Han ;Dew, Peter M. ;Webb, Jon A.

• Publisher: John Wiley and Sons
• Year: 1991
• Tongue: English
• Weight: 711 KB
• Volume: 3
• Category: Article
• ISSN: 1040-3108
• DOI: 10.1002/cpe.4330030104

✦ Synopsis

Apply is a machine-independent, low-level image proressing language for expressing local window operations. It has two main advantages: (1) It significantly reduces the prcqpuumiq effort, and (2) it can be mapped onto a wide range of parallel computers. In this paper we report our recent experience on implementing Apply on a Meiko Computing Surface (transputer array machine) using a farmer/ga&er model. The performance of the Meiko Implementation on a number of edge detection algorithms includhg the papular Canny operator is analysed. Results suggest that the perfomance of Apply generated code represents peak performance and it is likely to be as efficient as hand-written code.

2. LOW-LEVEL IMAGE PROCESSING

Assuming W is the transformation function, and letting I denote the input image, and 0 the output image, low-level local image processing can be defined as the mapping 1~3108/911010043-12506.00 @I991 by John Ww & Sons. Ltd Receiwd