International audienceIn this article, we propose a new definition of the E2DT (Squared Euclidean Distance Transformation) on irregular isothetic grids. We describe a new separable algorithm to compute this transformation on every grids, which is independent of the background representation. We show that our proposal is able to efficiently handle various kind of classical irregular two-dimensional grids in imagery, and that it can be easily extended to higher dimensions
The Fast Exact Euclidean Distance transform (FEED) algorithm is extended beyond two dimensions. 3D-F...
A new general algorithm for computing distance transforms of digital images is presented. The algori...
AbstractIn this paper, we examine five different three-dimensional grids suited for image processing...
International audienceIn this article, we propose a new definition of the E2DT (Squared Euclidean Di...
International audienceIn this article, we propose to investigate the extension ofthe E2DT (squared E...
International audienceIn this article, we propose to investigate two extensions of the E2DT (squared...
International audienceIn this article, we propose to adapt the concept of medialaxis (MA), largely s...
The k-distance transformation (k-DT) computes the k nearest patterns from each location on a discret...
In this paper we prove an equivalence relation between the distance transform of a binary image, whe...
In this paper we prove an equivalence relation between the distance transform of a binary image, whe...
Many spatial datasets and spatial problems can be described with reference to regular lattice framew...
The systems that perform the acquisition of two or three (2-D or 3-D) dimensional images usually pro...
The Distance Transform (DT) is a general operator forming the basis of many methods in computer visi...
The Earth Mover’s Distance (EMD) is a distance measure between distributions with applications in im...
We propose a new exact Euclidean distance transformation (DT) by propagation, using bucket sorting. ...
The Fast Exact Euclidean Distance transform (FEED) algorithm is extended beyond two dimensions. 3D-F...
A new general algorithm for computing distance transforms of digital images is presented. The algori...
AbstractIn this paper, we examine five different three-dimensional grids suited for image processing...
International audienceIn this article, we propose a new definition of the E2DT (Squared Euclidean Di...
International audienceIn this article, we propose to investigate the extension ofthe E2DT (squared E...
International audienceIn this article, we propose to investigate two extensions of the E2DT (squared...
International audienceIn this article, we propose to adapt the concept of medialaxis (MA), largely s...
The k-distance transformation (k-DT) computes the k nearest patterns from each location on a discret...
In this paper we prove an equivalence relation between the distance transform of a binary image, whe...
In this paper we prove an equivalence relation between the distance transform of a binary image, whe...
Many spatial datasets and spatial problems can be described with reference to regular lattice framew...
The systems that perform the acquisition of two or three (2-D or 3-D) dimensional images usually pro...
The Distance Transform (DT) is a general operator forming the basis of many methods in computer visi...
The Earth Mover’s Distance (EMD) is a distance measure between distributions with applications in im...
We propose a new exact Euclidean distance transformation (DT) by propagation, using bucket sorting. ...
The Fast Exact Euclidean Distance transform (FEED) algorithm is extended beyond two dimensions. 3D-F...
A new general algorithm for computing distance transforms of digital images is presented. The algori...
AbstractIn this paper, we examine five different three-dimensional grids suited for image processing...