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 language | Undefined |
---|---|
Pages | 594-597 |
Number of pages | 4 |
DOIs | |
Publication status | Published - 23 Aug 2004 |
Event | 17th IEEE International Conference on Pattern Recognition 2004 - Cambridge, United Kingdom Duration: 23 Aug 2004 → 26 Aug 2004 Conference number: 17 |
Conference
Conference | 17th IEEE International Conference on Pattern Recognition 2004 |
---|---|
Abbreviated title | ICPR 2004 |
Country/Territory | United Kingdom |
City | Cambridge |
Period | 23/08/04 → 26/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