Convolution on Mesh Connected Multicomputers

An efficient parallel algorithm is presented for convolution on a mesh-connected computer with wraparound. The algorithm does not require a broadcast feature for data values, as assumed by previously proposed algorithms. As a result, the algorithm is applicable to both SIMD and MIMD meshes. For an N*N image and a M*M template, the previous algorithms take O(M/sup 2/q) time on an N*N mesh-connected multicomputer (q is the number of bits in each entry of the convolution matrix). The algorithms have complexity O(M/sup 2/r), where r=max (number of bits in an image entry, number of bits in a template entry). In addition to not requiring a broadcast capability, these algorithms are faster for binary images. >

[1]  Ellis Horowitz,et al.  Fundamentals of Data Structures in Pascal , 1984 .

[2]  Jake K. Aggarwal,et al.  Parallel 2-D Convolution on a Mesh Connected Array Processor , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Sartaj Sahni,et al.  Image Template Matching on MIMD Hypercube Multicomputers , 1990, J. Parallel Distributed Comput..

[4]  Xiaobo Li,et al.  Parallel Algorithms for Image Template Matching on Hypercube SIMD Computers , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Oscar H. Ibarra,et al.  Two-Dimensional Convolution on a Pyramid Computer , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Sartaj Sahni,et al.  Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..

[7]  Lionel M. Ni,et al.  Parallel Algorithms for 2-D Convolution , 1986, ICPP.

[8]  Viktor K. Prasanna,et al.  Efficient Image Template Matching on Hypercube SIMD Arrays , 1987, International Conference on Parallel Processing.

[9]  H. T. Kung,et al.  A Systolic 2-D Convolution Chip. , 1981 .

[10]  Dana H. Ballard,et al.  Computer Vision , 1982 .

[11]  E. Dubois,et al.  Digital picture processing , 1985, Proceedings of the IEEE.