A Randomized Parallel Algorithm for Computing a Complete Histogram of an Image in Log(n) Steps with Optimal Memory Requirements Using Hypercubes
Loading...
Authors
Issue Date
Type
Article
Language
Alternative Title
Abstract
Description
This work first reviews an already-developed, existing deterministic parallel algorithm [1] to compute the complete histogram of an image in optimal number of steps ( log n ) on a hypercube architecture and utilizing memory space on the order of O(x^(1/2) log x) where x is the number of gray levels in the image, at each processing element. The paper then introduces our improvement to this algorithm's memory requirements by introducing the concept of randomization into the algorithm.
Citation
T. M. Sobh, "A Randomized Parallel Algorithm for Computing a Complete Histogram of an Image in Log(n) Steps with Optimal Memory Requirements Using Hypercubes," Advances in Computer Science and Engineering, vol. 1, no. 1, Mar. 2007.
Publisher
Pushpa Publishing House