Fast method for extracting representative graph from decorative character images
Tomo Miyazaki, Shinichiro Omachi · 2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content · 2010
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.