Computing a Complete Histogram of an Image in Log(n) Steps and Minimum Expected Memory Requirements Using Hypercubes
Loading...
Authors
Sobh, Tarek M.
Issue Date
2007
Type
Article
Language
en_US
Keywords
Computer science , Image processing , Computer vision , Image histogram , Hypercube , Architecture , Randomized algorithms
Alternative Title
Abstract
This work first reviews an already-developed, existing deterministic parallel algorithm 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(x1/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.
Description
Citation
T. M. Sobh, "Computing a Complete Histogram of an Image in Log(n) Steps and Minimum Expected Memory Requirements Using Hypercubes," Advances in Computer Science and Engineering, vol. 1, no. 1, 2007.
Publisher
Pushpa Publishing