This Article 
 Bibliographic References 
 Add to: 
OCR in a Hierarchical Feature Space
April 2000 (vol. 22 no. 4)
pp. 400-407

Abstract—This paper describes a character recognition methodology (henceforth referred to as Hierarchical OCR) that achieves high speed and accuracy by using a multiresolution and hierarchical feature space. Features at different resolutions, from coarse to fine-grained, are implemented by means of a recursive classification scheme. Typically, recognizers have to balance the use of features at many resolutions (which yields a high accuracy), with the burden on computational resources in terms of storage space and processing time. We present in this paper, a method that adaptively determines the degree of resolution necessary in order to classify an input pattern. This leads to optimal use of computational resources. The Hierarchical OCR dynamically adapts to factors such as the quality of the input pattern, its intrinsic similarities and differences from patterns of other classes it is being compared against, and the processing time available. Furthermore, the finer resolution is accorded to only certain “zones” of the input pattern which are deemed important given the classes that are being discriminated. Experimental results support the methodology presented. When tested on standard NIST data sets, the Hierarchical OCR proves to be 300 times faster than a traditional K-nearest-neighbor classification method, and 10 times faster than a neural network method. The comparsion uses the same feature set for all methods. Recognition rate of about 96 percent is achieved by the Hierarchical OCR. This is at par with the other two traditional methods.

[1] S. Mori, C.Y. Suen, and K. Yamamoto, “Historical Review of OCR Research and Development,” Proc. IEEE, vol. 80, no. 7, pp. 1,029-1,058, 1992.
[2] G. Nagy, “At the Frontiers of OCR,” Proc. IEEE, vol. 80, pp. 1,093-1,100, 1992.
[3] C.Y. Suen, “Computer Recognition of Unconstrained Handwritten Numerals,” Proc. IEEE, vol. 80, pp. 1,162-1,180, 1992.
[4] J. Mantas, “An Overview of Character Recognition Methodologies,” Pattern Recognition, vol. 19, no. 6, pp. 425-430, 1986.
[5] J.T. Favata, G. Srikantan, and S.N. Srihari, “Handprinted Character/Digit Recognition Using a Multiple Feature/Resolution Philisophy,” Proc. Fourth Int'l Workshop Frontiers in Handwriting Recognition, pp. 57-66, 1994.
[6] R.O. Duda and P.E. Hart, Pattern Classifcation and Scene Analysis. New York: John Wiley and Sons, 1979.
[7] 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.
[8] G. Srikantan, S.W. Lam, and S.N. Srihari, “Gradient-Based Contour Encoding for Character Recognition,” Pattern Recognition, vol. 29, no. 7, pp. 1,147-1,160, 1996.
[9] H. Freeman, “Computer Processing of Line-Drawing Images,” Computing Surveys, vol. 6, no. 1, pp. 57-97, 1974.
[10] C.-C. Lu and J.G. Dunham, “Highly Efficient Coding Schemes for Contour Lines Based on Chain Code Representations,” IEEE Trans. Comm., vol. 39, no. 10, pp. 1,511-1,514, 1991.
[11] M.D. Garris and R.A. Wilkinson, NIST Special Database 3; Binary Images for Handwritten Segmented Characters (HWSC). New York: John Wiley and Sons, 1992.
[12] 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.
[13] 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.
[14] T.M. Ha and H. Bunke, “On-Line, Handwritten Numeral Recognition by Perturbation Method,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 5, pp. 535-539, May 1997.

Index Terms:
Pattern recognition, character/digit recognition, multiresolution, feature space, hierarchical classification, recursion.
Jaehwa Park, Venu Govindaraju, Sargur N. Srihari, "OCR in a Hierarchical Feature Space," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 4, pp. 400-407, April 2000, doi:10.1109/34.845383
Usage of this product signifies your acceptance of the Terms of Use.