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. © 2000 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Pan, Y., Li, Y., Li, J., Li, K., & Zheng, S. Q. (2000). Computing distance maps efficiently using an optical bus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1800 LNCS, pp. 178–185). Springer Verlag. https://doi.org/10.1007/3-540-45591-4_24
Mendeley helps you to discover research relevant for your work.