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

08/28/2017
by   Jun Chen, et al.
0

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.

READ FULL TEXT

page 2

page 3

page 4

research
12/28/2017

Efficient Parallel Connected Components Labeling with a Coarse-to-fine Strategy

This paper proposes a new parallel approach to solve connected component...
research
06/20/2016

A New Parallel Algorithm for Two-Pass Connected Component Labeling

Connected Component Labeling (CCL) is an important step in pattern recog...
research
01/25/2023

Fast Merge Tree Computation via SYCL

A merge tree is a topological descriptor of a real-valued function. Merg...
research
12/10/2020

Building Graphs at a Large Scale: Union Find Shuffle

Large scale graph processing using distributed computing frameworks is b...
research
12/14/2018

Simple Concurrent Labeling Algorithms for Connected Components

We present new concurrent labeling algorithms for finding connected comp...
research
06/16/2020

A New Run-based Connected Component Labeling for Efficiently Analyzing and Processing Holes

This article introduces a new connected component labeling and analysis ...
research
03/28/2018

Boundary Labeling for Rectangular Diagrams

Given a set of n points (sites) inside a rectangle R and n points (label...

Please sign up or login with your details

Forgot password? Click here to reset