检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张新明[1] 党留群[1] 郑延斌[1] 孙印杰[1] 李双[1]
机构地区:[1]河南师范大学计算机与信息技术学院,河南新乡453007
出 处:《光电工程》2010年第11期103-109,共7页Opto-Electronic Engineering
基 金:河南省重点科技攻关项目(092102210017;102102210180);河南省教育厅科技攻关项目(2008B520021)
摘 要:针对当前二维最小交叉熵阈值法存在计算复杂度高等问题,提出了一种改进的二维最小交叉熵阈值分割方法。首先,依据图像的含噪声类型选择邻域模板并建立相应的二维直方图来提高分割效果;然后,对二维最小交叉熵公式进行推导和简化处理,利用定义的数组运算推导出新型递推算法,再确定图像及其邻域图像的实际灰度级别范围,并用这种新算法在所求的灰度级别范围内搜索最佳阈值向量来降低计算复杂度;最后,使用关键阈值对滤波后的图像进行分割达到最佳的分割效果。仿真实验结果表明,与当前的二维最小交叉熵阈值分割法相比,本文提出的方法不仅分割性能及抗噪性能更强,而且分割时间大大减少,小于0.05s。In view of the problems of the current thresholding method based on 2-D minimum cross entropy,such as computing complexity,an improved image segmentation method based on 2-D minimum cross entropy is presented.Firstly,a neighborhood mask was selected according to the image type including the noise and a corresponding 2-D histogram was created to improve the segmentation performance.Then,the thresholding formula of 2-D minimum cross entropy was simplified,and through the defined array operations,the recursive algorithm was combined into a new search algorithm.The gray limits of the image and the neighborhood image were obtained,and in the limits,the new recursive algorithm was used to search the best threshold vector and to reduce the computing complexity.Finally,the neighborhood image was segmented with the key threshold to obtain better segmentation effects.Experimental results show that the proposed method's segmentation effect and its anti-noise are better than those of the current thresholding method based on 2-D minimum cross entropy,and its computing time is much less,below 0.05 second.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.31