Decorative Character Recognition by Graph Matching

Shinichiro OMACHI; Shunichi MEGAWA; Hirotomo ASO

doi:10.1093/ietisy/e90-d.10.1720

Decorative Character Recognition by Graph Matching

Shinichiro OMACHI, Shunichi MEGAWA, Hirotomo ASO

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Information Vol.E90-D No.10 pp.1720-1723

Publication Date: 2007/10/01

Publicized

Online ISSN: 1745-1361

DOI: 10.1093/ietisy/e90-d.10.1720

Type of Manuscript: LETTER

Category: Image Recognition, Computer Vision

Cite this

Copy

Shinichiro OMACHI, Shunichi MEGAWA, Hirotomo ASO, "Decorative Character Recognition by Graph Matching" in IEICE TRANSACTIONS on Information, vol. E90-D, no. 10, pp. 1720-1723, October 2007, doi: 10.1093/ietisy/e90-d.10.1720.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/information/10.1093/ietisy/e90-d.10.1720/_p

Copy

@ARTICLE{e90-d_10_1720,
author={Shinichiro OMACHI, Shunichi MEGAWA, Hirotomo ASO, },
journal={IEICE TRANSACTIONS on Information},
title={Decorative Character Recognition by Graph Matching},
year={2007},
volume={E90-D},
number={10},
pages={1720-1723},
abstract={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.},
keywords={},
doi={10.1093/ietisy/e90-d.10.1720},
ISSN={1745-1361},
month={October},}

Copy

TY - JOUR
TI - Decorative Character Recognition by Graph Matching
T2 - IEICE TRANSACTIONS on Information
SP - 1720
EP - 1723
AU - Shinichiro OMACHI
AU - Shunichi MEGAWA
AU - Hirotomo ASO
PY - 2007
DO - 10.1093/ietisy/e90-d.10.1720
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E90-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2007
AB - 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.
ER -