A Fast Algorithm for Computing a Histogram on Reconfigurable Mesh
IEEE Transactions on Pattern Analysis and Machine Intelligence
Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing and Sorting
IEEE Transactions on Computers
Constructing Euclidean Minimum Spanning Trees and All Nearest Neighbors on Reconfigurable Meshes
IEEE Transactions on Parallel and Distributed Systems
Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
Image Processing on the OTIS-Mesh Optoelectronic Computer
IEEE Transactions on Parallel and Distributed Systems
Optimal Algorithms for the Multiple Query Problem on Reconfigurable Meshes, with Applications
IEEE Transactions on Parallel and Distributed Systems
The spin-wave nanoscale reconfigurable mesh and the labeling problem
ACM Journal on Emerging Technologies in Computing Systems (JETC)
| Hi-index | 0.00 |
The authors develop reconfigurable mesh (RMESH) algorithms for window broadcasting, data shifts and consecutive sum. These are then used to develop efficient algorithms to compute the histogram of an image and to perform histogram modification. The histogram of an N*N image is computed by an N*N RMESH in O( square root B log /sub square root B/(N/ square root B) for B脙N, O( square root N) for B=N, and O( square root B) for N脙B脙or=N/sup 2/. B is the number of gray scale values. Histogram modification is done in O( square root N) time by an N*N RMESH.