The distance transform (DT) is a general operator forming the basis of many methods in computer vision and geometry, with great potential for practical applications. However, all the optimal algorithms for the computation of the exact Euclidean DT (EDT) were proposed only since the 1990s. In this work, state-of-the-art sequential 2D EDT algorithms are reviewed and compared, in an effort to reach more solid conclusions regarding their differences in speed and their exactness. Six of the best algorithms were fully implemented and compared in practice.CNPq (200875/2004-3, 303746/04-1, 308231/03-1)FAPESP (03/09834-0, 99/12765-2, 05/00587-5
A new general algorithm for computing distance transforms of digital images is presented. The algori...
In this paper, we propose an efficient algorithm, i.e., PBEDT, for short, to compute the exact Eucli...
Abstract: A distance transform, also known as distance map or distance field, is a representation of...
The Distance Transform (DT) is a general operator forming the basis of many methods in computer visi...
International audienceIn image processing, the distancetransform (DT), in which each object grid poi...
The Euclidean distance transform (EDT) is used in various methods in pattern recognition, computer v...
A fully-parallelized work-time optimal algorithm is presented for computing the exact Euclidean Dist...
The distance calculation in an image is a basic operation in computer vision, pattern recognition, a...
A new general algorithm fur computing distance transforms of digital images is presented. The algori...
A new generic scheme for incremental implementations of distance transforms (DT) is presented: Incre...
The Fast Exact Euclidean Distance transform (FEED) algorithm is extended beyond two dimensions. 3D-F...
A new unique class of foldable distance transforms of digital images (DT) is introduced, baptized: F...
In image and video analysis, distance transformations (DT) are frequently used. They provide a dista...
We compare the most frequently used algorithms for computing distance transforms in terms of speed, ...
AbstractIn image processing, the distance transform (DT), in which each object grid point is assigne...
A new general algorithm for computing distance transforms of digital images is presented. The algori...
In this paper, we propose an efficient algorithm, i.e., PBEDT, for short, to compute the exact Eucli...
Abstract: A distance transform, also known as distance map or distance field, is a representation of...
The Distance Transform (DT) is a general operator forming the basis of many methods in computer visi...
International audienceIn image processing, the distancetransform (DT), in which each object grid poi...
The Euclidean distance transform (EDT) is used in various methods in pattern recognition, computer v...
A fully-parallelized work-time optimal algorithm is presented for computing the exact Euclidean Dist...
The distance calculation in an image is a basic operation in computer vision, pattern recognition, a...
A new general algorithm fur computing distance transforms of digital images is presented. The algori...
A new generic scheme for incremental implementations of distance transforms (DT) is presented: Incre...
The Fast Exact Euclidean Distance transform (FEED) algorithm is extended beyond two dimensions. 3D-F...
A new unique class of foldable distance transforms of digital images (DT) is introduced, baptized: F...
In image and video analysis, distance transformations (DT) are frequently used. They provide a dista...
We compare the most frequently used algorithms for computing distance transforms in terms of speed, ...
AbstractIn image processing, the distance transform (DT), in which each object grid point is assigne...
A new general algorithm for computing distance transforms of digital images is presented. The algori...
In this paper, we propose an efficient algorithm, i.e., PBEDT, for short, to compute the exact Eucli...
Abstract: A distance transform, also known as distance map or distance field, is a representation of...