How Postal Address Readers Are Made Adaptive

In the following chapter we describe how a postal address reader is made adaptive. A postal address reader is a huge application, so we concentrate on technologies used to adapt it to a few important tasks. In particular, we describe adaptation strategies for the detectors and classifiers of regions of interest (ROI), for the classifiers for single character recognition, for a hidden Markov recogniser for hand written words and for the address dictionary of the reader. The described techniques have been deployed in all postal address reading applications, including parcel, flat, letter and in-house mail sorting.

[1]  Jürgen Schürmann,et al.  Pattern classification , 2008 .

[2]  Torsten Caesar,et al.  Sophisticated topology of hidden Markov models for cursive script recognition , 1993, Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93).

[3]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[4]  Marc-Peter Schambach Model length adaptation of an HMM based cursive word recognition system , 2003, Seventh International Conference on Document Analysis and Recognition, 2003. Proceedings..

[5]  Claus Bahlmann,et al.  Measuring HMM similarity with the Bayes probability of error and its application to online handwriting recognition , 2001, Proceedings of Sixth International Conference on Document Analysis and Recognition.

[6]  Marc-Peter Schambach Determination of the number of writing variants with an HMM based cursive word recognition system , 2003, Seventh International Conference on Document Analysis and Recognition, 2003. Proceedings..

[7]  Tamotsu Kasai,et al.  A Method for the Correction of Garbled Words Based on the Levenshtein Metric , 1976, IEEE Transactions on Computers.

[8]  Peter C. Cheeseman,et al.  Bayesian Classification (AutoClass): Theory and Results , 1996, Advances in Knowledge Discovery and Data Mining.