UB ScholarWorks

Computing a Complete Histogram of an Image in Log(n) Steps and Minimum Expected Memory Requirements Using Hypercubes

Show simple item record

dc.contributor.author Sobh, Tarek M. en_US
dc.date.accessioned 2014-07-16T16:36:30Z
dc.date.available 2014-07-16T16:36:30Z
dc.date.issued 2007 en_US
dc.identifier.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.
dc.identifier.uri https://scholarworks.bridgeport.edu/xmlui/handle/123456789/493
dc.description.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. en_US
dc.language.iso en_US en_US
dc.publisher Pushpa Publishing en_US
dc.subject Computer science en_US
dc.subject Image processing en_US
dc.subject Computer vision en_US
dc.subject Image histogram en_US
dc.subject Hypercube en_US
dc.subject Architecture en_US
dc.subject Randomized algorithms en_US
dc.title Computing a Complete Histogram of an Image in Log(n) Steps and Minimum Expected Memory Requirements Using Hypercubes en_US
dc.type Article en_US
dc.publication.issue 1 en_US
dc.publication.name Advances in Computer Science and Engineering en_US
dc.publication.volume 1 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search ScholarWorks


Advanced Search

Browse

My Account