{"title":"基于图的字符识别的代表性图生成","authors":"Tomo Miyazaki, S. Omachi","doi":"10.11371/IIEEJ.40.439","DOIUrl":null,"url":null,"abstract":"〈Summary〉 In graph-based pattern recognition, representative graph influences the performances of recognition and clustering. In this paper, we propose a learning method for generating a representative graph of a set of graphs by constructing graph unions with merging corresponding vertices and edges. Those corresponding vertices and edges are obtained using common vertices of a set. The proposed method includes extracting common vertices and correspondences of vertices. To show the validly of the proposed method, we applied the proposed method to pattern recognition problems with character graph database and graphs obtained from decorative character images.","PeriodicalId":153591,"journal":{"name":"The Journal of the Institute of Image Electronics Engineers of Japan","volume":"10 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Representative Graph Generation for Graph-Based Character Recognition\",\"authors\":\"Tomo Miyazaki, S. Omachi\",\"doi\":\"10.11371/IIEEJ.40.439\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"〈Summary〉 In graph-based pattern recognition, representative graph influences the performances of recognition and clustering. In this paper, we propose a learning method for generating a representative graph of a set of graphs by constructing graph unions with merging corresponding vertices and edges. Those corresponding vertices and edges are obtained using common vertices of a set. The proposed method includes extracting common vertices and correspondences of vertices. To show the validly of the proposed method, we applied the proposed method to pattern recognition problems with character graph database and graphs obtained from decorative character images.\",\"PeriodicalId\":153591,\"journal\":{\"name\":\"The Journal of the Institute of Image Electronics Engineers of Japan\",\"volume\":\"10 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Journal of the Institute of Image Electronics Engineers of Japan\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.11371/IIEEJ.40.439\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Journal of the Institute of Image Electronics Engineers of Japan","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11371/IIEEJ.40.439","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Representative Graph Generation for Graph-Based Character Recognition
〈Summary〉 In graph-based pattern recognition, representative graph influences the performances of recognition and clustering. In this paper, we propose a learning method for generating a representative graph of a set of graphs by constructing graph unions with merging corresponding vertices and edges. Those corresponding vertices and edges are obtained using common vertices of a set. The proposed method includes extracting common vertices and correspondences of vertices. To show the validly of the proposed method, we applied the proposed method to pattern recognition problems with character graph database and graphs obtained from decorative character images.