A fast matching algorithm for graph-based handwriting recognition

DOI10.1007/978-3-642-38221-5_21MaRDI QIDQ4922164zbMATH OpenOpenAlexFDO

Authors Andreas Fischer, Volkmar Frinken, Kaspar Riesen, Ching Y. Suen, Horst Bunke

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)

Recommendations

• Approximation of graph edit distance based on Hausdorff matching
• Speeding up graph edit distance computation through fast bipartite matching
• Inexact graph matching using a hierarchy of matching processes
• Bipartite Graph Matching for Computing the Edit Distance of Graphs
• Model-based stroke extraction and matching for handwritten Chinese character recognition

Cited in

(6)

• Approximation of graph edit distance based on Hausdorff matching
• Graph extensions, edit number and regular graphs
• Convex graph invariant relaxations for graph edit distance
• Graph characterization by counting sink star subgraphs
• scientific article; zbMATH DE number 2090221 (Why is no real title available?)
• Metric for comparison of graph-theoretic models of the same dimension with ordered vertices

This page was built for publication: A fast matching algorithm for graph-based handwriting recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922164)