Parallel Algorithms for Image Processing on OMC

Authors:
Mary Mehrnoosh Eshaghian
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1991

Citing 5
Cited 8

Optical Crossbar Networks

Computer
Universal schemes for parallel communication

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
The complexity of parallel computations

The complexity of parallel computations
A complexity theory for VLSI

A complexity theory for VLSI
Computational Aspects of VLSI

Computational Aspects of VLSI

An Ω(√ log log n) lower bound for routing in optical networks

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
An optical simulation of shared memory

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Efficient Algorithms for the All Nearest Neighbor and Closest Pair Problems on the Linear Array with a Reconfigurable Pipelined Bus System

IEEE Transactions on Parallel and Distributed Systems
Fast All Nearest Neighbor Algorithms from Image Processing Perspective

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
The spin-wave nanoscale reconfigurable mesh and the labeling problem

ACM Journal on Emerging Technologies in Computing Systems (JETC)
Analysis of Parallel Algorithms for Matrix Chain Product and Matrix Powers on Distributed Memory Systems

IEEE Transactions on Parallel and Distributed Systems
An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective

Journal of Parallel and Distributed Computing
Fast and highly scalable parallel computations for fundamental matrix problems on distributed memory systems

The Journal of Supercomputing

Quantified Score

Hi-index	14.98

Visualization

Abstract

The author studies a class of VLSI organizations with optical interconnects for fast solutions to several image processing tasks. The organization and operation of these architectures are based on a generic model called OMC, which is used to understand the computational limits in using free space optics in VLSI parallel processing systems. The relationships between OMC and shared memory models are discussed. Also, three physical implementations of OMC are presented. Using OMC, several parallel algorithms for fine grain image computing are presented. A set of processor efficient optimal O(log N) algorithms and a set of constant time algorithms are presented for finding geometric properties of digitized images. Finally, designs tailored to meet both the computation and communication needs of problems such as those involving irregular sparse matrices are examined.