Abstract
In this paper, based on the advantages of both optical transmission and electronic computation, we first provide an O(log log N) bus cycles parallel algorithm for weighted distance transforms of an N×N binary image on a linear array with a reconfigurable pipelined bus system using N 2 processors. By increasing the number of processors, the proposed algorithm can be run in O(loglog q N) and O(1) bus cycles using qN 2 and N 2 + 1/ε processors respectively, where \(2 \leq q \leq \sqrt{N}, \varepsilon\) is a constant and ε ≥ 1. These results improve on previously known algorithms developed on various parallel computation models.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Borgefors, G.: Distance transformations in arbitrary dimensions. Computer Vision, Graphics and Image Processing 27, 321–345 (1984)
Fujiwara, A., Inoue, M., Masuzawa, T., Fujiwara, H.: A cost optimal parallel algorithm for weighted distance transforms. Parallel Computing 25, 405–416 (1999)
Guo, Z., Melhem, R.G., Levitan, S.P.: Pipelined communications in optically interconnected arrays. J. of Parallel and Distrib. Comput. 12(3), 269–282 (1991)
Hirata, T.: A unified linear-time algorithm for computing distance maps. Information Processing Letters 58, 129–133 (1996)
Lee, Y.-H., Horng, S.-J.: Optimal computing the chessboard distance transform on parallel processing systems. Computer Vision and Image Understanding 73(3), 374–390 (1999)
Levitan, S., Chiarulli, D., Melhem, R.G.: Coincident pulse techniques for multiprocessor interconnection structures. Applied Optics 29(14), 2024–2039 (1990)
Li, K., Pan, Y., Zheng, S.Q.: Parallel computing using optical interconnections. Kluwer Academic, Dordrecht (1998)
Paglieroni, D.W.: Distance transforms: properities and machine vision applications. CVGIP: Graphical Models and Image Processing 54, 56–74 (1992)
Pan, Y., Li, L.: Linear array with a reconfigurable pipelined bus system - concepts and applications. Journal of Information Sciences 106(3-4), 237–258 (1998)
Pavel, S., Akl, S.G.: Integer sorting and routing in arrays with reconfigurable optical bus. Int. J. of Foundations of Computer Science 9(1), 99–120 (1998)
Qiao, C., Melhem, R.G.: Time-division communications in multiprocessors arrays. IEEE Transactions on Computers 42, 577–590 (1993)
Rosenfeld, A., Pfaltz, J.L.: Sequential operations in digital picture processing. Journal of ACM 13, 471–494 (1966)
Schwarzkopf, O.: Parallel computation of distance transform. Algorithmica 6, 685–697 (1991)
Tsai, H.-R.: Parallel algorithms for the medial axis transform on linear arrays with a reconfigurable pipelined bus system. In: Int. Conf. on Parallel and Distrib. Syst., pp. 123–128. National Central University, Taiwan, R. O. C (2002)
Wu, C.-H., Horng, S.-J., Tsai, H.-R.: Efficient parallel algorithms for hierarchical clustering on arrays with reconfigurable optical buses. Journal of Parallel and Distributed Computing 60(9), 1137–1153 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsai, HR. (2009). Parallel Algorithms for the Weighted Distance Transform on Linear Arrays with a Reconfigurable Pipelined Bus System. In: Hua, A., Chang, SL. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2009. Lecture Notes in Computer Science, vol 5574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03095-6_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-03095-6_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03094-9
Online ISBN: 978-3-642-03095-6
eBook Packages: Computer ScienceComputer Science (R0)