๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computing Hough transforms on hypercube multicomputers

โœ Scribed by Sanjay Ranka; Sartaj Sahni

Publisher
Springer US
Year
1990
Tongue
English
Weight
843 KB
Volume
4
Category
Article
ISSN
0920-8542

No coin nor oath required. For personal study only.

โœฆ Synopsis

Efficient algorithms to compute the Hough transform on M1MD and SIMD hypercube multicomputers are developed. Our algorithms can compute p angles of the Hough transform of an N x N image, p < N, in 0(p + log N) time on both MIMD and SIMD hypercubes. These algorithms require 0(N ~) processors. We also consider the computation of the Hough transform on MIMD hypercubes with a fixed number of processors. Experimental results on an NCUBE/7 hypercube are presented.

๐Ÿ“œ SIMILAR VOLUMES

Maze routing on a hypercube multicompute
Maze routing on a hypercube multicomputer
โœ Youngju Won; Sartaj Sahni ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Springer US ๐ŸŒ English โš– 1010 KB

The implementation of Lee's maze routing algorithm on an MIMD hypercube multiprocessor computer can follow several plausible mappings and synchronization strategies. These are evaluated experimentally on an NCUBE/7 hypercube computer with 64 processors. Different grid partitioning and mapping strate

Distributed Computing on Anonymous Hyper
Distributed Computing on Anonymous Hypercube Networks
โœ Evangelos Kranakis; Danny Krizanc ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 245 KB

We consider the bit-complexity i.e.a, total number of bits transmitted of computing boolean functions on an anonymous canonically labeled n-dimensional hypercube network and give a characterization of the boolean functions computable on such a network as exactly those boolean functions which are inv