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 (RowCol Unify) is based upon the directional propagation labeling, whereas the second algorithm uses the Label Equivalence technique. The RowCol 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 etal. (2010) [3]. At the end the comparison depending on the performances of both of the algorithms is presented.
connected component component labeling cuda gpu parallel mesh