ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Pattern Recognition
Volume 24, Issue 7, 1991, Pages 617-632
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (1319 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0031-3203(91)90029-5    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1991 Published by Elsevier Science B.V.

Hierarchical attributed graph representation and recognition of handwritten chinese characters

Si Wei Lu*, Ying Ren* and Ching Y. Suen

* Department of Computer Science, Memorial University of Newfoundland, St. John's, Newfoundland, Canada AlC 5S7 Department of Computer Science, Concordia University, Montreal, Quebec, Canada H3G 1M8

Received 3 January 1991; 
revised 21 December 1991. 
Available online 19 May 2003.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

This paper presents a new method of recognizing handwritten Chinese characters. A structural representation called hierarchical attributed graph representation (HAGR) is introduced to describe handwritten Chinese characters. The HAGR provides a simple and direct representation of handwritten Chinese characters. With HAGR, the recognition process becomes a simple task of graph matching. A cost function mapping a candidate to a model graph is introduced. This approach can tolerate the variations of HAGR which reflect the instabilities or variabilities of handwritten Chinese characters resulting from different writing styles. Several rules have been introduced to rearrange the order of the vertices of the graphs in order to avoid the combinatorial explosion in graph matching. In addition, the database of the character models is organized in a search-tree structure. For a candidate character, the search process to find a corresponding model character has been divided into a number of simple and local decisions at different levels of the tree. This considerably improves the efficiency and accuracy of the matching process.

Author Keywords: Chinese character recognition; Handwritten Chinese character; Search tree database; Hierarchical attributed graph; Attributed graph matching

Article Outline

• References

 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.