An Optimized Union-Find Algorithm for Connected Components Labeling Using GPUs

In this paper, we report an optimized union-find (UF) algorithm that can label the connected components on a 2D image efficiently by employing the GPU architecture. The proposed method contains three phases: UF-based local merge, boundary analysis, and link. The coarse labeling in local merge reduce...

Full description

Saved in:
Bibliographic Details
Main Authors Chen, Jun, Yao, Qiang, Sabirin, Houari, Nonaka, Keisuke, Sankoh, Hiroshi, Naito, Sei
Format Journal Article
LanguageEnglish
Published 27.08.2017
Subjects
Computer Science - Computer Vision and Pattern Recognition
Online AccessGet full text

Cover

More Information
Summary:In this paper, we report an optimized union-find (UF) algorithm that can label the connected components on a 2D image efficiently by employing the GPU architecture. The proposed method contains three phases: UF-based local merge, boundary analysis, and link. The coarse labeling in local merge reduces the number atomic operations, while the boundary analysis only manages the pixels on the boundary of each block. Evaluation results showed that the proposed algorithm speed up the average running time by more than 1.3X.
DOI:10.48550/arxiv.1708.08180