{"title":"基于图形的手写数字字符串识别","authors":"Alexander Filatov, Alexander Gitis, Igor Kil","doi":"10.1109/ICDAR.1995.602033","DOIUrl":null,"url":null,"abstract":"The article presents a handwritten digit string recognition algorithm based on matching input subgraphs with prototype symbol graphs. The article defines a set of acceptable graph transformations corresponding to typical variations of the handwritten symbols. The search for a match between the input subgraph and prototype graph is conducted using this set of transformations. This approach allows us to solve the problems of structure recognition methods caused by a high variability of handwritten symbol topology. The article presents experimental results of the handwritten digit string recognition system.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"40","resultStr":"{\"title\":\"Graph-based handwritten digit string recognition\",\"authors\":\"Alexander Filatov, Alexander Gitis, Igor Kil\",\"doi\":\"10.1109/ICDAR.1995.602033\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The article presents a handwritten digit string recognition algorithm based on matching input subgraphs with prototype symbol graphs. The article defines a set of acceptable graph transformations corresponding to typical variations of the handwritten symbols. The search for a match between the input subgraph and prototype graph is conducted using this set of transformations. This approach allows us to solve the problems of structure recognition methods caused by a high variability of handwritten symbol topology. The article presents experimental results of the handwritten digit string recognition system.\",\"PeriodicalId\":273519,\"journal\":{\"name\":\"Proceedings of 3rd International Conference on Document Analysis and Recognition\",\"volume\":\"80 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-08-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"40\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 3rd International Conference on Document Analysis and Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDAR.1995.602033\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 3rd International Conference on Document Analysis and Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDAR.1995.602033","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The article presents a handwritten digit string recognition algorithm based on matching input subgraphs with prototype symbol graphs. The article defines a set of acceptable graph transformations corresponding to typical variations of the handwritten symbols. The search for a match between the input subgraph and prototype graph is conducted using this set of transformations. This approach allows us to solve the problems of structure recognition methods caused by a high variability of handwritten symbol topology. The article presents experimental results of the handwritten digit string recognition system.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
