Fast method for extracting representative graph from decorative character images

Tomo Miyazaki; Shinichiro Omachi

doi:10.1109/ICNIDC.2010.5657776

Fast method for extracting representative graph from decorative character images

Tomo Miyazaki, Shinichiro Omachi

ENG - Communications Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Proceedings - 2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010
Pages	219-223
Number of pages	5
DOIs	https://doi.org/10.1109/ICNIDC.2010.5657776
Publication status	Published - 2010 Dec 1
Event	2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010 - Beijing, China Duration: 2010 Sep 24 → 2010 Sep 26

Publication series

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

Other

Other	2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010
Country/Territory	China
City	Beijing
Period	10/9/24 → 10/9/26

Keywords

Character recognition
Decorative character
Structure extraction

ASJC Scopus subject areas

Computer Networks and Communications
Hardware and Architecture

Access to Document

10.1109/ICNIDC.2010.5657776

Cite this

Miyazaki, T., & Omachi, S. (2010). Fast method for extracting representative graph from decorative character images. In Proceedings - 2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010 (pp. 219-223). [5657776] (Proceedings - 2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010). https://doi.org/10.1109/ICNIDC.2010.5657776

Fast method for extracting representative graph from decorative character images. / Miyazaki, Tomo ; Omachi, Shinichiro.

Proceedings - 2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010. 2010. p. 219-223 5657776 (Proceedings - 2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Miyazaki, T & Omachi, S 2010, Fast method for extracting representative graph from decorative character images. in Proceedings - 2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010., 5657776, Proceedings - 2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010, pp. 219-223, 2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010, Beijing, China, 10/9/24. https://doi.org/10.1109/ICNIDC.2010.5657776

Miyazaki T , Omachi S. Fast method for extracting representative graph from decorative character images. In Proceedings - 2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010. 2010. p. 219-223. 5657776. (Proceedings - 2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010). https://doi.org/10.1109/ICNIDC.2010.5657776

@inproceedings{a70107528c314688bf2474fb3b4d0097,

title = "Fast method for extracting representative graph from decorative character images",

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.",

keywords = "Character recognition, Decorative character, Structure extraction",

author = "Tomo Miyazaki and Shinichiro Omachi",

year = "2010",

month = dec,

day = "1",

doi = "10.1109/ICNIDC.2010.5657776",

language = "English",

isbn = "9781424468546",

series = "Proceedings - 2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010",

pages = "219--223",

booktitle = "Proceedings - 2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010",

note = "2010 2nd IEEE International Conference on Network Infrastructure and Digital Content, IC-NIDC 2010 ; Conference date: 24-09-2010 Through 26-09-2010",

}

TY - GEN

T1 - Fast method for extracting representative graph from decorative character images

AU - Miyazaki, Tomo

AU - Omachi, Shinichiro

PY - 2010/12/1

Y1 - 2010/12/1

N2 - 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.

AB - 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.

KW - Character recognition

KW - Decorative character

KW - Structure extraction

UR - http://www.scopus.com/inward/record.url?scp=78651291691&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78651291691&partnerID=8YFLogxK

U2 - 10.1109/ICNIDC.2010.5657776

DO - 10.1109/ICNIDC.2010.5657776

M3 - Conference contribution

AN - SCOPUS:78651291691

SN - 9781424468546

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

SP - 219

EP - 223

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

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

Y2 - 24 September 2010 through 26 September 2010

ER -

Fast method for extracting representative graph from decorative character images

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this