OCR in a hierarchical feature space

Citations

SCOPUS

0

초록

This paper describes a methodology that allows fast and accurate character recognition while keeping the dimensionality of the feature space relatively small. Higher dimensionality can add to the discriminatory power of a recognizer but pays the price in an increase of computational time. We present a method that achieves high accuracy even with a low-dimensional feature space by simulating a multi-resolution feature space. Our approach is supported by promising experimental results. Recognition rate of 98% is achieved on a test set of about 16,000 handwritten numerals. Recognition rates on upper and lower case handprinted characters is about 95%.

키워드

pattern recognition; character/digit recognition; multi-resolution; feature space; hierarchical classification; recursion
제목
OCR in a hierarchical feature space
저자
Park, Jaehwa; Govindaraju, Venu; Srihari, Sargur
DOI
10.1109/34.845383
발행일
2000-04
유형
Conference Paper
저널명
IEEE Transactions on Pattern Analysis and Machine Intelligence
권
22
호
4
페이지
400 ~ 407