This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Convolution on Mesh Connected Multicomputers
March 1990 (vol. 12 no. 3)
pp. 315-318

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] D. H. Ballard and C. M. Brown,Computer Vision. Englewood Cliffs, NJ: Prentice-Hall, 1982.
[2] J. H. Chang, O. Ibarra, T. C. Pong, and S. Sohn, "Convolution on a pyramid computer," inProc. Int. Conf. Parallel Processing, 1987, pp. 780-782.
[3] E. Dekel, D. Nassimi, and S. Sahni, "Parallel matrix and graph algorithms,"SIAM J. Comput., pp. 657-675, 1981.
[4] Z. Fang, X. Li, and L. M. Ni, "Parallel algorithms for image template matching on hypercube SIMD computers," inProc. IEEE CAPAMI Workshop, 1985, pp. 33-40.
[5] Z. Fang, X. Li, and L. M. Ni, "Parallel algorithms for 2-D convolution," inProc. Int. Conf. Parallel Processing, 1986, pp. 262-269.
[6] E. Horowitz and S. Sahni,Fundamentals of Data Structures. Rockville, MD: Computer Science Press, 1983.
[7] H. T. Kung and S. W. Song, "A systolic 2-D convolution chip," inMulticomputers and Image Processing: Algorithms and Programs, Preston and Uhr, Eds. New York: Academic, 1982, pp. 373-384.
[8] S.-Y. Lee and J. K. Aggarwal, "Parallel 2-D convolution on a mesh connected array processor,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-9, pp. 590-594, July 1987.
[9] M. Maresca and H. Li, "Morphological operations on mesh-connected architecture: A generalized convolution algorithm," inProc. 1986 IEEE Comput. Soc. Workshop Computer Vision and Pattern Recognition, 1986, pp. 299-304.
[10] V. K. Prasanna Kumar and V. Krishnan, "Efficient image template matching on SIMD hypercube machines," inProc. Int. Conf. Parallel Processing, 1987, pp. 765-771.
[11] S. Ranka and S. Sahni, "Image template matching on a SIMD hypercube multicomputers," inProc. 1988 Int. Conf. Parallel Processing, vol. III, Algorithms&Applications. Philadelphia, PA: Pennsylvania University Press, pp. 84-91.
[12] S. Ranka and S. Sahni, "Image template matching on MIMD hypercube multicomputers," inProc. 1988 Int. Conf. Parallel Processing, vol. III, Algorithms&Applications. Philadelphia, PA: Pennsylvania University Press, pp. 92-99.
[13] S. Ranka and S. Sahni, "Convolution on SIMD mesh connected multicomputers," inProc. 1988 Int. Conf. Parallel Processing, vol. III, Algorithms&Applications. Philadelphia, PA: Pennsylvania University Press, pp. 212-217.
[14] A. Rosenfeld and A. Kak,Digital Picture Processing, New York: Academic, 1976.

Index Terms:
computerised picture processing; SIMD meshes; mesh connected multicomputers; efficient parallel algorithm; wraparound; MIMD meshes; convolution matrix; computational complexity; computerised picture processing; parallel processing
Citation:
S. Ranka, S. Sanhi, "Convolution on Mesh Connected Multicomputers," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, no. 3, pp. 315-318, March 1990, doi:10.1109/34.49056
Usage of this product signifies your acceptance of the Terms of Use.