arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.05973cs.DScs.CVcs.PF
收藏

一种新的两遍连通域标记并行算法

A New Parallel Algorithm for Two-Pass Connected Component Labeling

Northwestern University(西北大学)

Siddharth Gupta, Diana Palsetia, Md. Mostofa Ali Patwary, Ankit Agrawal, Alok Choudhary

摘要:

连通域标记(CCL)是模式识别和图像处理中的一个重要步骤。它为像素分配标签,使得共享相同特征的相邻像素被分配相同的标签。通常情况下,CCL需要对数据进行多次处理。我们专注于两遍技术,其中每个像素在第一遍中被赋予临时标签,而在第二遍中被分配实际标签。我们提出了一个可扩展的并行两遍CCL算法,称为PAREMSP,它采用了扫描策略和最佳的union-find技术称为REMSP,它使用REM的算法存储标签等价信息的像素在2-D图像。在第一遍中,我们将图像划分为多个线程,每个线程与REMSP同时运行扫描阶段。在第二阶段,我们将最终标签分配给像素。由于REMSP易于并行化,我们使用并行版本的REMSP合并边界上的像素。我们的实验表明,PAREMSP的可扩展性,实现加速到$20.1$使用$24$核心共享内存架构上使用的大小为$465.20$ MB的图像的OpenMP。我们发现,我们提出的并行算法实现了线性缩放为一个大的分辨率固定的问题大小的处理元素的数量增加。此外,并行算法不使用任何硬件特定的例程,因此是高度可移植的。

英文摘要:

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 parallel version of REMSP for merging the pixels on the boundary. Our experiments show the scalability of PAREMSP achieving speedups up to $20.1$ using $24$ cores on shared memory architecture using OpenMP for an image of size $465.20$ MB. We find that our proposed parallel algorithm achieves linear scaling for a large resolution fixed problem size as the number of processing elements are increased. Additionally, the parallel algorithm does not make use of any hardware specific routines, and thus is highly portable.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