Systolic array for complete Euclidean distance transform
Ling Chen, Henry Y. H. Chuang · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1993
The Euclidean distance transform (EDT) converts a binary image into one where each pixel has a value equal to the Euclidean distance to the nearest foreground pixel. It has important uses in image analysis, computer vision and robotics, and so its VLSI implementation is very useful. In this paper, a sequential algorithm which does not require global operations is first presented. We then present a square and a triangular shaped systolic arrays to realize the algorithm. For a n X n image on an equal size systolic array, the computing time is 5n- 5.