Abstract
Many image processing problems benefit from a complete solution to connected components labeling. This paper introduces a new data parallel labeling method based on calculation of label propagation sizes from the connectivity between pixels extracted in a pre-processing step and re-usal of established label propagation routes. The method achieves real-time performance for 2D images and it also generalizes to Voronoi diagrams and signed distance fields.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hoshen, J., Kopelman, R.: Percolation and cluster distribution. I. Cluster multiple labeling technique and critical concentration algorithm. Phys. Rev. B 14, 3438–3445 (1976)
Samet, H.: Connected component labeling using quadtrees. Journal of the ACM (JACM) 28, 487–501 (1981)
Kiran, B., Ramakrishnan, K., Kumar, Y., Anoop, K.: An improved connected component labeling by recursive label propagation (2011)
Nvidia Corp.: CUDA C Programming Guide (2013), http://docs.nvidia.com/cuda/cuda-c-programming-guide/index.html
Khronos Group: OpenCL (2013), http://www.khronos.org/opencl/
Owens, J., Luebke, D., Govindaraju, N., Harris, M., Krüger, J., Lefohn, A., Purcell, T.J.: A survey of general-purpose computation on graphics hardware. Computer Graphics Forum 26, 80–113 (2007)
Hawick, K., Leist, A., Playne, D.: Parallel graph component labelling with GPUs and CUDA. Parallel Computing (2010)
Kalentev, O., Rai, A., Kemnitz, S., Schneider, R.: Connected component labeling on a 2D grid using CUDA. Journal of Parallel and Distributed Computing (2010)
Oliveira, V., Lotufo, R.: A Study on Connected Components Labeling algorithms using GPUs. Undergraduate Work (2010), http://parati.dca.fee.unicamp.br/adesso/wiki/ia870/ialabel_gpu/view/
O’Connell, S.: A GPU Implementation of Connected Component Labeling. Masters Thesis, White Paper (2009), http://sourceforge.net/projects/gccl/
Danielsson, P.: Euclidean distance mapping. Computer Graphics and Image Processing 14, 227–248 (1980)
Rong, G., Tan, T.: Jump flooding in GPU with applications to Voronoi diagram and distance transform. In: Proceedings of the 2006 Symposium on Interactive 3D Graphics and Games, pp. 109–116. ACM (2006)
The GIMP Team: Gnu image manipulation program - maze plugin. Open Source (2013), http://www.gimp.org/
Top Coder: Top coder connected components challenge. Dataset, Online (2010), http://community.topcoder.com/tc?module=Static&d1=pressroom&d2=pr_100109
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rasmusson, A., Sørensen, T.S., Ziegler, G. (2013). Connected Components Labeling on the GPU with Generalization to Voronoi Diagrams and Signed Distance Fields. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2013. Lecture Notes in Computer Science, vol 8033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41914-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-41914-0_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41913-3
Online ISBN: 978-3-642-41914-0
eBook Packages: Computer ScienceComputer Science (R0)