This paper presents a comparative analysis for algorithms that map pyramids onto hypercubes. The analysis is based on some important performance measures from graph theory and actual results from a Connection Machine system CM-2 containing 16K processors. One mapping algorithm has been presented by Stout, two by Lai and White, and one by Patel and Ziavras. It is shown that the third algorithm is a compromise between Stout's algorithm and Lai-White's algorithms with respect to cost and performance. Connection Machine results are presented for pyramid algorithms that compute the perimeter of objects, apply 2-dimensional convolution, and segment images.
Return to the "selected publications" page