首页> 外文会议>International Conference on Multimedia and Expo >HIERARCHICAL MATCHING FOR RETRIEVAL OF HAND-DRAWN SKETCHES
【24h】

HIERARCHICAL MATCHING FOR RETRIEVAL OF HAND-DRAWN SKETCHES

机译:用于检索手绘草图的分层匹配

获取原文

摘要

As pen-based devices become more popular, it has motivated several novel research issues in the area of pen computing. One interesting and practical problem is the storage and retrieval of hand-drawn sketches. A sketch can consist of handwritten notes, symbols, free-form hand-drawings, annotations on a document etc. It will be very useful to store the sketches in a database and then retrieve them later. In our prior work, we proposed a method for hand-drawn sketch retrieval by performing stroke-by-stroke matching and by considering the spatial relationship between them. In this paper, we propose a method to simplify a sketch and perform matching in a hierarchical manner. With this approach, a shaded region or a region of complex strokes can be detected automatically and represented as a single hyper-stroke. In the matching stage, the similarity is computed by combining the similarity scores across the feature spaces at each level and the similarity of the stroke hierarchies. A sketch may be better represented by exploiting the structural relationship between the strokes. In addition, as a general rule to the hierarchical approach, it has the advantage of reduced computation thus the retrieval process would speed up.
机译:由于基于笔的设备变得更加流行,它在笔计算领域有多种新的研究问题。一个有趣和实际的问题是手绘草图的存储和检索。草图可以包括手写笔记,符号,自由形式的手绘,文件上的注释等。将草图存储在数据库中并稍后将其检索是非常有用的。在我们之前的工作中,我们提出了一种通过执行逐行匹配和考虑它们之间的空间关系来进行手绘草图检索的方法。在本文中,我们提出了一种简化草图并以分层方式执行匹配的方法。利用这种方法,可以自动检测到阴影区域或复杂笔划区域,并表示为单个超轮程。在匹配阶段,通过在每个级别的特征空间中组合相似度得分和笔划层次结构的相似性来计算相似性。通过利用笔划之间的结构关系,可以更好地表示草图。另外,作为分层方法的一般规则,它具有减少计算的优点,因此检索过程将加速。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号