TY  - CONF
AU  - Andreas Fischer
AU  - Ching Y. Suen
AU  - Volkmar Frinken
AU  - Kaspar Riesen
AU  - Horst Bunke
A2  - GBR
PY  - 2013//
TI  - A Fast Matching Algorithm for Graph-Based Handwriting Recognition
T2  - LNCS
BT  - 9th IAPR – TC15 Workshop on  Graph-based Representation in Pattern Recognition
SP  - 194
EP  - 203
VL  - 7877
PB  - Springer Berlin Heidelberg
N2  - The recognition of unconstrained handwriting images is usually based on vectorial representation and statistical classification. Despite their high representational power, graphs are rarely used in this field due to a lack of efficient graph-based recognition methods. Recently, graph similarity features have been proposed to bridge the gap between structural representation and statistical classification by means of vector space embedding. This approach has shown a high performance in terms of accuracy but had shortcomings in terms of computational speed. The time complexity of the Hungarian algorithm that is used to approximate the edit distance between two handwriting graphs is demanding for a real-world scenario. In this paper, we propose a faster graph matching algorithm which is derived from the Hausdorff distance. On the historical Parzival database it is demonstrated that the proposed method achieves a speedup factor of 12.9 without significant loss in recognition accuracy.
SN  - 0302-9743
SN  - 978-3-642-38220-8
L1  - http://refbase.cvc.uab.es/files/FSF2013.pdf
UR  - http://dx.doi.org/10.1007/978-3-642-38221-5_21
N1  - DAG; 600.045; 605.203
ID  - Andreas Fischer2013
ER  -