多类类间最大方差算法在图像分割中的应用  

Multi-classes Maximum Variance Method Applied in Image Segmentation

作　　者：李仪[1,2] 蔡自兴[1,2] 谷明琴[1,2] 

机构地区：[1]中南大学信息科学与工程学院,长沙410083 [2]先进控制与智能自动化湖南省工程实验室,长沙410083

出　　处：《小型微型计算机系统》2014年第5期1184-1187,共4页Journal of Chinese Computer Systems

基　　金：高速公路车辆智能驾驶中的关键科学问题研究(90820302);国家博士点基金项目(200805330005)资助;湖南省院士基金项目(2009FJ4030)资助

摘　　要：介绍了多类类间最大方差法的基本原理,从实际道路图像着手分析该算法存在的两个问题即分类数难以确定以及当分类数增加时其时间复杂度成指数上升.针对确定分类数问题,本文设计了一种直方图均值确定分类数法,其将确定分类数转换成了以图像直方图的概率密度函数的均值为限定条件来求其波峰个数;当分类数大于3类时使用无导数方法对多类类间最大方差法得到局部最优解.建立总量为7209幅图像的道路图像库,对道路图像做实验分析得到确定分类数算法的时间复杂度为O(L)且其平均耗时为0.717毫秒,对图像库抽样计算得到整个算法的平均耗时小于45毫秒.In this paper, the base principle of multi-classes maximum variance method is introduced, and two key problems are thrown from analyzing the method applied in reality road images. The one is how to confirm the number of classes, and the other is that the time complexity of method is exponential increased with growth of number of classes. To resolve the problem of numbers of classes, a mean value of histogram method is designed. The method converts the problem of confirming number of classes to counting number of peak of image histogram with mean value of probability density function as limiting condition. When the number of classes is more than 3, derivative-free method is used to get locally optimal results. An image databases with 7029 images is built. In this database, the average time cost of confirming number of classes is 0. 717 milliseconds, and the time complexity is O（ L）. By sampling from this database, the average time cost of the whole algorithm is less than 45 milliseconds.

关 键 词：多类类间最大方差法 图像分割 直方图概率密度函数 无导数方法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]