The Community for Technology Leaders
Green Image
<p>An algorithm for convolving a k*k window of weighting coefficients with an n*n image matrix on a pyramid computer of O(n/sup 2/) processors in time O(logn+k/sup 2/), excluding the time to load the image matrix, is presented. If k= Omega ( square root log n), which is typical in practice, the algorithm has a processor-time product O(n/sup 2/ k/sup 2/) which is optimal with respect to the usual sequential algorithm. A feature of the algorithm is that the mechanism for controlling the transmission and distribution of data in each processor is finite state, independent of the values of n and k. Thus, for convolving two (0, 1)-valued matrices using Boolean operations rather than the typical sum and product operations, the processors of the pyramid computer are finite-state.</p>
2D convolution; computerised picture processing; computational complexity; pyramid computer; window; image matrix; finite state; Boolean operations; Boolean functions; computational complexity; computerised picture processing; matrix algebra; parallel architectures

T. Pong, S. Sohn, J. Chang and O. Ibarra, "Two-Dimensional Convolution on a Pyramid Computer," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 10, no. , pp. 590-593, 1988.
93 ms
(Ver 3.3 (11022016))