Parallel connected-component labeling algorithm for GPGPU applications

This paper proposes a new connected component labeling algorithm for GPGPU applications based on NVIDIA's CUDA. Various approaches and algorithms for connected component labeling with minimal execution time were designed, but the most of them have been focused on optimizing CPU algorithm. There...

Full description

Saved in:
Bibliographic Details
Published in2010 10th International Symposium on Communications and Information Technologies pp. 1149 - 1153
Main Authors In-Yong Jung, Chang-Sung Jeong
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2010
Subjects
Algorithm design and analysis
Arrays
Classification algorithms
Instruction sets
Labeling
Noise
Pixel
Online AccessGet full text

Cover

More Information
Summary:This paper proposes a new connected component labeling algorithm for GPGPU applications based on NVIDIA's CUDA. Various approaches and algorithms for connected component labeling with minimal execution time were designed, but the most of them have been focused on optimizing CPU algorithm. Therefore it is hard to apply these approaches to GPGPU programming models such as NVIDIA's CUDA. Today, GPGPU (General Purpose Graphic Processing Unit) technologies offer dedicated parallel hardware and programming model, and many applications are being moved onto the GPGPU. This algorithm is a multi-pass algorithm to utilize for GPGPU applications, and evaluation results show that maximum speedup is more than double compared with conventional CPU algorithms.
ISBN:1424470072
9781424470075
DOI:10.1109/ISCIT.2010.5665161