Sciweavers

Share
SI3D
2010
ACM

Parallel Banding Algorithm to compute exact distance transform with the GPU

9 years 3 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 image into small bands to process and then merging them concurrently, PBA computes the exact EDT with optimal linear total work, high level of parallelism and a good memory access pattern. This work is the first attempt to exploit the enormous power of the GPU in computing the exact EDT, while prior works are only on approximation. Compared to these other algorithms in our experiments, our exact algorithm is still a few times faster in 2D and 3D for most input sizes. We illustrate the use of our algorithm in applications such as computing the Euclidean skeleton using the integer medial axis transform, performing morphological operations of 3D volumetric data, and constructing 2D weighted centroidal Voronoi diagrams. CR Categories: I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Geometr...
Thanh-Tung Cao, Ke Tang, Anis Mohamed, Tiow Seng T
Added 17 May 2010
Updated 17 May 2010
Type Conference
Year 2010
Where SI3D
Authors Thanh-Tung Cao, Ke Tang, Anis Mohamed, Tiow Seng Tan
Comments (0)
books