Sciweavers

241 search results - page 1 / 49
» Efficient Parallel Algorithms for Euclidean Distance Transfo...
Sort
View
CJ
2004
110views more  CJ 2004»
13 years 4 months ago
Efficient Parallel Algorithms for Euclidean Distance Transform
A parallel algorithm for Euclidean Distance Transform (EDT) on linear array with reconfigurable pipeline bus system (LARPBS) is presented. For an image with n
Ling Chen, Yi Pan, Yixin Chen, Xiao-hua Xu
IWCIA
2004
Springer
13 years 10 months ago
An Efficient Euclidean Distance Transform
Within image analysis the distance transform has many applications. The distance transform measures the distance of each object point from the nearest boundary. For ease of computa...
Donald G. Bailey
IPL
2007
104views more  IPL 2007»
13 years 4 months ago
A linear-time algorithm for Euclidean feature transform sets
The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the fun...
Wim H. Hesselink
SI3D
2010
ACM
13 years 11 months ago
Parallel Banding Algorithm to compute exact distance transform with the GPU
We propose a Parallel Banding Algorithm (PBA) on the GPU to compute the exact Euclidean Distance Transform (EDT) for a binary image in 2D and higher dimensions. Partitioning the i...
Thanh-Tung Cao, Ke Tang, Anis Mohamed, Tiow Seng T...
IPPS
1996
IEEE
13 years 9 months ago
The Chessboard Distance Transform and the Medial Axis Transform are Interchangeable
The distance transform (DT) and the medial axis transform (MAT) are two image computation tools used to extract the information about the shape and the position of the foreground ...
Yu-Hua Lee, Shi-Jinn Horng