欢迎访问《图学学报》 分享到:

图学学报

• 视觉与图像 • 上一篇    下一篇

基于多代表点近邻传播的大数据图像分割算法

  

  • 出版日期:2016-02-26 发布日期:2016-02-26

Big Data Image Segmentation Based on Multi-exemplar Affinity Propagation

  • Online:2016-02-26 Published:2016-02-26

摘要: 基于多代表点近邻传播聚类算法,提出一种有效的大数据图像的快速分割算法。
该算法首先运用均值漂移算法将彩色图像分割成很多小的同质区域,然后计算每个区域中所有
像素的颜色向量平均值,并用区域数目代替原图像像素点数目,选用区域间的距离作为相似度
的测度指标,最后应用多代表点近邻传播聚类算法在区域相似度矩阵上进行二次聚类,得到最
终的图像分割结果。实验结果证明,提出的算法在大数据图像的分割中取得了较为满意的分割
效果,且分割效率较高。

关键词: 多代表点近邻传播, 大数据, 图像分割

Abstract: Based on multi-exemplar affinity propagation clustering, a fast segmentation algorithm is
proposed for big data images. The proposed algorithm preprocesses an input big data image by mean
shift algorithm to form segmented regions that preserve the desirable discontinuity characteristics of
images. The numbers of segmented regions, instead of the numbers of image pixels, are considered as
the input data scale of multi-exemplar affinity propagation clustering algorithm. The average of the
color vectors in each region is calculated and considered as an input data point of multi-exemplar
affinity propagation clustering algorithm. Euclidean distances between regions are regards as
similarity measure index, and then the multi-exemplar affinity propagation clustering algorithm is
applied to perform globally optimized clustering and segmentation based on similarity matrix.
Experimental results illustrate that the proposed algorithm has superior performance and less
computational costs compared for big data image segmentation.

Key words: multi-exemplar affinity propagation, big data, image segmentation