首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于多级队列的并行区域生长算法
引用本文:陆克中,彭蓉,林晓辉. 一种基于多级队列的并行区域生长算法[J]. 计算机应用, 2008, 28(2): 446-447,
作者姓名:陆克中  彭蓉  林晓辉
作者单位:深圳大学,超级计算中心,深圳,518060;深圳大学,信息工程学院,深圳,518060
基金项目:国家自然科学基金 , 广东省科技厅科技计划
摘    要:区域生长是经典的图像分割方法之一,为了满足图像分割的实时性要求,提出了一种基于多级队列的并行区域生长算法。该算法采用多级队列存放待生长的种子像素,优先生长边界种子像素,以尽快生成越界种子节点,从而减少邻居节点的等待时间。实验表明,该算法相比一般的基于单队列的算法,加速比有显著提高,且可扩展性较好。

关 键 词:区域生长  并行算法  多级队列
文章编号:1001-9081(2008)02-0446-02
收稿时间:2007-09-06
修稿时间:2007-11-14

Parallel algorithm of region growing based on multi-level queue
LU Ke-zhong,PENG Rong,LIN Xiao-hui. Parallel algorithm of region growing based on multi-level queue[J]. Journal of Computer Applications, 2008, 28(2): 446-447,
Authors:LU Ke-zhong  PENG Rong  LIN Xiao-hui
Affiliation:LU Ke-zhong1,PENG Rong2,LIN Xiao-hui2(1.Supercomputing Center,Shenzhen University,Shenzhen Guangdong 518060,China,2.College of Information Engineering,China)
Abstract:Region growing is one of classical image segmentation methods. In order to satisfy the real-time request of image segmentation, a parallel algorithm of region growing based on multi-level queue was proposed. The algorithm adopted multi-level queue to deposit seed pixels for growing. Boundary seed pixels were grown preferentially, so as the seed pixels beyond boundary were generated early. Therefore, waiting time of neighbors was reduced. Experiments show that compared with general algorithm based on single queue, speed-up ratio of the algorithm can be promoted significantly and its sealability is better.
Keywords:region growing   parallel algorithm   multi-level queue
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号