.png){kind=icon}
.png){kind=icon}
Return
Implementation and comparison of binary thinning algorithms on GPU
.png){kind=icon}
PRE
AI
DOI：10.1007/s00607-018-0653-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Thinning algorithms have been widely applied in many applications such as computer graphics, computer vision and medical imaging. The performances of thinning algorithms are hampered by the increase of image's size and image's content. By employing graphics processing units (GPUs), the calculation of thinning algorithms can be accelerated. In this paper, we present GPU parallel versions of well-known binary thinning algorithms namely the ZS algorithm, the GH algorithm, the AW algorithm and the hybrid algorithm belonging to different classes for an efficient implementation using CUDA as a parallel programming model. These thinning algorithms are then evaluated and compared according to quality and runtime measures. The obtained results show that the GPU multithreaded implementations of the selected algorithms present high computational speed outperforming the central processing unit sequential implementations achieving the best average speedup when executing the AW algorithm.
Keywords:
Thinning algorithm
Binary image
Performance evaluation
CUDA
GPU
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
2.8
Papers:
2.3K
Citations:
3.5K