.png){kind=icon}
.png){kind=icon}
Return
A Work Efficient Parallel Algorithm for Exact Euclidean Distance Transform
.png){kind=icon}
OA
AI
DOI：10.1109/TIP.2019.2916741.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A fully-parallelized work-time optimal algorithm is presented for computing the exact Euclidean Distance Transform (EDT) of a 2D binary image with the size of n x n. Unlike existing PRAM (Parallel Random Access Machine) and other algorithms, this algorithm is suitable for implementation on modern SIMD (Single Instruction Multiple Data) architectures such as CPUs. As a fundamental operation of 2D EDT, ID EDT is efficiently parallelized first. Specifically, the GPU algorithm for the ID EDT, which uses CUDA (Compute Unified Device Architecture) binary functions, such as ballot(), ffs(), dz(), and shfl(), runs in O(log(32)n) time and performs O(n) work. Using the 1D EDT as a fundamental operation, the fully-parallelized work-time optimal 2D EDT algorithm is designed. This algorithm consists of three steps. Step 1 of the algorithm runs in O(log(32)n) time and performs O(N) (N=n(2)) of total work on GPU. Step 2 performs O(N) of total work and has an expected time complexity of O(logn) on GPU. Step 3 runs in O(log(32)n) time and performs O(N) of total work on CPU. As far as we know, this algorithm is the first fully-parallelized and realized work-time optimal algorithm for CPUs. The experimental results show that this algorithm outperforms the prior state-of-the-art CPU algorithms.
Keywords:
Work-time optimal parallel algorithm
SIMD architecture
1D EDT
2D EDT
binary operations on GPU
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W