数字油画制作中的加速k均值颜色聚类算法

The Accelerated k-Means Algorithm Based on the Triangle Inequality for Clustering Color Images

提出了一个数字油画制作中的加速k均值图像颜色聚类算法:AkMTI-CCI算法.该算法应用最远优先原则初始化聚类中心,消除了颜色聚类结果对初始中心的依赖性.利用三角不等式减少聚类过程中距离的计算量,提高了颜色聚类的速度.数值实验表明:AkMTI-CCI算法提高了颜色聚类的速度且改善了颜色聚类的效果.

An accelerated k-Means algorithm for image color clustering in auto-generating digital oil painting,called AkMTI-CCI,is proposed.Centers are initialized according to the＂furthest first＂heuristic,so the last clustering result is the only one.And for the triangle inequalities are used to increase the number of distance computing,the clustering speed is higher.The experiments also show that AkMTI-CCI speeds the image color clustering,and make the effect with clustering better.