{"title":"一种有效的无笔划顺序在线汉字识别算法","authors":"Wenjie Cai, S. Uchida, H. Sakoe","doi":"10.1109/ICPR.2006.241","DOIUrl":null,"url":null,"abstract":"This paper investigates improvements of an online handwriting stroke-order analysis algorithm - cube search, based on cube graph stroke-order generation model and dynamic programming (DP). By dividing character into radicals, the model is decomposed into intra-radical graphs and an inter-radical graph. This decomposition considerably reduces the time complexity of stroke-order search DP. Experimental results showed an significant improvements in operational speed. Additionally, recognition accuracy was also improved by prohibiting unnatural stroke-order","PeriodicalId":236033,"journal":{"name":"18th International Conference on Pattern Recognition (ICPR'06)","volume":"24 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition\",\"authors\":\"Wenjie Cai, S. Uchida, H. Sakoe\",\"doi\":\"10.1109/ICPR.2006.241\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates improvements of an online handwriting stroke-order analysis algorithm - cube search, based on cube graph stroke-order generation model and dynamic programming (DP). By dividing character into radicals, the model is decomposed into intra-radical graphs and an inter-radical graph. This decomposition considerably reduces the time complexity of stroke-order search DP. Experimental results showed an significant improvements in operational speed. Additionally, recognition accuracy was also improved by prohibiting unnatural stroke-order\",\"PeriodicalId\":236033,\"journal\":{\"name\":\"18th International Conference on Pattern Recognition (ICPR'06)\",\"volume\":\"24 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-08-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"18th International Conference on Pattern Recognition (ICPR'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.2006.241\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"18th International Conference on Pattern Recognition (ICPR'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.2006.241","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm - cube search, based on cube graph stroke-order generation model and dynamic programming (DP). By dividing character into radicals, the model is decomposed into intra-radical graphs and an inter-radical graph. This decomposition considerably reduces the time complexity of stroke-order search DP. Experimental results showed an significant improvements in operational speed. Additionally, recognition accuracy was also improved by prohibiting unnatural stroke-order
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
