首页> 外文期刊>IEEE Transactions on Pattern Analysis and Machine Intelligence >Computing the medial axis transform in parallel with eight scan operations
【24h】

Computing the medial axis transform in parallel with eight scan operations

机译:与八次扫描操作并行计算中间轴变换

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

摘要

The main result of this paper shows that the block-based digital medial axis transform can be computed in parallel by a constant number of calls to scan (parallel prefix) operations. This gives time- and/or work-optimal parallel implementations for the distance-based and the block-based medial axis transform in a wide variety of parallel architectures. Since only eight scan operations plus a dozen local operations are performed, the algorithm is very easy to program and use. The originality of our approach is the use of the notion of a derived grid and the oversampling of the image in order to reduce the computation of the block-based medial axis transform in the original grid to the much easier task of computing the distance based medial axis transform of the oversampling of the image on the derived grid.
机译:本文的主要结果表明,通过恒定数量的扫描(并行前缀)操作调用,可以并行计算基于块的数字中间轴变换。这为各种并行体系结构中的基于距离和基于块的中间轴变换提供了时间和/或工作最佳的并行实现。由于仅执行八次扫描操作加上一打本地操作,因此该算法非常易于编程和使用。我们的方法的独创性是使用派生网格的概念和图像的过采样,以便将原始网格中基于块的中间轴变换的计算量减少到计算基于距离的中间量的任务更加容易在派生网格上对图像进行过采样的轴变换。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号