The Fast Exact Euclidean Distance (FEED) transform is generalized to support intensity values and gray-scale images. The generalized FEED (gFEED) class algorithms support both Euclidean and squared Euclidean distances. The algorithms are tested on datasets by Schouten and van den Broek and on newly developed datasets. Tests show a O(m*n) time complexity on squared Euclidean distances and a O(m * n)(m+ n) time complexity on Euclidean distances
In this paper, we propose an efficient algorithm, i.e., PBEDT, for short, to compute the exact Eucli...
A new generic scheme for incremental implementations of distance transforms (DT) is presented: Incre...
Determining, or selecting a distance measure over the input feature space is a fundamental problem i...
A new unique class of foldable distance transforms of digital images (DT) is introduced, baptized: F...
The Fast Exact Euclidean Distance transform (FEED) algorithm is extended beyond two dimensions. 3D-F...
Fast Exact Euclidean Distance (FEED) transformation is introduced, starting from the inverse of the ...
A new general algorithm for computing distance transforms of digital images is presented. The algori...
A new general algorithm fur computing distance transforms of digital images is presented. The algori...
In image and video analysis, distance maps are frequently used. They provide the (Euclidean) distanc...
In image and video analysis, distance maps are frequently used. They provide the (Euclidean) distanc...
A distance transformation (DT) takes a binary image as input and generates a distance map image in w...
Abstract—A sequential algorithm is presented for computing the exact Euclidean distance transform (D...
The Euclidean distance transform of a binary image is the function that assigns to every pixel the E...
A distance transformation (DT) takes a binary image as input and generates a distance map image in w...
This paper provides linear-time algorithms for solving a class of minimization problems involving a...
In this paper, we propose an efficient algorithm, i.e., PBEDT, for short, to compute the exact Eucli...
A new generic scheme for incremental implementations of distance transforms (DT) is presented: Incre...
Determining, or selecting a distance measure over the input feature space is a fundamental problem i...
A new unique class of foldable distance transforms of digital images (DT) is introduced, baptized: F...
The Fast Exact Euclidean Distance transform (FEED) algorithm is extended beyond two dimensions. 3D-F...
Fast Exact Euclidean Distance (FEED) transformation is introduced, starting from the inverse of the ...
A new general algorithm for computing distance transforms of digital images is presented. The algori...
A new general algorithm fur computing distance transforms of digital images is presented. The algori...
In image and video analysis, distance maps are frequently used. They provide the (Euclidean) distanc...
In image and video analysis, distance maps are frequently used. They provide the (Euclidean) distanc...
A distance transformation (DT) takes a binary image as input and generates a distance map image in w...
Abstract—A sequential algorithm is presented for computing the exact Euclidean distance transform (D...
The Euclidean distance transform of a binary image is the function that assigns to every pixel the E...
A distance transformation (DT) takes a binary image as input and generates a distance map image in w...
This paper provides linear-time algorithms for solving a class of minimization problems involving a...
In this paper, we propose an efficient algorithm, i.e., PBEDT, for short, to compute the exact Eucli...
A new generic scheme for incremental implementations of distance transforms (DT) is presented: Incre...
Determining, or selecting a distance measure over the input feature space is a fundamental problem i...