NETWORKS OF PICTURE PROCESSORS WITH CIRCULAR PERMUTATION

We propose a new variant of network of evolutionary picture processors, where the operations mask and unmask considered in [4] are replaced by the circular permutation of a row or column on the picture frontier. We propose a solution based on these networks to the picture pattern matching problem that runs in O(n + m + kl) computational steps, where the pattern is of size (k ,l) and the input picture is of size (n,m). We finally discuss how our solution may easily lead to solutions to a few further related problems on pictures.