Fast Exact Euclidean Distance (FEED) Transformation

Th.E. Schouten and E.L. van den Broek.

Fast Exact Euclidean Distance (FEED) Transformation. In J. Kittler, M. Petrou and M. Nixon, editors: "Proceedings of the 17th International Conference on Pattern Recognition (ICPR 2004)", volume 3, pages 594-597, IEEE Computer Society, 2004

A full version is available as Technical Report NIII-R0456, NIII, Radboud University Nijmegen, 2004.

Abstract

Fast Exact Euclidean Distance (FEED) transformation is introduced, starting from the inverse of the distance transformation. The prohibitive computational cost of a naive implementation of traditional Euclidean Distance Transformation, is tackled by three operations: restriction of both the number of object pixels and the number of background pixels taken in consideration and pre-computation of the Euclidean distance. Compared to the Shih and Liu 4-scan method the FEED algorithm is often faster and is less memory consuming.

Proceedings (pdf).
NIII report (pdf).
Conference presentation (ppt).