2422

Connected component labeling on a 2D grid using CUDA

Oleksandr Kalentev, Abha Rai, Stefan Kemnitz, Ralf Schneider
Max-Planck-Institut fur Plasmaphysik, Wendelsteinstr. 1, D-17491 Greifswald, Germany
Journal of Parallel and Distributed Computing (26 October 2010)

@article{kalentev2010connected,

   title={Connected component labeling on a 2D grid using CUDA},

   author={Kalentev, O. and Rai, A. and Kemnitz, S. and Schneider, R.},

   journal={Journal of Parallel and Distributed Computing},

   issn={0743-7315},

   year={2010},

   publisher={Elsevier}

}

Download Download (PDF)   View View   Source Source   

1407

views

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. 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
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: