The Community for Technology Leaders
Green Image
<p>An algorithm for the computation of the histogram of limited-width (such as gray-level) values on a SIMD (single-instructions multiple-data) hypercube multiprocessor is proposed, which does not require the use of a general interconnection capability such as that on the connection machine. The computation of the complete histogram of n such values takes place in a series of log n steps, after which the histogram for value i can be found in the lowest-addressed processor whose address ends in i. The algorithm makes use of the association of suffixes of data values of increasing width with suffixes of processor addresses.</p>
computerised picture processing; parallel processing; histograms; gray-level; SIMD; hypercube multiprocessor; computational complexity; computerised picture processing; parallel processing

T. Bestul and L. Davis, "On Computing Complete Histograms of Images in Log (n) Steps Using Hypercubes," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 11, no. , pp. 212-213, 1989.
90 ms
(Ver 3.3 (11022016))