Graph representation of machine-printed character bitmaps

Radovan V. Krtolica; Brian Warner

doi:10.1117/12.60661

1 June 1992 Graph representation of machine-printed character bitmaps

Radovan V. Krtolica, Brian Warner

Proceedings Volume 1769, Image Algebra and Morphological Image Processing III; (1992) https://doi.org/10.1117/12.60661
Event: San Diego '92, 1992, San Diego, CA, United States

Abstract

Binary images of machine-printed characters are essentially graphical objects composed of nodes (extremes, intersections) and lines connecting them. Provided distinction is made between straight lines and curves, this is a fair representation of individual characters. Only a few carefully located pixels convey the most significant part of the information concerning the curvature of the path connecting two nodes. These pixels may be thought of as additional nodes connected by straight lines in a graph that represents the machine-printed character. In this paper, a character is represented by nodes (character extremes, intersections and additional nodes replacing curves) and straight lines connecting them. This graphical object carries two kinds of information about the character that is represented: geometric information concerning the location of nodes with the relative length and orientation of the connecting lines, and the topological information about the existing connections between different pairs of nodes given by the connectivity matrix or a corresponding graph. Due to its geometric properties, this object can be used for character recognition by template matching, which is insensitive to broken characters caused by missing (or parasite) pixels. On the other hand, its graph, as a mathematical object, can be used for structure based optical character recognition, so that the character can be recognized under wide variations in character styles. Combining template matching of graphs as geometric objects with spectral distance of graphs meant as sets of relations between nodes and edges, seems to be a promising way to achieve high accuracy multifont character recognition. The procedure to obtain the graph representation of machine-printed characters is based on morphological processing of their binary images.

Citation Download Citation

Radovan V. Krtolica and Brian Warner "Graph representation of machine-printed character bitmaps", Proc. SPIE 1769, Image Algebra and Morphological Image Processing III, (1 June 1992); https://doi.org/10.1117/12.60661

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
12 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Raster graphics

Optical character recognition

Image processing

Detection and tracking algorithms

Matrices

Feature extraction

Binary data

Show All Keywords

Keywords/Phrases

Search In:

Publication Years