首页> 外文期刊>IEEE Transactions on Pattern Analysis and Machine Intelligence >Linear time Euclidean distance transform algorithms
【24h】

Linear time Euclidean distance transform algorithms

机译:线性时间欧氏距离变换算法

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

摘要

Two linear time (and hence asymptotically optimal) algorithms for computing the Euclidean distance transform of a two-dimensional binary image are presented. The algorithms are based on the construction and regular sampling of the Voronoi diagram whose sites consist of the unit (feature) pixels in the image. The first algorithm, which is of primarily theoretical interest, constructs the complete Voronoi diagram. The second, more practical, algorithm constructs the Voronoi diagram where it intersects the horizontal lines passing through the image pixel centers. Extensions to higher dimensional images and to other distance functions are also discussed.
机译:提出了两种线性时间(因此渐近最优)算法,用于计算二维二进制图像的欧几里德距离变换。该算法基于Voronoi图的构造和常规采样,该图的位置由图像中的单位(特征)像素组成。第一个算法具有主要的理论价值,它构成了完整的Voronoi图。第二种更实用的算法构造了Voronoi图,该图与穿过图像像素中心的水平线相交。还讨论了对高维图像和其他距离函数的扩展。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号