Computer and Vision Research Center, College of Engineering, University of Texas at Austin, Austin, TX 78712.
IEEE Trans Pattern Anal Mach Intell. 1987 Apr;9(4):590-4. doi: 10.1109/tpami.1987.4767947.
In this correspondence, a parallel 2-D convolution scheme is presented. The processing structure is a mesh connected array processor consisting of the same number of simple processing elements as the number of pixels in the image. For most windows considered, the number of computation steps required is the same as that of the coefficients of a convolution window. The proposed scheme can be easily extended to convolution windows of arbitrary size and shape. The basic idea of the proposed scheme is to apply the 1-D systolic concept to 2-D convolution on a mesh structure. The computation is carried out along a path called a convolution path in a systolic manner. The efficiency of the scheme is analyzed for windows of various shapes. The ideal convolution path is a Hamiltonian path ending at the center of the window, the length of which is equal to the number of window coefficients. The simple architecture and control strategy make the proposed scheme suitable for VLSI implementation.
在这封通信中，提出了一种并行二维卷积方案。处理结构是一个由与图像中的像素数相同数量的简单处理元素组成的网格连接数组处理器。对于大多数考虑的窗口，所需的计算步骤数与卷积窗口的系数数相同。所提出的方案可以很容易地扩展到任意大小和形状的卷积窗口。该方案的基本思想是将一维脉动概念应用于网格结构上的二维卷积。计算以脉动方式沿着称为卷积路径的路径进行。分析了各种形状窗口的方案效率。理想的卷积路径是结束于窗口中心的哈密顿路径，其长度等于窗口系数的数量。简单的体系结构和控制策略使所提出的方案适合 VLSI 实现。
