PARALLEL SIMULATED ANNEALING FOR SHAPE DETECTION

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.