A systolic algorithm for Euclidean distance transform
Related Experiment Video
Updated: Aug 7, 2026

Quantifying Intermembrane Distances with Serial Image Dilations
Published on: September 28, 2018
Masafumi Miyazawa1, Peifeng Zeng, Naoyuki Iso
1Brother Industries, Ltd., 3-17-1, osu, naka-ku, Nagoya, Japan. miyazawa@nuee.nagoya-u.ac.jp
Abstract:
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.
More Related Videos
11:04Quantification of Global Diastolic Function by Kinematic Modeling-based Analysis of Transmitral Flow via the Parametrized Diastolic Filling Formalism
Published on: September 1, 2014
06:26Direct Linear Transformation for the Measurement of In-Situ Peripheral Nerve Strain During Stretching
Published on: January 12, 2024
Related Concept Videos
The Distance Formula
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
Distance Measurements by Taping
Distance Corrections
The Dot Product
Transformations of Functions II