z-logo
open-access-imgOpen Access
Structure Extraction from Decorated Characters by Graph Spectral Decomposition and Component Selection Criterion
Author(s) -
Hideaki Kawano,
Akito Shimamura,
Hiroshi Maeda,
Hideaki Orii,
Norikazu Ikoma
Publication year - 2010
Publication title -
journal of advanced computational intelligence and intelligent informatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.172
H-Index - 20
eISSN - 1343-0130
pISSN - 1883-8014
DOI - 10.20965/jaciii.2010.p0179
Subject(s) - computer science , graph , decomposition , artificial intelligence , pattern recognition (psychology) , selection (genetic algorithm) , character (mathematics) , theoretical computer science , mathematics , geometry , biology , ecology
For recognition of decorated characters through existing optical character recognition system (OCR), structure extraction of the decorated characters is required. Omachi et al. proposed a structure extraction method for these characters. However, characters including both thin lines and thick lines simultaneously tend to fail the extraction of structure. To overcome the performance in Omachi's method, we have proposed another method based on graph spectral decomposition. In the previous work, we showed applicability of the proposed method to wider range of decorated characters. However, selection criterion among decomposed components for obtaining good results have not been clarified. In this paper, we propose a new criterion to select components in the graph spectral decomposition framework for structure extraction. Experimental results show the validity of the criterion.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom