A Fast Matching Algorithm for Graph-Based Handwriting Recognition

DOI10.1007/978-3-642-38221-5_21zbMath1382.68208OpenAlexW181192379MaRDI QIDQ4922164

Kaspar Riesen, Andreas Fischer, Volkmar Frinken, Horst Bunke, Ching-Yun Suen

Publication date: 28 May 2013

Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38221-5_21

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Related Items (5)

Graph characterization by counting sink star subgraphs ⋮ Metric for Comparison of Graph-Theoretic Models of the Same Dimension with Ordered Vertices ⋮ Approximation of graph edit distance based on Hausdorff matching ⋮ Graph extensions, edit number and regular graphs ⋮ Convex graph invariant relaxations for graph edit distance

This page was built for publication: A Fast Matching Algorithm for Graph-Based Handwriting Recognition