Decorative character recognition by graph matching

Shinichiro Omachi, Shunichi Megawa, Hirotomo Aso

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


A practical optical character reader is required to deal with not only common fonts but also complex designed fonts. However, recognizing various kinds of decorative character images is still a challenging problem in the field of document image analysis. Since appearances of such decorative characters are complicated, most general character recognition systems cannot give good performances on decorative characters. In this paper, an algorithm that recognizes decorative characters by structural analysis using a graph-matching technique is proposed. Character structure is extracted by using topographical features of multi-scale images, and the extracted structure is represented by a graph. A character image is recognized by matching graphs of the input and standard patterns. Experimental results show the effectiveness of the proposed algorithm.

Original languageEnglish
Pages (from-to)1720-1723
Number of pages4
JournalIEICE Transactions on Information and Systems
Issue number10
Publication statusPublished - 2007 Oct


  • Character recognition
  • Decorative character
  • Graph matching

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence


Dive into the research topics of 'Decorative character recognition by graph matching'. Together they form a unique fingerprint.

Cite this