Portal de Periódicos da CAPES

Sorting, Histogramming, and Other Statistical Operations on a Pyramid Machine

1984; Springer Nature; Linguagem: Inglês

10.1007/978-3-642-51590-3_10

2365-0672

Steven L. Tanimoto,

Algorithms and Data Compression

We define a pyramid machine to consist of an SIMD cellular array having pyramid interconnections, together with a controller consisting of a conventional microcomputer augmented with hardware to communicate with the cellular array. Primarily intended for graphics and image analysis applications, pyramid machines may also be used for more general data processing. Many operations can be performed in 0(log N) time with this architecture; finding maxima, areas, and centroids are typical of such operations. Here algorithms are given for sorting, for finding the kth largest element, for local order statistics, for median filtering of image data, for computing the histogram of a set of numbers, and for computing the mean and standard deviation. Most of these algorithms run as fast as or faster than the best known algorithms for any SISD or flat array SIMD computer. Others offer simpler programs than those for the optimal algorithms.