Computing Distance Maps Efficiently Using an Optical Bus

Authors:
Yi Pan;Yamin Li;Jie Li;Keqin Li;Si-Qing Zheng
Affiliations:
-;-;-;-;-
Venue:
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Year:
2000

Citing 8
Cited 2

Using Coincident Optical Pulses for Parallel Memory Addressing

Computer
Space multiplexing of waveguides in optically interconnected multiprocessor systems

The Computer Journal - Special issue on object-oriented programming
Fast computation of the Euclidian distance maps for binary images: Fast computations of the Euclidean distance maps for binary images

Information Processing Letters
A fast algorithm for Euclidean distance maps of a 2-D binary image

Information Processing Letters
An efficient algorithm for complete Euclidean distance transform on mesh-connected SIMD

Parallel Computing
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses

IEEE Transactions on Parallel and Distributed Systems
Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses

IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Linear array with a reconfigurable pipelined bus system - Concepts and applications

Information Sciences: an International Journal

Fast and Scalable Algorithms for Euclidean Distance Transform on the LARPBS

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Fast and scalable algorithms for the Euclidean distance transform on a linear array with a reconfigurable pipelined bus system

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses an algorithm for finding a distance map for an image efficiently using an optical bus. The computational model considered is the arrays with a reconfigurable pipelined bus system (LARPBS), which is introduced recently based on current electronic and optical technologies. It is shown that the problem for an n 脳 n image can be implemented in O(log n log log n) time deterministically or in O(log n) time with high probability on an LARPBS with n2 processors. We also show that the problem can be solved in O(log log n) time deterministically or in O(1) time with high probability on an LARPBS with n3 processors. The algorithm compares favorably to the best known parallel algorithms for the same problem in the literature.