Fast method for extracting representative graph from decorative character images

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we propose a fast method for extracting a representative graph from decorative character images. The representative graph is an effective method to describe structure information of a graph class. However, the computation time of existing methods for extracting a representative graph is extremely expensive. They search all combinations of nodes of a class. The proposed method calculates the common nodes in a class which have same features before the representative graph is extracted. The computation time can be reduced using the common nodes. To show the validly of the proposed method, experiments are carried out using decorative character images.

Original languageEnglish
Title of host publicationProceedings - 2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010
Pages219-223
Number of pages5
DOIs
Publication statusPublished - 2010 Dec 1
Event2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010 - Beijing, China
Duration: 2010 Sep 242010 Sep 26

Publication series

NameProceedings - 2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010

Other

Other2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010
CountryChina
CityBeijing
Period10/9/2410/9/26

Keywords

  • Character recognition
  • Decorative character
  • Structure extraction

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Fast method for extracting representative graph from decorative character images'. Together they form a unique fingerprint.

Cite this