Mean Shift图像分割算法的并行化  

Parallelization of Mean Shift image segmentation algorithm

作　　者：李宏益[1] 吴素萍[1] 

机构地区：[1]宁夏大学数学计算机学院,银川750021

出　　处：《中国图象图形学报》2013年第12期1610-1619,共10页Journal of Image and Graphics

基　　金：国家自然科学基金项目(60963004);国家星火计划项目(2011GA880001)

摘　　要：图像分割作为高性能并行计算的一个主要应用领域,其算法本身的时间复杂度和实时性需求要求不断改进计算机硬件技术和并行处理的算法。Mean Shift算法是图像分割领域一个比较经典的算法,在图像分割过程中,不需要任何先验知识,是一种无监督的分割过程,在图像分割的具体实现中应用广泛。利用TBB(threading building block)工具和CUDA(compute unified device architecture)对Mean Shift算法进行多核和GPU(graphic processing unit)并行化改造。首先分析Mean Shift分割过程中最耗时的部分Mean Shift聚类,然后利用TBB和CUDA对Mean Shift聚类进行了并行化改造,并对两种并行方法进行了对比分析。实验结果表明,两种并行方法都取得了较好的加速效果,加速比都随着图像增大和带宽参数的增加而增大,基于TBB的加速比稳定趋于核数。Image segmentation is a main field of application in parallel computing.To achieve the high performance needed,the algorithm needs to make use of the improved computer hardware and parallel computing algorithms. Mean Shift algorithm is a relative classic algorithm in image segmentation field,which needs no prior knowledge and is an unsupervised segmentation process,attracting widespread attention for its good applicability. In this paper, we give two parallel improvement methods of Mean Shift using TBB（threading building block）and CUDA（compute unified device architecture）based on Multi-core and GPU（graphic processing unit） processing. First, the most time-consuming part the Mean Shift iteration in the process of Mean Shift image segmentation, is analyzed,then two parallel improvement methods of the Mean Shift iteration using TBB and CUDA are given, Two parallel methods are compared and analyzed. The experimental results show that,two kinds of parallel methods have achieved preferable acceleration effect,with the increase of the image and bandwidth parameter the speedup of two parallel methods is on the increases,and the speedup based on TBB tends to be equal to the number of CPUs.

关 键 词：Mean SHIFT 并行计算 TBB CUDA 图像分割 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]