摘要
针对传统的三维Otsu分割算法计算量大、运算时间长等问题,提出一种利用一维Otsu来减小迭代空间和搜索空间,并用布谷鸟搜索算法进行寻优的算法。仿真实验表明,该算法能够有效减少运算时间。同时针对传统的三维Otsu算法因忽略2-7区域而导致错分的问题,提出了一种处理方法。该方法将2-7区域的像素点分为噪声点和非噪声点,分别对其进行处理,对2-7区域内的所有点都进行分配。仿真实验表明,由于该方法考虑了所有像素点,分割结果要优于传统的三维Otsu分割算法。
Aiming at the problem of large calculation and long running time of the three-dimensional Otsu image segmentation algorithm,an algorithm was proposed to reduce the iterative space and search space by using one-dimensional Otsu and cuckoo search algorithm in this paper.The simulation shows that the algorithm can effectively reduce the computing time.At the same time,aiming at the problem of the error segmentation of traditional three-dimensional Otsu image algorithm due to neglecting the region of 2 to 7,aprocessing method was proposed.This method divides the pixels in the region of 2 to 7 into noise and non-noise points,and assigns all the pixels.The simulation result shows that the segmentation of this method is superior to that of traditional three-dimensional Otsu segmentation algorithm.
作者
仇国庆
熊耕耘
赵文铭
QIU Guo-qing;XIONG Geng-yun;ZHAO Wen-ming(College of Automation,Chongqing University of Posts and Telecommunications,Chongqing 400065,Chin)
出处
《计算机科学》
CSCD
北大核心
2018年第8期247-252,共6页
Computer Science
基金
国家自然科学基金(61673079)
重庆市基础科学与前沿技术研究项目(cstc2016jcyjA1919)资助
关键词
三维Otsu
布谷鸟搜索算法
阈值
图像分割
Three-dimensional Otsu
Cuckoo search algorithm
Threshold
Image segmentation
