Tolerance-based feature transforms

D. Reniers, A.C. Telea

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

14 Citations (Scopus)
3 Downloads (Pure)


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.
Original languageEnglish
Title of host publicationAdvances in Computer Graphics and Computer Vision (International Conferences VISAPP and GRAPP 2006, Setúbal, Portugal, February 25-28, 2006, Revised Selected Papers)
EditorsJ. Braz, A. Ranchordas, H. Araújo, J. Jorge
ISBN (Print)978-3-540-75272-1
Publication statusPublished - 2008

Publication series

NameCommunications in Computer and Information Science
ISSN (Print)1865-0929

Fingerprint Dive into the research topics of 'Tolerance-based feature transforms'. Together they form a unique fingerprint.

Cite this