Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1708.08180 v2 pith:Z64CMKBW submitted 2017-08-28 cs.CV

Jun Chen , Qiang Yao , Houari Sabirin , Keisuke Nonaka , Hiroshi Sankoh , Sei Naito This is my paper · ORCID
classification cs.CV
keywords algorithmboundaryanalysiscomponentsconnectedlabelinglocalmerge
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Pith tools