首页 | 官方网站   微博 | 高级检索  
     

一维对象复杂度的灰度图像分割算法
引用本文:章 怡,王海峰.一维对象复杂度的灰度图像分割算法[J].太赫兹科学与电子信息学报,2020,18(6):1058-1064.
作者姓名:章 怡  王海峰
作者单位:Information Center,Jiangsu University of Technology,Changzhou Jiangsu 213001
基金项目:江苏省常州市科技计划资助项目(CE20165049);江苏省高校自然科学基金资助项目(18KJB520012)
摘    要:从图像复杂度的角度,提出一种一维对象复杂度的灰度图像分割算法。用阈值将灰度图像分为背景与目标2类,统计其对应直方图与总像素个数,并计算对象复杂度;依据图像复杂度分割准则算法公式,遍历每一灰度级对应的图像复杂度值,选取图像复杂度值最小对应的灰度值为最佳分割阈值。仿真实验结果表明,与经典Otsu算法、信息最大熵算法和最小交叉熵算法相比,本文算法速度快,稳定性和效率最好,是一种通用有效的图像分割算法。

关 键 词:对象复杂度  图像分割  Otsu算法  最大熵  最小交叉熵
收稿时间:2018/7/19 0:00:00
修稿时间:2018/8/1 0:00:00

Grayscale image segmentation algorithm based on one-dimensional object complexity
ZHANG Yi,WANG Haifeng.Grayscale image segmentation algorithm based on one-dimensional object complexity[J].Journal of Terahertz Science and Electronic Information Technology,2020,18(6):1058-1064.
Authors:ZHANG Yi  WANG Haifeng
Abstract:Inspired by the classical segmentation algorithm, this paper proposes a grayscale image segmentation algorithm based on the image complexity. Firstly, the grayscale image is divided into background and target categories by the threshold, the corresponding histogram and total number of pixels are calculated, as well as the complexity of objects. Secondly, according to the image complexity segmentation criterion, the image complexity of each gray level is calculated. Finally, the optimal segmentation threshold is obtained by the minimum value of the object complexity. Compared with the other three classical algorithms, the experimental results show that the proposed image segmentation algorithm is fast, stable and efficient.
Keywords:
点击此处可从《太赫兹科学与电子信息学报》浏览原始摘要信息
点击此处可从《太赫兹科学与电子信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号