TY  - JOUR
A1  - Bordihn, Henning
A1  - Bottoni, Paolo
A1  - Labella, Anna
A1  - Mitrana, Victor
T1  - Networks of picture processors as problem solvers
JF  - Soft Computing
N2  - We propose a solution based on networks of picture processors to the problem of picture pattern matching. The network solving the problem can be informally described as follows: it consists of two subnetworks, one of them extracts at each step, simultaneously, all subpictures of identical (progressively decreasing) size from the input picture and sends them to the other subnetwork which checks whether any of the received pictures is identical to the pattern. We present an efficient solution based on networks with evolutionary processors only, for patterns with at most three rows or columns. Afterward, we present a solution based on networks containing both evolutionary and hiding processors running in O(n + m + kl) computational (processing and communication) steps, for any size (n, m) of the input pic-ture and (k, l) of the pattern. From the proofs of these results, we infer that any (k, l)-local language with 1 <= k <= 3 can be decided in O(n + m + l) computational steps by networks with evolutionary processors only, while any (k, l)-local language with arbitrary k, l can be decided in O(n + m + kl) computational steps by networks containing both evolutionary and hiding processors.
KW  - Picture
KW  - Picture processor
KW  - Hiding processor
KW  - Picture matching
KW  - (k,l)-Local language
Y1  - 2016
U6  - https://doi.org/10.1007/s00500-016-2206-y
SN  - 1432-7643
SN  - 1433-7479
VL  - 21
SP  - 5529
EP  - 5541
PB  - Springer
CY  - New York
ER  -