在线手写数学表达式识别的解析算法比较

2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR) Pub Date : 2016-10-01 DOI:10.1109/ICFHR.2016.0079

A. D. Le, M. Nakagawa

{"title":"在线手写数学表达式识别的解析算法比较","authors":"A. D. Le, M. Nakagawa","doi":"10.1109/ICFHR.2016.0079","DOIUrl":null,"url":null,"abstract":"Parsing process is the most important process in recognition of online handwritten mathematical expressions. There are two basic approaches: stroke order dependent (SOD) and stroke order free (SOF) approaches. The SOD approach depends on stroke order while the SOF approach is free from stroke order. Although both approaches have shown high recognition rates in recently competitions, there are a few of works that analyze the complexities of parsing algorithms in the same experimental conditions. In this work, we have tested and analyzed recognition rate, recognition speed and memory space required by parsing algorithms on CROHME 2014. SOF is slightly superior to SOD in recognition rate, but SOD is faster in processing time and lower in memory space than SOF.","PeriodicalId":194844,"journal":{"name":"2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Comparison of Parsing Algorithms for Recognizing Online Handwritten Mathematical Expressions\",\"authors\":\"A. D. Le, M. Nakagawa\",\"doi\":\"10.1109/ICFHR.2016.0079\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Parsing process is the most important process in recognition of online handwritten mathematical expressions. There are two basic approaches: stroke order dependent (SOD) and stroke order free (SOF) approaches. The SOD approach depends on stroke order while the SOF approach is free from stroke order. Although both approaches have shown high recognition rates in recently competitions, there are a few of works that analyze the complexities of parsing algorithms in the same experimental conditions. In this work, we have tested and analyzed recognition rate, recognition speed and memory space required by parsing algorithms on CROHME 2014. SOF is slightly superior to SOD in recognition rate, but SOD is faster in processing time and lower in memory space than SOF.\",\"PeriodicalId\":194844,\"journal\":{\"name\":\"2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)\",\"volume\":\"137 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICFHR.2016.0079\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICFHR.2016.0079","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

解析过程是在线手写数学表达式识别中最重要的过程。有两种基本方法:卒中顺序依赖(SOD)方法和卒中顺序自由(SOF)方法。SOD方法依赖于冲程顺序，而SOF方法不受冲程顺序的影响。虽然这两种方法在最近的比赛中都显示出很高的识别率，但在相同的实验条件下，分析解析算法复杂性的工作很少。在这项工作中，我们在CROHME 2014上测试和分析了解析算法的识别率、识别速度和所需的内存空间。在识别率上，SOD略优于SOD，但SOD处理时间快于SOD，占用内存空间小于SOD。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Comparison of Parsing Algorithms for Recognizing Online Handwritten Mathematical Expressions

Parsing process is the most important process in recognition of online handwritten mathematical expressions. There are two basic approaches: stroke order dependent (SOD) and stroke order free (SOF) approaches. The SOD approach depends on stroke order while the SOF approach is free from stroke order. Although both approaches have shown high recognition rates in recently competitions, there are a few of works that analyze the complexities of parsing algorithms in the same experimental conditions. In this work, we have tested and analyzed recognition rate, recognition speed and memory space required by parsing algorithms on CROHME 2014. SOF is slightly superior to SOD in recognition rate, but SOD is faster in processing time and lower in memory space than SOF.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)

自引率

0.00%

发文量