...
首页> 外文期刊>Computer-Aided Design >Automated freehand sketch segmentation using radial basis functions
【24h】

Automated freehand sketch segmentation using radial basis functions

机译:使用径向基函数自动进行徒手草图分割

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

摘要

Freehand sketching is widely regarded as an efficient and natural way for interaction between computers and humans. We present a robust computerized scheme to automatically segment freehand sketches into a series of components with specific geometric meaning regardless of whether these are generated online or offline. This task is a necessary first step toward sketch understanding. By exploiting the interpolation/extrapolation characteristic of radial basis functions (RBFs), a greedy algorithm consisting of forward and backward operations is proposed for finding the minimum set of segmentation points that can be used to reconstruct with high fitting accuracy freehand sketches in the form of implicit functions. To obtain segmentation points, a simple angle-based rule is used to remove "bridging" points that provide a smooth transition between consecutive sketch components. Feasibility of the proposed algorithm is demonstrated by a preliminary performance assessment study using ten computer generated drawings. These experiments show that in this dataset sensitivity of the segmentation was higher than 97.5% with a false positive (FP) rate of approximately 25%. The majority of false positive identifications are located on arc regions where a larger number of segmentation points are needed for reconstruction purposes. The primary contribution of this algorithm is that it transforms an ambiguous problem, namely, freehand sketch segmentation, into an implicit function fitting operation. Therefore, this proposed approach has several advantages, including independence of the actual sketching activity, and the ability for a satisfactory detection of the transition point between a line and an arc or between two arcs.
机译:写意草图被广泛认为是计算机与人之间交互的一种有效且自然的方式。我们提出了一个强大的计算机化方案,可以将手绘草图自动分割为具有特定几何意义的一系列组件,而不管这些草图是在线生成还是离线生成。此任务是通向草图理解的必要的第一步。通过利用径向基函数(RBF)的内插/外推特性,提出了一种由前向和后向运算组成的贪婪算法,用于寻找最小的分割点集,这些分割点可用于以高拟合精度的徒手草图形式进行重构。隐式函数。要获取分割点,可使用基于角度的简单规则删除“桥接”点,该点可在连续的草图零件之间提供平滑过渡。通过使用十张计算机生成的图纸进行的初步性能评估研究,证明了该算法的可行性。这些实验表明,在该数据集中,分割的敏感性高于97.5%,假阳性(FP)率约为25%。大多数假阳性标识位于弧区域,在弧区域中需要大量的分割点以进行重建。该算法的主要作用是将一个歧义问题(即徒手草图分割)转换为隐式函数拟合操作。因此,该提出的方法具有几个优点,包括独立于实际的草图绘制活动,以及能够令人满意地检测线与弧之间或两个弧之间的过渡点的能力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号