Abstract
This paper describes a parallel array architecture for performing morphological operations on images using dynamically reconfigurable Field Programmable Gate Arrays. The key feature of this architecture is the data-localised arrangement, which significantly reduces data flow and continuous reconfiguration, which leads to efficient utilisation of the area. The development of implementations of the various possible operations in morphological algorithms, using skeletonisation as an example, is discussed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L. Abbott, R. M. Haralick & X. Zhuang, “Pipeline Architectures for Morphologic Image Analysis”, Machine Vision & Applications, pp. 23–40, 1988.
P. Y. K. Cheung, “Riley-2: A flexible platform for codesign and dynamic reconfigurable computing research”, this volume.
S. Churcher, T. Kean & B. Wilkie, “The 6200 Fastmap Processor Interface”, in Field Programmable Logic & Applications, W. Moore & W. Luk (Eds.), pp. 36–43, LNCS 975, Springer 1995.
C. R. Giardina & E.R. Dougherty, “Morphological Methods in Image and Signal Processing”, Prentice Hall, 1988
A. C. P. Loui, A. N. Venetsanopoulos & K. C. Smith, “Flexible Architectures for Morphological Image Processing and Analysis”, IEEE Transactions on Circuits & Systems for Video Technology, Vol. 2, No. 1, pp. 72–83, March 1992.
W. Luk, N. Shirazi & P. Y. K. Cheung, “Modelling and Optimising Run-Time Reconfigurable Systems”, IEEE Symposium on FPGAs for Custom Computing Machines, 1996.
W. Luk, N. Shirazi and P. Y. K. Cheung, “Compilation Tools for Run-Time Reconfigurable Designs”, IEEE Symposium on Field-Programmable Custom Computing Machines, 1997.
W. Luk, T. Wu & I. Page, “Hardware-Software Co-design of Multidimensional Programs”, IEEE Workshop on FPGAs for Custom Computing Machines, 1994.
H. Park & R. T. Chin, “Optimal Decomposition of Convex Morphological Structuring Elements for 4-Connected Parallel Array Processors”, IEEE Transactions on Pattern Analysis & Machine Intelligence, Vol. 16, No.3, pp. 304–313, March 1994.
I. Pitas & A. N. Venetsanopoulos, “Morphological Shape Decomposition”, IEEE Transactions on Pattern Analysis & Machine Intelligence, Vol. 12, No. 1, pp. 38–45, January 1990.
S. R. Sternberg, “Computer Architectures Specialized for Mathematical Morphology”, Algorithmically Specialized Parallel Computers, pp. 169–176, 1985.
S. Trimberger, D. Carberry, A. Johnson & J. Wong, “A Time-Multiplexed FPGA”, IEEE Symposium on Field-Programmable Custom Computing Machines, 1997.
D. Wang & D.-C. He, “A Fast Implementation of 1-D Grayscale Morphological Filters”, IEEE Transactions on Circuits and Systems — 11: Analog & Digital Signal Processing, Vol. 41, No. 9, pp. 634–636, September 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaudhuri, A.S., Cheung, P.Y.K., Luk, W. (1997). A reconfigurable data-localised array for morphological algorithms. In: Luk, W., Cheung, P.Y.K., Glesner, M. (eds) Field-Programmable Logic and Applications. FPL 1997. Lecture Notes in Computer Science, vol 1304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63465-7_239
Download citation
DOI: https://doi.org/10.1007/3-540-63465-7_239
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63465-2
Online ISBN: 978-3-540-69557-8
eBook Packages: Springer Book Archive