Abstract
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 language | English |
|---|---|
| Title of host publication | ASCI 2006 : Proceedings of the 12th Annual Conference of the Advanced School for Computing and Imaging, Lommel, Belgium, June 14-16, 2006 |
| Editors | B.P.F. Lelieveldt, B. Haverkort, C.T.A.M. Laat, de, J.W.J. Heijnsdijk |
| Place of Publication | Delft |
| Publisher | Advanced School for Computing and Imaging (ASCI) |
| Pages | 377-384 |
| ISBN (Print) | 978-90-810849-1-8 |
| Publication status | Published - 2006 |
| Event | 12th Annual Conference for the Advanced School for Computing and Imaging (ASCI 2006) , June 14-16, 2006, Lommel, Belgium - Lommel, Belgium Duration: 14 Jun 2006 → 16 Jun 2006 |
Conference
| Conference | 12th Annual Conference for the Advanced School for Computing and Imaging (ASCI 2006) , June 14-16, 2006, Lommel, Belgium |
|---|---|
| Abbreviated title | ASCI 2006 |
| Country | Belgium |
| City | Lommel |
| Period | 14/06/06 → 16/06/06 |