Fast Exact Euclidean Distance (FEED) Transformation


Share/Save/Bookmark

Schouten, Theo and Broek, Egon van den (2004) Fast Exact Euclidean Distance (FEED) Transformation. In: 17th IEEE International Conference on Pattern Recognition, ICPR 2004, 23-26 August 2004, Cambridge, United Kingdom (pp. pp. 594-597).

open access
[img]
Preview
PDF
285kB
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.
Item Type:Conference or Workshop Item
Copyright:© 2004 IEEE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/79286
Official URL:http://dx.doi.org/10.1109/ICPR.2004.1334599
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page