Parsing Noisy Recursively-Structured Geometric Patterns

This paper describes a method for affine-invariant syntactic pattern recognition of geometric patterns using a new type of context-free graph grammar. The grammar accommodates variability in the geometric relations between parts of patterns; this variability is modelled using affine transformations and metric tensors. A parallel parsing algorithm is outlined, which is suitable for non-Eulerian graphs