首页> 外文会议>International Workshop on Graphics Recognition(GREC 2005); 20050825-26; Hong Kong(CN) >An Incremental Parser to Recognize Diagram Symbols and Gestures Represented by Adjacency Grammars
【24h】

An Incremental Parser to Recognize Diagram Symbols and Gestures Represented by Adjacency Grammars

机译:增量解析器,以识别邻接语法表示的图符号和手势

获取原文
获取原文并翻译 | 示例

摘要

Syntactic approaches on structural symbol recognition are characterized by defining symbols using a grammar. Following the grammar productions a parser is constructed to recognize symbols: given an input, the parser detects whether it belongs to the language generated by the grammar, recognizing the symbol, or not. In this paper, we describe a parsing methodology to recognize a set of symbols represented by an adjacency grammar. An adjacency grammar is a grammar that describes a symbol in terms of the primitives that form it and the relations among these primitives. These relations are called constraints, which are validated using a defined cost function. The cost function approximates the distortion degree associated to the constraint. When a symbol has been recognized the cost associated to the symbol is like a similarity value. The evaluation of the method has been realized from a qualitative point of view, asking some users to draw some sketches. From a quantitative point of view a benchmarking database of sketched symbols has been used.
机译:结构符号识别的句法方法的特征是使用语法定义符号。在产生语法之后,构造一个解析器以识别符号:给定输入后,解析器将检测它是否属于语法生成的语言,从而识别符号。在本文中,我们描述了一种解析方法来识别由邻接文法表示的一组符号。邻接文法是根据形成符号的原语以及这些原语之间的关系来描述符号的语法。这些关系称为约束,可以使用定义的成本函数进行验证。成本函数近似于与约束相关的失真度。识别符号后,与该符号相关的成本就类似于相似度值。该方法的评估已从定性的角度实现,要求一些用户绘制一些草图。从定量的角度来看,已使用草绘符号的基准数据库。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号