Timed Fast Exact Euclidean Distance (tFEED) maps


Share/Save/Bookmark

Schouten, Theo E. and Kuppens, Harco and Broek van den, Egon L. (2005) Timed Fast Exact Euclidean Distance (tFEED) maps. In: Real-Time Imaging IX, 18-20 January 2005, San Jose, CA, USA.

[img]PDF
Restricted to UT campus only
: Request a copy
570Kb
Abstract:In image and video analysis, distance maps are frequently used. They provide the (Euclidean) distance (ED) of background pixels to the nearest object pixel. In a naive implementation, each object pixel feeds its (exact) ED to each background pixel; then the minimum of these values denotes the ED to the closest object. Recently, the Fast Exact Euclidean Distance (FEED) transformation was launched, which was up to 2x faster than the fastest algorithms available. In this paper, first additional improvements to the original FEED algorithm are discussed. Next, a timed version of FEED (tFEED) is presented, which generates distance maps for video sequences by merging partial maps. For each object in a video, a partial map can be calculated for different frames, where the partial map for fixed objects is only calculated once. In a newly developed, dynamic test-environment for robot navigation purposes, tFEED proved to be up to 7x faster than using FEED on each frame separately. It is up to 4x faster than the fastest ED algorithm available for video sequences and even 40% faster than generating city-block or chamfer distance maps for frames. Hence, tFEED is the first real time algorithm for generating exact ED maps of video sequences.
Item Type:Conference or Workshop Item
Copyright:© 2005 SPIE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/79212
Official URL:http://dx.doi.org/10.1117/12.587784
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page