Arroyo, Fernando; Gomez, Sandra; Mitrana, Victor; Sanchez, José Ramón Networks of picture processors with circular permutation. (English) Zbl 1474.68152 Proc. Rom. Acad., Ser. A, Math. Phys. Tech. Sci. Inf. Sci. 20, No. 3, 307-315 (2019). Summary: We propose a new variant of network of evolutionary picture processors, where the operations “mask” and “unmask” considered in H. Bordihn et al. [Soft Comput. 21, No. 19, 5529–5541 (2017; Zbl 1472.68054)] 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 \(\mathcal{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. MSC: 68Q06 Networks and circuits as models of computation; circuit complexity 68T10 Pattern recognition, speech recognition 68U10 Computing methodologies for image processing Keywords:picture language; circularly permuting picture processor; network of picture processors with circular permutation; picture pattern matching Citations:Zbl 1472.68054 PDFBibTeX XMLCite \textit{F. Arroyo} et al., Proc. Rom. Acad., Ser. A, Math. Phys. Tech. Sci. Inf. Sci. 20, No. 3, 307--315 (2019; Zbl 1474.68152)