A timeñlength constrained level building algorithm for large vocabulary handwritten word recognition

/in , , /by
A timeñlength constrained level building algorithm for large vocabulary handwritten word recognition

Koerich, Alessandro L. and Sabourin, Robert and Suen, Ching Y.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2001

Abstract : In this paper we introduce a constrained Level Building Algorithm (LBA) in order to reduce the search space of a Large Vocabulary Handwritten Word Recognition (LVHWR) system. A time and a length constraint are introduced to limit the number of frames and the number of levels of the LBA respectively. A regression model that fits the response variables, namely, accuracy and speed, to a non.linear function of the constraints is proposed and a statistical experimental design technique is employed to analyse the effects of the two constraints on the responses. Experimental results prove that the inclusion of these constraints improve the recognition speed of the LVHWR system without changing the recognition rate significantly.

You might also like
Learning features for offline handwritten signature verification using deep convolutional neural networks
Identificação Automática de Espécies de Pássaros a partir da Análise do Canto
Preliminary results comparing thin-plate splines with finite element methods for modeling brain deformation during neurosurgery using intraoperative ultrasound
Complementary features combined in an HMM-based system to recognize handwritten digits
A region merging prior for variational level set image segmentation
Conception et réalisation d’un laboratoire virtuel d’expérimentation en hydraulique et pneumatique
Evolving ensemble of classifiers in random subspace
Video-based face recognition using ensemble of haar-like deep convolutional neural networks