Tsung-Hsien Tsai, J. Hsieh, Hung-Chun Chen, Shih-Chin Huang
{"title":"Reverse time ordered stroke context for air-writing recognition","authors":"Tsung-Hsien Tsai, J. Hsieh, Hung-Chun Chen, Shih-Chin Huang","doi":"10.1109/UMEDIA.2017.8074090","DOIUrl":null,"url":null,"abstract":"A novel real-time recognition system is proposed to recognize air-written characters without using any pen-starting-lift information. This pen-starting sign is commonly adopted in most of air-writing recognition systems for simplifying the complexity of trajectory matching but often results in inconvenience of usage for users. To tackle this problem, a novel reverse time ordered stroke context is proposed to represent an air-written trajectory in a backward way so that redundant starting-lift data can be effectively filtered out. Then the air-writing recognition problem can be formulated as a path finding problem which is easily solved by a stroke weighting scheme. Another two challenging problems, i.e., the multiplicity problem and the confusion problem also often happen in an air-writing recognition system. The first problem means a character is often written differently among different users. The second problem means different characters often own similar writing trajectory, e.g., {‘b’, ‘p’, ‘D’}. The two problems can be well tackled by introducing a new hierarchical classification scheme which constructs a three-layer structure to represent an air-writing character with different sampling rates. The first layer is designed for tackling the confusion problem by a grouping scheme. The second and third layers are used for dealing with the multiplicity problem of writing styles. All the alphabets (including lowercase, capital, and digital letters) are tested in this system and can be recognized in real time. Performance evaluation shows that the proposed solution achieves quite higher recognition accuracy (more than 94.7%) even though no starting gesture is required.","PeriodicalId":440018,"journal":{"name":"2017 10th International Conference on Ubi-media Computing and Workshops (Ubi-Media)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 10th International Conference on Ubi-media Computing and Workshops (Ubi-Media)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UMEDIA.2017.8074090","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
A novel real-time recognition system is proposed to recognize air-written characters without using any pen-starting-lift information. This pen-starting sign is commonly adopted in most of air-writing recognition systems for simplifying the complexity of trajectory matching but often results in inconvenience of usage for users. To tackle this problem, a novel reverse time ordered stroke context is proposed to represent an air-written trajectory in a backward way so that redundant starting-lift data can be effectively filtered out. Then the air-writing recognition problem can be formulated as a path finding problem which is easily solved by a stroke weighting scheme. Another two challenging problems, i.e., the multiplicity problem and the confusion problem also often happen in an air-writing recognition system. The first problem means a character is often written differently among different users. The second problem means different characters often own similar writing trajectory, e.g., {‘b’, ‘p’, ‘D’}. The two problems can be well tackled by introducing a new hierarchical classification scheme which constructs a three-layer structure to represent an air-writing character with different sampling rates. The first layer is designed for tackling the confusion problem by a grouping scheme. The second and third layers are used for dealing with the multiplicity problem of writing styles. All the alphabets (including lowercase, capital, and digital letters) are tested in this system and can be recognized in real time. Performance evaluation shows that the proposed solution achieves quite higher recognition accuracy (more than 94.7%) even though no starting gesture is required.
提出了一种不需要任何起笔升降信息的空写字符实时识别系统。为了简化轨迹匹配的复杂性,在大多数空写识别系统中普遍采用该起笔标志,但往往给用户带来使用上的不便。为了解决这一问题,提出了一种新的逆时间顺序冲程上下文,以反向的方式表示空气写入的轨迹,从而有效地过滤掉冗余的启动-升力数据。然后将空写识别问题表述为寻径问题,该寻径问题易于用笔划加权方案求解。另外两个具有挑战性的问题,即多重性问题和混淆问题也经常出现在空写识别系统中。第一个问题是,一个字符在不同的用户之间的写法往往不同。第二个问题意味着不同的字符通常具有相似的书写轨迹,例如,{' b ', ' p ', ' D '}。引入一种新的分层分类方案可以很好地解决这两个问题,该方案构建了一个三层结构来表示不同采样率的空写字符。第一层设计用于通过分组方案解决混淆问题。第二和第三层用于处理写作风格的多样性问题。所有的字母(包括小写字母、大写字母和数字字母)都在该系统中进行了测试,并可以实时识别。性能评估表明,即使不需要启动手势,所提出的解决方案也达到了相当高的识别准确率(超过94.7%)。