DSpace Repository

Discovering Good Regions for Teitelman's Character Recognition Scheme

Show simple item record

dc.creator Winston, Patrick
dc.date 2004-10-04T14:44:18Z
dc.date 2004-10-04T14:44:18Z
dc.date 1969-05-01
dc.date.accessioned 2013-10-09T02:43:47Z
dc.date.available 2013-10-09T02:43:47Z
dc.date.issued 2013-10-09
dc.identifier AIM-176
dc.identifier http://hdl.handle.net/1721.1/6178
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description Warren Teitelman presented a novel scheme for real time character recognition in his master's thesis submitted in June of 1963. A rectangle, in which a character is to be drawn, is divided into two parts, one shaded and the other unshaded. Using this division a computer converts characters into ternary vectors in the following way. If a pen enters the shaded region, a 1 is added to the vector. When the unshaded region is entered, a 0 is appended. Finally 1 illustrates the basic idea he used. Thus, with the shading shown, the character V is converted to 1 0 x 1 0.* A V drawn without lifting the pen would yield a 1 0 1. A t gives 1 0 w 1, and so on. Notice that each character may yield several vectors, depending upon the style of the user as well as the division of the rectangle into shaded and unshaded regions. In order to conserve storage space and reduce search time, the character vectors of Teitelman"s scheme are stored in a tree-like structure like that shown in figure 2.
dc.format 7114243 bytes
dc.format 436693 bytes
dc.format application/postscript
dc.format application/pdf
dc.language en_US
dc.relation AIM-176
dc.title Discovering Good Regions for Teitelman's Character Recognition Scheme


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account