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 n 2 processors. We also show that the problem can be solved in O(log log n) time deterministically or in O(l) time with high probability on an LARPBS with n 3 processors. The algorithm compares favorably to the best known parallel algorithms for the same problem in the literature.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
T. Bossomaier, N. Isidoro, and A. Loeff, “Data parallel computation of Euclidean distance transforms,” Parallel Processing Letters, vol. 2, no. 4, pp. 331–339, 1992.
L. Chen and H. Y. H. Chuang, “A fast algorithm for Euclidean distance maps of a 2-D binary image,” Information Processing Letters, vol. 51, pp. 25–29, 1994.
L. Chen and H. Y. H. Chuang, “An efficient algorithm for complete Euclidean distance transform on mesh-connected SIMD,” Parallel Computing, vol. 21, pp. 841–852, 1995.
D. Chiarulli, R. Melhem, and S. Levitan, “Using Coincident Optical Pulses for Parallel Memory Addressing,” IEEE Computer, vol. 20, no. 12, pp. 48–58, 1987.
M.N. Kolountzakis and K.N. Kutulakos, “Fast computation of Euclidean distance maps for binary images,” Information Processing Letters, vol. 43, pp. 181–184, 1992.
R. Melhem, D. Chiarulli, and S. Levitan, “Space Multiplexing of Waveguides in Optically Interconnected Multiprocessor Systems,” The Computer Journal, vol. 32, no. 4, pp. 362–369, 1989.
Yi Pan and Keqin Li, “Linear array with a reconfigurable pipelined bus system: concepts and applications,” Special Issue on “Parallel and Distributed Processing” of Information Sciences, vol. 106, no. 3/4, pp. 237–258, May 1998. (Also appeared in International conference on Parallel and Distributed Processing Techniques and Applications, Sunnyvale, CA, August 9–11, 1996, 1431–1442)
Y. Pan, K. Li, and S.Q. Zheng, “Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system,” Parallel Algorithms and Applications, vol. 13, pp. 1–25, 1998.
S. Rajasekaran and S. Sahni, “Sorting, selection and routing on the arrays with reconfigurable optical buses,” IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 11, pp. 1123–1132, Nov. 1997.
J. L. Trahan, A. G. Bourgeois, Y. Pan, and R. Vaidyanathan, “Optimally scaling permutation routing on reconfigurable linear arrays with optical buses,” Proc. of the Second Merged IEEE Symposium IPPS/SPDP’ 99, San Juan, Puerto Rico, pp. 233–237, April 12–16, 1999.
H. Yamada, “Complete Euclidean distance transformation by parallel operation,” Proc. 7th International Conference on Pattern Recognition, pp. 69–71, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pan, Y., Li, Y., Li, J., Li, K., Zheng, SQ. (2000). Computing Distance Maps Efficiently Using An Optical Bus. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_24
Download citation
DOI: https://doi.org/10.1007/3-540-45591-4_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67442-9
Online ISBN: 978-3-540-45591-2
eBook Packages: Springer Book Archive