|   | 
Details
   web
Record
Author (up) Andreas Fischer; Ching Y. Suen; Volkmar Frinken; Kaspar Riesen; Horst Bunke
Title A Fast Matching Algorithm for Graph-Based Handwriting Recognition Type Conference Article
Year 2013 Publication 9th IAPR – TC15 Workshop on Graph-based Representation in Pattern Recognition Abbreviated Journal
Volume 7877 Issue Pages 194-203
Keywords
Abstract 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.
Address Vienna; Austria; May 2013
Corporate Author Thesis
Publisher Springer Berlin Heidelberg Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title LNCS
Series Volume Series Issue Edition
ISSN 0302-9743 ISBN 978-3-642-38220-8 Medium
Area Expedition Conference GBR
Notes DAG; 600.045; 605.203 Approved no
Call Number Admin @ si @ FSF2013 Serial 2294
Permanent link to this record