Browse Prior Art Database

Two Level Character Recognition Logic

IP.com Disclosure Number: IPCOM000054586D
Original Publication Date: 1980-Mar-01
Included in the Prior Art Database: 2005-Feb-13

Publishing Venue

IBM

Related People

Authors:
Goddard, RD Lotspiech, JB [+details]

Abstract

Minimum distance, or template matching, algorithms are generally regarded as accurate, but relatively slow, means for optical character recognition, whereas tree search algorithms are usually fast but less accurate, particularly if there are errors in the character to be identified. The two-level process described below utilizes the speed of tree search for preliminary identification, followed by the accuracy of minimum distance for confirmation or subsequent improved identification.