{"title":"A Real-Time Recognition System for Handwritten Mathematics: Backtracking and Relationship Discovery","authors":"Ray Genoe, Mohand Tahar Kechadi","doi":"10.1109/ICFHR.2010.69","DOIUrl":null,"url":null,"abstract":"This paper describes a real-time approach for handwritten, mathematical expression recognition. Since users can view the output of the system after sketching each stroke, it is useful to retain as much information as possible from previous increments of an expression. However, if subsequent input results in an unordered or multi-stroke symbol, it can have adverse effects on a previously identified expression. Rather than reprocess the entire expression, it would be more beneficial to only reprocess a sub expression. To this end we have developed a backtracking technique, which can revert back to the expression discovered before this sub expression. An added benefit of this technique is that it simplifies other processes of recognition, such as relationship discovery.","PeriodicalId":335044,"journal":{"name":"2010 12th International Conference on Frontiers in Handwriting Recognition","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 12th International Conference on Frontiers in Handwriting Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICFHR.2010.69","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This paper describes a real-time approach for handwritten, mathematical expression recognition. Since users can view the output of the system after sketching each stroke, it is useful to retain as much information as possible from previous increments of an expression. However, if subsequent input results in an unordered or multi-stroke symbol, it can have adverse effects on a previously identified expression. Rather than reprocess the entire expression, it would be more beneficial to only reprocess a sub expression. To this end we have developed a backtracking technique, which can revert back to the expression discovered before this sub expression. An added benefit of this technique is that it simplifies other processes of recognition, such as relationship discovery.