Associative and Parallel Processors
ACM Computing Surveys (CSUR)
On shrinking binary picture patterns
Communications of the ACM
Thinning algorithms on rectangular, hexagonal, and triangular arrays
Communications of the ACM
Hexagonal Parallel Pattern Transformations
IEEE Transactions on Computers
A Parallel Picture Processing Machine
IEEE Transactions on Computers
The Future of Parallel Processing
IEEE Transactions on Computers
Mesh-Connected Computers with Broadcasting
IEEE Transactions on Computers
Journal of Visual Languages and Computing
| Hi-index | 14.98 |
Picture processing includes a variety of algorithms employed at different stages within a recognition process. Although single parallel algorithms have been suggested, no systematic comparison with sequential algorithms is available. We propose here some parallel algorithms solving a selected set of picture-processing tasks and compare their speed, when implemented on a CLIP machine, with that of the equivalent sequential algorithms implemented on a standard minicomputer. It is shown that parallel algorithms are faster than the sequential ones by a factor depending on the size of the digitization matrix, even when arithmetical operations are widely involved.