Thresholding: A challenge for parallel processing

In the past the speed and low cost of parallel computation for image processing have often been emphasized. To give a sample of the possibilities of parallel processing, a typical task is assessed : image thresholding. We describe the performance of a sequential computer and of an existing parallel machine implementing algorithms which match the architecture of the machines. Performances are estimated in terms of the required processing times and it is shown that, although a great deal of arithmetic computation is involved, the greater the number of image elements, the faster the parallel machine becomes in comparison with the sequential machines.

[1]  Marcel J. E. Golay,et al.  Hexagonal Parallel Pattern Transformations , 1969, IEEE Transactions on Computers.

[2]  S. H. Unger,et al.  A Computer Oriented toward Spatial Problems , 1958 .

[3]  D. M. Watson,et al.  A Parallel Computer for Array Processing , 1974, IFIP Congress.

[4]  P. H. Lindsay Human Information Processing , 1977 .

[5]  Björn Kruse,et al.  A Parallel Picture Processing Machine , 1973, IEEE Transactions on Computers.

[6]  Luigi P. Cordella,et al.  Concavity Point Detection by Iterative Arrays , 1974, Comput. Graph. Image Process..

[7]  Azriel Rosenfeld,et al.  Adjacency in Digital Pictures , 1974, Inf. Control..

[8]  Bruce H. McCormick,et al.  The Illinois Pattern Recognition Computer-ILLIAC III , 1963, IEEE Trans. Electron. Comput..

[9]  Stefano Levialdi,et al.  On shrinking binary picture patterns , 1972, CACM.

[10]  S. Winograd On the Speed Gained in Parallel Methods , 1975 .

[11]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[12]  Sheldon B. Akers A Rectangular Logic Array , 1972, IEEE Trans. Computers.

[13]  T. J. Fountain,et al.  A cellular logic array for image processing , 1973, Pattern Recognit..