Parallel Algorithm for Connected-Component Analysis Using CUDA
نویسندگان
چکیده
In this article, we introduce a parallel algorithm for connected-component analysis (CCA) on GPUs which drastically reduces the volume of data to transfer from GPU host. CCA algorithms targeting typically store extracted features in arrays large enough potentially hold maximum possible number objects given image size. Transferring these host requires portions overall execution time. Therefore, propose an uses CUDA kernel merge trees connected component feature structs. During tree merging, various properties, such as total area, centroid and bounding box, are accumulated. The structure then enables us only valid further processing or storing. Our benchmarks show that implementation significantly memory results whilst maintaining similar performance state-of-the-art algorithms.
منابع مشابه
A Hybrid Approach to Parallel Connected Component Labeling Using CUDA
Connected component labeling (CCL) is a mandatory step in image segmentation where each object in an image is identified and uniquely labeled. Sequential CCL is a time-consuming operation and thus is often implemented within parallel processing framework to reduce execution time. Several parallel CCL methods have been proposed in the literature. Among them are NSZ label equivalence (NSZLE) meth...
متن کاملConnected Component Labeling in CUDA
Connected component labeling (CCL) is a task of detecting connected regions in input data, and it finds its applications in pattern recognition, computer vision, and image processing. We present a new algorithm for connected component labeling in 2-D images implemented in CUDA. We first provide a brief overview of the CCL problem together with existing CPU-oriented algorithms. The rest of the c...
متن کاملFast Parallel Connected Component Labeling Algorithms Using Cuda Based on 8-directional Label Selection
Connected component labeling (CCL) is a key step in image segmentation where foreground pixels are extracted and labeled. Sequential CCL is a computationally expensive operation and thus is often done within parallel processing framework to reduce execution time. Various parallel CCL methods have been proposed in the literature. Among them NSZ label equivalence (NSZ-LE) method seemed to perform...
متن کاملConnected component labeling on a 2D grid using CUDA
Connected component labeling is an important but computationally expensive operation required in many fields of research. The goal in the present work is to label connected components on a 2D binary map. Two different iterative algorithms for doing this task are presented. The first algorithm (Row–Col Unify) is based upon the directional propagation labeling, whereas the second algorithm uses t...
متن کاملParallel Algorithm for Concurrent Computation of Connected Component Tree
The paper proposes a new parallel connected-component-tree construction algorithm based on line independent building and progressive merging of partial 1-D trees. Two parallelization strategies were developed: the parallelism maximization strategy, which balances the workload of the processes, and the communication minimization strategy, which minimizes communication among the processes. The ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2023
ISSN: ['1999-4893']
DOI: https://doi.org/10.3390/a16020080