Handwritten word verification by SVM-based hypotheses re-scoring and multiple thresholds rejection - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Handwritten word verification by SVM-based hypotheses re-scoring and multiple thresholds rejection

Abstract

In the field of isolated handwritten word recognition, the development of verification systems that optimize the trade-off between performance and reliability is still an active research topic. To minimize the recognition errors, usually, a verification system is used to accept or reject the hypotheses produced by an existing recognition system. In this paper, a novel verification architecture is presented. In essence, the recognition hypotheses, re-scored by a set of the support vector machines, are validated by a verification mechanism based on multiple rejection thresholds. In order to tune these (class-dependent) rejection thresholds, an algorithm based on dynamic programming is proposed which focus on maximizing the recognition rate for a given prefixed error rate.
Fichier principal
Vignette du fichier
icfhr2010guichard.pdf (137.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00542856 , version 1 (04-12-2010)

Identifiers

  • HAL Id : inria-00542856 , version 1

Cite

Laurent Guichard, Alejandro J. Toselli, Bertrand Coüasnon. Handwritten word verification by SVM-based hypotheses re-scoring and multiple thresholds rejection. International Conference on Frontiers in Handwriting Recognition, Nov 2010, Kolkata, India. ⟨inria-00542856⟩
140 View
179 Download

Share

Gmail Facebook X LinkedIn More