A Streaming Distance Transform Algorithm for Neighborhood-Sequence Distances
Nicolas Normand, Robin Strand, Pierre Evenou, Aurore Arlicot
→ BibTeX
@article{ipol.2014.68,
    title   = {{A Streaming Distance Transform Algorithm for Neighborhood-Sequence Distances}},
    author  = {Normand, Nicolas and Strand, Robin and Evenou, Pierre and Arlicot, Aurore},
    journal = {{Image Processing On Line}},
    volume  = {4},
    pages   = {196--203},
    year    = {2014},
    doi     = {10.5201/ipol.2014.68},
}
% if your bibliography style doesn't support doi fields:
    note    = {\url{https://doi.org/10.5201/ipol.2014.68}}
published
2014-09-01
reference
Nicolas Normand, Robin Strand, Pierre Evenou, and Aurore Arlicot, A Streaming Distance Transform Algorithm for Neighborhood-Sequence Distances, Image Processing On Line, 4 (2014), pp. 196–203. https://doi.org/10.5201/ipol.2014.68

Communicated by Bertrand Kerautret
Demo edited by Bertrand Kerautret

Abstract

We describe an algorithm that computes a “translated” 2D Neighborhood-Sequence Distance Transform (DT) using a look up table approach. It requires a single raster scan of the input image and produces one line of output for every line of input. The neighborhood sequence is specified either by providing one period of some integer periodic sequence or by providing the rate of appearance of neighborhoods. The full algorithm optionally derives the regular (centered) DT from the “translated” DT, providing the result image on-the-fly, with a minimal delay, before the input image is fully processed. Its efficiency can benefit all applications that use neighborhood- sequence distances, particularly when pipelined processing architectures are involved, or when the size of objects in the source image is limited.

Download