Matching graph embeddings for shape analysis

Past research in shape analysis and OCR has often emphasized graph matching techniques. We propose to use matching of graph embeddings because this is what is actually of interest. In this way we obtain faster and simpler algorithms since most decisions can be made on the basis of graph labels (the geometry of the embedding) rather than the topology of the graph. The latter has to examined only in very few cases. The proposed algorithm consists of four sieves that compare branches of two embeddings by (normalized), angle, y-position, x-position, and length. Pairs of graphs that pass all the sieves have a node correspondence established so the next step compares degrees. Finally paths are determined using Kleene´s algorithm and compared with prototype arcs