A novel learning-free word spotting approach based on graph representation

Abstract : Effective information retrieval on handwritten document images has always been a challenging task. In this paper, we propose a novel handwritten word spotting approach based on graph representation. The presented model comprises both topological and morphological signatures of handwriting. Skeleton-based graphs with the Shape Context labelled vertexes are established for connected components. Each word image is represented as a sequence of graphs. In order to be robust to the handwriting variations, an exhaustive merging process based on DTW alignment result is introduced in the similarity measure between word images. With respect to the computation complexity, an approximate graph edit distance approach using bipartite matching is employed for graph matching. The experiments on the George Washington dataset and the marriage records from the Barcelona Cathedral dataset demonstrate that the proposed approach outperforms the state-of-the-art structural methods.
Document type :
Conference papers
Complete list of metadatas

https://hal-ujm.archives-ouvertes.fr/ujm-01017651
Contributor : Christine Largeron <>
Submitted on : Wednesday, July 2, 2014 - 9:39:02 PM
Last modification on : Friday, January 11, 2019 - 5:08:47 PM

Identifiers

  • HAL Id : ujm-01017651, version 1

Citation

Christine Largeron, Véronique Eglin, Christophe Garcia, Peng Wang, Llados J., et al.. A novel learning-free word spotting approach based on graph representation. 11th IAPR workshop on Document Analysis System (DAS 2014), Apr 2014, Tours, France. ⟨ujm-01017651⟩

Share

Metrics

Record views

222