首页> 外文会议>Nonlinear Image Processing V >New descriptor for skeletons of planar shapes: the calypter
【24h】

New descriptor for skeletons of planar shapes: the calypter

机译:平面骨架的新描述符:calypter

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

摘要

Abstract: The mathematical definition of the skeleton as the locus of centers of maximal inscribed discs is a nondigitizable one. The idea presented in this paper is to incorporate the skeleton information and the chain-code of the contour into a single descriptor by associating to each point of a contour the center and radius of the maximum inscribed disc tangent at that point. This new descriptor is called calypter. The encoding of a calypter is a three stage algorithm: (1) chain coding of the contour; (2) euclidean distance transformation, (3) climbing on the distance relief from each point of the contour towards the corresponding maximal inscribed disc center. Here we introduce an integer euclidean distance transform called the holodisc distance transform. The major interest of this holodisc transform is to confer 8-connexity to the isolevels of the generated distance relief thereby allowing a climbing algorithm to proceed step by step towards the centers of the maximal inscribed discs. The calypter has a cyclic structure delivering high speed access to the skeleton data. Its potential uses are in high speed euclidean mathematical morphology, shape processing, and analysis. !12
机译:摘要:骨架的数学定义是最大内切圆盘中心的轨迹,是不可数字化的。本文提出的想法是通过将轮廓上的最大内切圆盘的中心和半径与轮廓的每个点相关联,将轮廓的骨架信息和轮廓链代码合并到单个描述符中。这个新的描述符称为calypter。 calypter的编码是一个三阶段算法:(1)轮廓的链编码; (2)欧几里德距离变换,(3)从轮廓的每个点向相应的最大内接圆盘中心爬升距离。在这里,我们介绍一个称为全息距离转换的整数欧几里德距离转换。该全息图变换的主要目的是赋予所生成的距离释放量的等值线8个连接度,从而使攀爬算法逐步朝着最大内接圆盘的中心前进。 calypter具有循环结构,可提供对骨架数据的高速访问。它的潜在用途是在高速欧氏数学形态学,形状处理和分析中。 !12

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号