This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Adaptive Approach to Offline Handwritten Word Recognition
July 2002 (vol. 24 no. 7)
pp. 920-931
ASCII Text
x 
 
Jaehwa Park, "An Adaptive Approach to Offline Handwritten Word Recognition," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 7, pp. 920-931, July, 2002.
 
 
BibTex
x
 
@article{ 10.1109/TPAMI.2002.1017619,
author = {Jaehwa Park},
title = {An Adaptive Approach to Offline Handwritten Word Recognition},
journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence},
volume = {24},
number = {7},
issn = {0162-8828},
year = {2002},
pages = {920-931},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2002.1017619},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Pattern Analysis and Machine Intelligence
TI - An Adaptive Approach to Offline Handwritten Word Recognition
IS - 7
SN - 0162-8828
SP920
EP931
EPD - 920-931
A1 - Jaehwa Park,
PY - 2002
KW - Pattern recognition
KW - handwritten word recognition
KW - adaptive word recognition.
VL - 24
JA - IEEE Transactions on Pattern Analysis and Machine Intelligence
ER -
 

An adaptive handwritten word recognition method is presented. The key ideas of adaptation are 1) to actively and successively select a subset of features for each word image which provides the minimum required classification accuracy to get a valid answer and 2) to derive a consistent decision metric which works in a multiresolution feature space and considers the interrelationships of a lexicon at the same time. A recursive architecture based on interaction between flexible character classification and deductive decision making is developed. The recognition process starts from the initial coarse level using a minimum number of features, then increases the discrimination power by adding other features adaptively and recursively until the result is accepted by the decision maker. For the computational aspect of a feasible solution, a unified decision metric, recognition confidence, is derived from two measurements: pattern confidence, evaluation of absolute confidence using shape features, and lexical confidence, evaluation of the relative string dissimilarity in the lexicon. Practical implementation and experimental results in reading the handwritten words of the address components of US mail pieces are provided. Up to a 4 percent improvement in recognition performance is achieved compared to a nonadaptive method. The experimental result shows that the proposed method has advantages in producing valid answers using the same number of features as conventional methods.

