Research note: Connected component labeling on a 2D grid using CUDA

  • Authors:

  • Oleksandr Kalentev;Abha Rai;Stefan Kemnitz;Ralf Schneider

  • Affiliations:

  • Max-Planck-Institut für Plasmaphysik, Wendelsteinstr. 1, D-17491 Greifswald, Germany;Max-Planck-Institut für Plasmaphysik, Wendelsteinstr. 1, D-17491 Greifswald, Germany;Fachhochschule Stralsund-University of Applied Sciences, Zur Schwedenschanze 15, D-18435 Stralsund, Germany;Ernst-Moritz-Arndt-Universität, Domstr. 11, D-17487 Greifswald, Germany

  • Venue:
  • Journal of Parallel and Distributed Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 the Label Equivalence technique. The Row-Col Unify algorithm uses a local array of references and the reduction technique intrinsically. The usage of shared memory extensively makes the code efficient. The Label Equivalence algorithm is an extended version of the one presented by Hawick et al. (2010) [3]. At the end the comparison depending on the performances of both of the algorithms is presented.