Close
Metadata

%0 Conference Proceedings
%4 sid.inpe.br/banon/2002/11.13.11.53
%2 sid.inpe.br/banon/2002/11.13.11.54
%A Lotufo, Roberto A.,
%A Falc„o, Alexandre A.,
%A Zampirolli, Francisco A.,
%T Fast Euclidean distance transform using a graph-search algorithm
%B Brazilian Symposium on Computer Graphics and Image Processing, 13 (SIBGRAPI)
%D 2000
%E Carvalho, Paulo Cezar Pinto,
%E Walter, Marcelo,
%8 October
%J Los Alamitos
%I IEEE Computer Society
%C Gramado, RS, Brazil
%K tree searching, Fast Euclidean distance transform, shortest path forest problem, shortest path graph-search, sequential algorithms, image processing.
%X Two new Euclidean distance transform algorithms are described. The algorithms are designed using a shortest path graph-search framework. The distance transform can be seen as the solution of a shortest path forest problem. Previous works have dealt with the Euclidean distance transform (EDT) and with the shortest path forest problem, but none of them have presented an EDT using the graph-search approach. The proposed algorithms are very simple and yet belong to the class of one of the most efficient sequential algorithms. The algorithms easily extend to higher dimensions.
%P 269-275
%O The conference was held in Gramado, RS, Brazil, from October 17 to 20.
%1 SBC - Brazilian Computer Society
%3 269-275.pdf


Close