[1] E. Cohen, J.J. Hull, and S.N. Srihari, “Control Structure for Interpreting Handwritten Addresses,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, no. 10, pp. 1,049-1,055, Oct. 1994.
[2] J.C. Simon, O. Barat, and N. Gorski, “A System for the Recognition of Handwritten Literal Amounts of Checks,” Proc. Int'l Conf. Document Analysis System, pp. 135-155, 1994.
[3] G. Kim and V. Govindaraju, “Bankcheck Recognition Using Cross Validation between Legal and Courtesy Amount,” Automatic Bankcheck Processing, World Scientific, pp. 195-212, 1997.
[4] S.N. Srihari, Y.-C. Shin, V. Ramanaprasad, and D.S. Lee, “Name and Address Block Reader,” Proc. IEEE, vol. 84, no. 7, pp. 1038-1049, July 1996.
[5] Y. Belaid, A. Belaid, and E. Turolla, “Item Searching in Forms: Application to French Tax Form,” Proc. Int'l Conf. Document Analysis and Recognition, pp. 744-747, 1995.
[6] A.W. Senior and A.J. Robinson, An Off-Line Cursive Handwriting Recognition System IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 3, pp. 309-321, Mar. 1998.
[7] G. Kim and V. Govindaraju, “A Lexicon Driven Approach to Handwritten Word Recognition for Real Time Applications,“ IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 4, pp. 366-379, Apr. 1997.
[8] M. Mohammed and P. Gader, “Handwritten Word Recognition Using Segmentation-Free Hidden Markov Modeling and Segmentation-Based Dynamic Programming Techniques,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 5, pp. 548-554, May 1996.
[9] J.T. Favata, “Character Model Word Recognition,” Proc. Int'l Workshop Frontiers in Handwriting Recognition 96, pp. 437-440, 1996.
[10] M.Y. Chen, A. Kundu, and S.N. Srihari, “Variable Duration Hidden Markov Model and Morphological Segmentation for Handwritten Word Recognition,” IEEE Trans. Image Processing, vol. 4, no. 12, pp. 1675-1688, Dec. 1995.
[11] U. Miletzki, T. Bayer, and H. Schafer, “Continuous Learning Systems Postal Address Readers with Built-in Learning Capability,” Proc. Int'l Conf. Document Analysis and Recognition, pp. 329-332, 1999.
[12] G.F. Hughes, "On the Mean Accuracy of Statistical Pattern Recognizers," IEEE Trans. Information Theory, vol. 14, pp. 55-63, 1968.
[13] G.V. Trunk, “A Problem of Dimensionality: A Simple Example,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 1, no. 3, pp. 306-307, 1979.
[14] J.L. McClelland and D.E. Rumelhart, “An Interactive Activation Model of Context Effects in Letter Perception: Part 1. An Account of Basic Findings,” Psychological Rev., vol. 88, pp. 375-407, 1981.
[15] L.E. Baum and T. Petrie, “Statistical Inference for Probabilistic Functions of Finite State Markov Chains,” Annals of Math. Statistics, vol. 37, pp. 1554-1563, 1966.
[16] L.R. Rabiner, “Tutorial on Hidden Markov Model and Selected Applications in Speech Recognition,” Proc. IEEE, vol. 77, no. 2, pp. 257-285, 1989.
[17] A. Kaltenmeier, T. Caesar, J.M. Gloger, and E. Mandler, “Sophisticated Topology of Hidden Markov Models for Cursive Script Recognition,” Proc. Second Int'l Conf. Document Analysis and Recognition, pp. 139-142, 1993.
[18] F. Kimura, M. Sridhar, and Z. Chen, “Improvements of a Lexicon Directed Algorithm for Recognition of Unconstrained Handwritten Words,” Proc. Second Int'l Conf. Document Analysis and Recognition, pp. 18-22, 1993.
[19] M.Y. Chen, A. Kundu, and J. Zhou, “Off-Line Handwritten Word Recognition Using a Hidden Markov Model Type Stochastic Network,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, no. 5, pp. 481-496, 1994.
[20] P.D. Gader, M. Mohammed, and J.H. Chiang, “Handwritten Word Recognition with Character and Inter Character Neural Networks,” IEEE Trans. System, Man, and Cybernetics, pp. 158-164, vol. 27, no. 1, 1997.
[21] S. Madhvanath and V. Govindaraju, “Holistic Lexicon Reduction,” Proc. Third Int'l Workshop Frontiers in Handwriting Recognition, pp. 132-141, 1993.
[22] S. Madhvanath, “Using Holistic Features in Handwritten Word Recognition,” Proc. US Postal Service Advanced Technology Conf., pp. 183-199 1992.
[23] K.-S. Fu, Y.T. Chien, and G.P. Cardillo, “A Dynamic Programming Approach to Sequential Pattern Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 3, pp. 313-326, May 1986.
[24] O.D. Trier, A.K. Jain, and R. Taxt, “Feature Extraction Methods for Character Recognition—A Survey,” Pattern Recognition, vol. 29, no. 4, pp. 641-662, 1996.
[25] R.R. Bailey and M. Srinath, “Orthogonal Moment Features for Use with Parametric and Non-Parametric Classifers,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 4, pp. 369-398, Apr. 1996.
[26] J.T. Favata and G. Srikantan, “A Multiple Feature/Resolution Approach to Handprinted Digit and Character Recognition,” Proc. Int'l J. Imaging Systems and Technology, vol. 7, pp. 304-311, 1996.
[27] C.-S. Lin and C.-L. Hwang, “New Forms of Shape Invariants from Elliptic Fourier Descriptors,” Pattern Recognition, vol. 20, no. 5, pp. 535-545, 1987
[28] J. Park, V. Govindaraju, and S.N. Srihari, OCR in a Hierarchical Feature Space IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 4, pp. 400-407, Apr. 2000.
[29] R.A. Wagner and M.J. Fischer, "The String-to-String Correction Problem," J. ACM, vol. 21, no. 1, pp. 168-78, 1974.
[30] I. Levi, Decisions and Revisions, London, UK: Cambridge Univ. Press, 1984.
[31] M.A. Goodrich, W.C. Stirling, and R.L. Frost, “A Theory of Satisficing Decisions and Control,” IEEE Trans. System, Man and Cybernetics—Part A, vol 28, no. 6, pp. 763-779, 1998.
[32] J. Park, V. Govindaraju, and S.N. Srihari, “Efficient Word Segmentation Driven by Unconstrained Handwritten Phrase Recognition,” Proc. Int'l Conf. Document Analysis and Recognition, pp. 605-608, 1999.
[33] J.C. Simon, “Off-Line Cursive Word Recognition,” Proc. IEEE, vol. 80, no. 7, pp. 1,150-1,160, 1992.
[34] R. Bozinovic and S.N. Srihari, “Off-Line Cursive Script Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 1, pp. 68-83, 1989.
[35] H. Freeman, “Computer Processing of Line-Drawing Images,” Computing Surveys, vol. 6, no. 1, pp. 57-97, 1974.
[36] J.J. Hull, “A Database for Handwritten Text Recognition Research,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, no. 5, pp. 550-554, May 1994.

Index Terms:
Pattern recognition, handwritten word recognition, adaptive word recognition.
Citation:
Jaehwa Park, "An Adaptive Approach to Offline Handwritten Word Recognition," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 7, pp. 920-931, July 2002, doi:10.1109/TPAMI.2002.1017619
Usage of this product signifies your acceptance of the Terms of Use.