Filling by quadrants or octants

✍ Scribed by H.H Atkinson; I Gargantini; T.R.S Walsh

• Publisher: Elsevier Science
• Year: 1985
• Weight: 99 KB
• Volume: 31
• Category: Article
• ISSN: 0734-189X
• DOI: 10.1016/0734-189x(85)90046-5

✦ Synopsis

Computational techniques for implementing the Mat-r-Hi&em edge detection operator, -v'G(r), and its space-time extensions are considered. It is shown how this kind of convolution operation may be carried out simply and efficiently by factorizing the mask and performing the multidimensional convolution as a sequence of one-dimensional convolutions. For a d-dimensional mask of size R, the computational effort required in order to carry out the sequence of 1D convolutions varies roughly as d*n compared to nd for a multidimensional convolution. Computational examples carried out on a SIMD machine (an ICL distributed array processor-DAP) are described and it is shown that convolution with masks of radius 8 on 64 x 64 images can be carried out in 13 ms in two dimensions (mask support = 200 pixels) and 21 ms in three-dimensions (support = 2000 pixels). A brief comparison is made with the FFT technique for performing the convolution.