skip to main content

Convolution on mesh connected multicomputers

Ranka, S ; Sahni, S

IEEE Transactions on Pattern Analysis and Machine Intelligence, March 1990, Vol.12(3), pp.315-318 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por
  • Título:
    Convolution on mesh connected multicomputers
  • Autor: Ranka, S ; Sahni, S
  • Assuntos: Convolution ; Broadcasting ; Computer Vision ; Image Processing ; Parallel Algorithms ; Computer Science ; Image Edge Detection ; Object Detection ; Filtering ; Image Registration ; Engineering ; Computer Science
  • É parte de: IEEE Transactions on Pattern Analysis and Machine Intelligence, March 1990, Vol.12(3), pp.315-318
  • Descrição: 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.<>
  • Idioma: Inglês

Buscando em bases de dados remotas. Favor aguardar.