A New Parallel Algorithm for Two-Pass Connected Component Labeling
Siddharth Gupta, Diana Palsetia, Md. Mostofa Ali Patwary, Ankit, Agrawal, Alok Choudhary

TL;DR
This paper introduces PAREMSP, a scalable parallel two-pass connected component labeling algorithm that efficiently utilizes multi-core architectures, achieving significant speedups and linear scaling for large images without hardware-specific routines.
Contribution
The paper presents a novel parallel two-pass CCL algorithm, PAREMSP, employing REMSP for label equivalence, demonstrating high scalability and portability on shared memory systems.
Findings
Achieves speedups up to 20.1 with 24 cores.
Demonstrates linear scaling with increasing cores.
Does not rely on hardware-specific routines.
Abstract
Connected Component Labeling (CCL) is an important step in pattern recognition and image processing. It assigns labels to the pixels such that adjacent pixels sharing the same features are assigned the same label. Typically, CCL requires several passes over the data. We focus on two-pass technique where each pixel is given a provisional label in the first pass whereas an actual label is assigned in the second pass. We present a scalable parallel two-pass CCL algorithm, called PAREMSP, which employs a scan strategy and the best union-find technique called REMSP, which uses REM's algorithm for storing label equivalence information of pixels in a 2-D image. In the first pass, we divide the image among threads and each thread runs the scan phase along with REMSP simultaneously. In the second phase, we assign the final labels to the pixels. As REMSP is easily parallelizable, we use the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
