A novel learning-free word spotting approach based on graph representation - Université Jean-Monnet-Saint-Étienne Access content directly
Conference Papers Year : 2014

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.
No file

Dates and versions

ujm-01017651 , version 1 (02-07-2014)

Identifiers

  • HAL Id : ujm-01017651 , version 1

Cite

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⟩
135 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More