Connected component labeling on a 2D grid using CUDA
Connected component labeling on a 2D grid using CUDA
复制标题
DOI：
10.1016/j.jpdc.2010.10.012
复制
发表时间：
2011-04-01
影响因子：
3.8
通讯作者：
Schneider, Ralf
中科院分区：
文献类型：
--
作者：
Kalentev, Oleksandr;Rai, Abha;Schneider, Ralf
连通域标记是许多研究领域中需要的一个重要但计算量大的操作。在目前的工作中的目标是在2D二进制地图上的连接组件的标签。两个不同的迭代算法来完成这项任务。第一种算法（行-列统一）是基于定向传播标记，而第二种算法使用标签等价技术。Row-Col Unify算法本质上使用了引用的局部数组和归约技术。共享内存的广泛使用使得代码高效。标签等效性算法是哈威克等人（2010）[3]提出的算法的扩展版本。最后根据两种算法的性能进行了比较。(C)2010年爱思唯尔公司All rights reserved.
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. (C) 2010 Elsevier Inc. All rights reserved.