In this paper, we describe two parallel implementations of the simulated annealing method applied to the shape detection problem. The first is a massively parallel implementation on an SIMD mesh-connected architecture; the second uses an MIMD model of computation. The main focus of the paper is on restructuring the basic simulated annealing algorithm to execute on a multiprocessor. We show how to select appropriate sets of perturbations to be attempted at different temperatures to obtain good speed-ups. We give experimental results for the serial version of the algorithm applied to the detection of ellipses and parallelograms; we also present results obtained on an MIMD computer, the ENCORE MULTIMAX. (C) 1995 Academic Press, Inc.
PARALLEL SIMULATED ANNEALING FOR SHAPE DETECTION / Bongiovanni, Giancarlo; P., Crescenzi; C., Guerra. - In: COMPUTER VISION AND IMAGE UNDERSTANDING. - ISSN 1077-3142. - 61:1(1995), pp. 60-69. [10.1006/cviu.1995.1005]
PARALLEL SIMULATED ANNEALING FOR SHAPE DETECTION
BONGIOVANNI, Giancarlo;
1995
Abstract
In this paper, we describe two parallel implementations of the simulated annealing method applied to the shape detection problem. The first is a massively parallel implementation on an SIMD mesh-connected architecture; the second uses an MIMD model of computation. The main focus of the paper is on restructuring the basic simulated annealing algorithm to execute on a multiprocessor. We show how to select appropriate sets of perturbations to be attempted at different temperatures to obtain good speed-ups. We give experimental results for the serial version of the algorithm applied to the detection of ellipses and parallelograms; we also present results obtained on an MIMD computer, the ENCORE MULTIMAX. (C) 1995 Academic Press, Inc.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
