高级检索
张淼, 陈爱军, 卢男凯, 沈小燕. 面向图像分割的卷积密度聚类算法[J]. 计算机辅助设计与图形学学报, 2022, 34(7): 1075-1084. DOI: 10.3724/SP.J.1089.2022.19117
引用本文: 张淼, 陈爱军, 卢男凯, 沈小燕. 面向图像分割的卷积密度聚类算法[J]. 计算机辅助设计与图形学学报, 2022, 34(7): 1075-1084. DOI: 10.3724/SP.J.1089.2022.19117
Zhang Miao, Chen Aijun, Lu Nankai, Shen Xiaoyan. Convolution Optimized Density Clustering Algorithm for Image Segmentation[J]. Journal of Computer-Aided Design & Computer Graphics, 2022, 34(7): 1075-1084. DOI: 10.3724/SP.J.1089.2022.19117
Citation: Zhang Miao, Chen Aijun, Lu Nankai, Shen Xiaoyan. Convolution Optimized Density Clustering Algorithm for Image Segmentation[J]. Journal of Computer-Aided Design & Computer Graphics, 2022, 34(7): 1075-1084. DOI: 10.3724/SP.J.1089.2022.19117

面向图像分割的卷积密度聚类算法

Convolution Optimized Density Clustering Algorithm for Image Segmentation

  • 摘要: 为了提升密度聚类算法在高分辨图像分割中的可用性,针对数字图像特点,提出一种基于三维卷积的高效密度聚类算法,并在此基础上实现一种彩色图像分割方法.首先,在DBSCAN算法的基础上引入卷积思想,将核心对象获取过程转化为三维卷积运算过程,避免距离计算和区域检索,使该步骤的时间复杂度从二阶降为常数级;然后,基于动态规划思想优化三维卷积运算过程,使卷积时间与卷积核尺寸无关;最后,根据核心对象集合的有序性精简样本点的邻域搜索范围.对比现有算法,在Berkeley BSD300数据集上的实验结果表明,所提算法是有效的,CH指数和计算效率平均提高17%和49%.利用遥感图像测试集Mts-WH进行实验的结果表明,所提算法的时间效率提升显著,比kD树优化的DBSCAN算法效率平均提升19倍,并且样本点数量越多,提升效果越明显,样本点数量超过50万级别时,提升效率达到169倍.

     

    Abstract: In order to improve the usability of DBSCAN in the field of high-resolution image segmentation,according to the characteristics of digital images,an efficient DBSCAN based on three-dimensional convo-lution is proposed,and on this basis,a color image segmentation method is implemented.First,convolution is introduced into DBSCAN,three-dimensional convolution is used to obtain the core object,avoiding dis-tance calculation and region retrieval,and reducing the time complexity of this step from the second order to a constant level.Then,the three-dimensional convolution is optimized based on dynamic programming,so that the convolution time is independent of the size of the convolution kernel.Finally,the neighborhood search range of the sample points is simplified according to the ordered core object set.Compared with the existing algorithms,the experimental results on the Berkeley BSD300 show that the algorithm is effective,the CH index and the time efficiency increase by 17%and 49%on average.The results of experiments using the remote sensing image set Mts-WH show that the computational efficiency of the algorithm is signifi-cantly improved.Compared with the DBSCAN optimized by the kD tree,the efficiency is increased by an average of 19 times,and the improvement effect is more obvious as the number of sample points increases.When the number of points exceeds 500000,the efficiency is increased by 169 times.

     

/

返回文章
返回