Tolerance-Based Feature Transforms

Tolerance-based feature transforms (TFTs) assign to each pixel in an image not only the nearest feature pixels on the boundary (origins), but all origins from the minimum distance up to a user-defined tolerance. In this paper, we compare four simple-to-implement methods for computing TFTs on binary images. Of these methods, the Fast Marching TFT and Euclidean TFT are new. The other two extend existing distance transform algorithms. We quantitatively and qualitatively compare all algorithms on speed and accuracy of both distance and origin results. Our analysis is aimed at helping practitioners in the field to choose the right method for given accuracy and performance constraints.

[1]  Wim H. Hesselink,et al.  A General Algorithm for Computing Distance Transforms in Linear Time , 2000, ISMM.

[2]  Ingemar Ragnemalm.  Neighborhoods for distance transformations using ordered propagation , 1992, CVGIP Image Underst..

[3]  Alexandru Telea,et al.  An Augmented Fast Marching Method for Computing Skeletons and Centerlines , 2002, VisSym.

[4]  Alexandre X. Falcão,et al.  Fast Euclidean distance transform using a graph-search algorithm , 2000, Proceedings 13th Brazilian Symposium on Computer Graphics and Image Processing (Cat. No.PR00878).

[5]  Piet W. Verbeek,et al.  An Efficient Uniform Cost Algorithm Applied to Distance Transforms , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  David R. Musser,et al.  STL tutorial and reference guide - C++ programming with the standard template library , 1996, Addison-Wesley professional computing series.

[7]  James C. Mullikin,et al.  The vector distance transform in two and three dimensions , 1992, CVGIP Graph. Model. Image Process..

[8]  Q. Ye.  The signed Euclidean distance transform and its applications , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[9]  O. Cuisenaire.  Distance transformations: fast algorithms and applications to medical image processing , 1999 .

[10]  Marko Subasic,et al.  Level Set Methods and Fast Marching Methods , 2003 .

[11]  Dinesh Manocha,et al.  Efficient computation of a simplified medial axis , 2003, SM '03.

[12]  Alexandru Telea,et al.  A Robust Level-Set Algorithm for Centerline Extraction , 2003, VisSym.

[13]  Olaf Kübler,et al.  Hierarchic Voronoi skeletons , 1995, Pattern Recognit..

[14]  Luciano da Fontoura Costa,et al.  Shape Analysis and Classification: Theory and Practice , 2000 .

[15]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods , 1999 .

[16]  P. Danielsson.  Euclidean distance mapping , 1980 .

[17]  Robert Strzodka,et al.  Generalized distance transforms and skeletons in graphics hardware , 2004, VISSYM'04.