Separable algorithms for distance transformations on irregular grids - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Pattern Recognition Letters Année : 2011

Separable algorithms for distance transformations on irregular grids

Résumé

In this article, we propose to investigate two extensions of the E2DT (squared Euclidean Distance Transformation) on irregular isothetic grids (or I-grids), such as quadtree/octree or run-length encoded d-dimensional images. We enumerate the advantages and drawbacks of the I-CDT, based on the cell centres, and the ones of the I-BDT, which uses the cell borders. One of the main problem we mention is that no efficient algorithm has been designed to compute both transforms in arbitrary dimensions. To tackle this problem, we describe in this paper two algorithms, separable in dimension, to compute these distance transformations in the two-dimensional case, and we show that they can be easily extended to higher dimensions.
Fichier non déposé

Dates et versions

hal-01354375 , version 1 (18-08-2016)

Identifiants

  • HAL Id : hal-01354375 , version 1

Citer

Antoine Vacavant, David Coeurjolly, Laure Tougne. Separable algorithms for distance transformations on irregular grids. Pattern Recognition Letters, 2011, 9, 32, pp.1356-1364. ⟨hal-01354375⟩
158 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More