Fast Exact Euclidean Distance (FEED) Transformation

Theo Schouten, J. Kittler (Editor), Egon van den Broek, M. Petrou (Editor), M. Nixon (Editor)

    Research output: Contribution to conferencePaperAcademicpeer-review

    19 Citations (Scopus)
    64 Downloads (Pure)

    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.
    Original languageUndefined
    Pages594-597
    Number of pages4
    DOIs
    Publication statusPublished - 23 Aug 2004
    Event17th IEEE International Conference on Pattern Recognition 2004 - Cambridge, United Kingdom
    Duration: 23 Aug 200426 Aug 2004
    Conference number: 17

    Conference

    Conference17th IEEE International Conference on Pattern Recognition 2004
    Abbreviated titleICPR 2004
    CountryUnited Kingdom
    CityCambridge
    Period23/08/0426/08/04

    Keywords

    • HMI-IE: Information Engineering
    • memory consumption
    • distance maps/transforms
    • Fast Exact Euclidean Distance (FEED)
    • IR-79286
    • Euclidean distance
    • Computational Complexity
    • EWI-21120

    Cite this