A systolic algorithm for Euclidean distance transform

被引：8

作者：

Miyazawa, M

Zeng, PF

Iso, N

Hirata, T

机构：

[1] Brother Ind Ltd, Naka Ku, Nagoya, Aichi, Japan

[2] Donghua Univ, Sch Comp Sci, Shanghai 200051, Peoples R China

[3] Chukyo Univ, Sch Informat Sci & Technol, Chikusa Ku, Nagoya, Aichi, Japan

[4] Nagoya Univ, Grad Sch Informat Sci, Chikusa Ku, Nagoya, Aichi 4648601, Japan

来源：

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE | 2006年 / 28卷 / 07期

关键词：

Euclidean distance transform; systolic array; hardware algorithm; image processing;

D O I：

10.1109/TPAMI.2006.133

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The Euclidean distance transform is one of the fundamental operations in image processing. It has been widely used in computer vision, pattern recognition, morphological filtering, and robotics. This paper proposes a systolic algorithm that computes the Euclidean distance map of an N x N binary image in 3N clocks on 2N(2) processing cells. The algorithm is designed so that the hardware resources are reduced; especially no mulitipliers are used and, thus, it facilitates VLSI implementation.

引用

页码：1127 / 1134

页数：8

共 18 条

[1] DISTANCE TRANSFORMATIONS IN DIGITAL IMAGES [J].