基于多项式一致逼近的多阈值图像分割算法  

Multi-threshold algorithm about image segmentation based on polynomial uniform approximation

作　　者：卫颜俊[1] 冯博琴[1] 伍卫国[2] 

机构地区：[1]西安交通大学计算机教学实验中心,陕西西安710049 [2]西安交通大学计算机系,陕西西安710049

出　　处：《通信学报》2016年第10期56-64,共9页Journal on Communications

基　　金：国家自然科学基金资助项目(No.91330117);国家高技术研究发展计划("863"计划)基金资助项目(No.2012AA01A306)~~

摘　　要：针对传统多阈值图像分割算法的计算复杂性,以及由图像直方图中毛刺的干扰带来的算法不稳定等缺点,提出一种基于伯恩斯坦多项式一致逼近的多阈值图像分割算法。首先根据逼近论中的威尔斯托拉斯定理构造图像直方图曲线的伯恩斯坦多项式,然后将图像直方图的峰谷值计算问题化简为伯恩斯坦多项式的极值问题,该极值问题可由伯恩斯坦多项式函数的一次、二次微分导出,最后依据这些极值和极性应用分类算法自动标注图像直方图的实际峰谷值,由此完成基于多阈值的图像分割。实验结果表明所提算法不受直方图中毛刺的干扰,算法整体稳定,冗余计算少,时间复杂度小,用时少,效率高,逼近性能和分割效果更好。Aiming at those shortcomings of previous multi-threshold image segmentation algorithm such as large complexity and instability caused by the image histogram glitch interference, a new multi-threshold image segmentation algo-rithm was proposed using Bernstein polynomial to uniformly approximate histogram curve. First, according to the approximation theory of Weierstrass to construct Bernstein polynomial for the histogram curve, then more difficult peak value calculating of the histogram was reduced to the Bernstein polynomial extremal generating, that was exported easily by the first and second derivative of Bernstein polynomial function, and finally obtain the actual peak value of the image histogram by picking up these extremes and polar values and filtering through classification algorithm, and finish multi-threshold image segmentation. Experimental results show that the algorithm is insensitive for histogram glitch interference, the overall is stable, the redundant computation and time complexity are smaller, with less time and high efficiency, the approximate performance and segmentation effect are better.

关 键 词：图像分割 图像直方图 阈值 一致逼近 伯恩斯坦多项式 距离空间 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]