Fletcher, P (2004) Mathematical Theory of Recursive Symbol Systems. Technical Report GEN-0401. Technical Report. Keele University, Keele.

[thumbnail of Mathematical theory of recursive symbol systems (PFletcher).pdf]
Mathematical theory of recursive symbol systems (PFletcher).pdf - Accepted Version

Download (265kB) | Preview


This paper introduces a new type of graph grammar for representing recursively structured two-dimensional geometric patterns, for the purposes of syntactic pattern recognition. The grammars are noise-tolerant, in the sense that they can accommodate patterns that contain pixel noise, variability in the geometric relations between symbols, missing parts, or ambiguous parts, and that overlap other patterns. Geometric variability is modelled using fleximaps, drawing on concepts from the theory of Lie algebras and tensor calculus. The formalism introduced here is intended to be generalisable to all problem domains in which complex, many-layered structures occur in the presence of noise.

Item Type: Monograph (Technical Report)
Uncontrolled Keywords: graph grammars, context-free grammars, recursive symbol processing, parsing, syntactic pattern recognition, noise tolerance, affine invariance
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Natural Sciences > School of Computing and Mathematics
Depositing User: Symplectic
Date Deposited: 19 Nov 2014 12:10
Last Modified: 17 Dec 2018 12:21
URI: https://eprints.keele.ac.uk/id/eprint/63

Actions (login required)

View Item
View Item