By Topic

Script recognition using inhomogeneous P2DHMM and hierarchical search space reduction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bippus, R. ; Inst. for Commun. Technol., Tech. Univ. Braunschweig, Germany ; Margner, V.

Pseudo-2D hidden Markov models (P2DHMMs) manage the assignment of observations to states quite well, whereas the calculation of probabilities is a great problem. To overcome some of the defects of P2DHMMs, we propose the inhomogeneous P2DHMM (IP2DHMM). In contrast to other approaches, it is consistently able to model state duration and observation matrices of fixed height at no additional cost in computational load and number of parameters. At the same time, it enables an efficient pruning mechanism and allows a considerable reduction in decoding time. In order to further reduce the computational load, a combination scheme is presented for multiple recognition stages, using lexical tree beam searching at different resolutions and with models of different complexities (IP2DHMM and 1DHMM). The resulting system is evaluated on three different databases from different application fields: cursive script recognition, recognition of German legal amounts and recognition of city names from live mail

Published in:

Document Analysis and Recognition, 1999. ICDAR '99. Proceedings of the Fifth International Conference on

Date of Conference:

20-22 Sep 1999