A multilevel color image segmentation technique based on cuckoo search algorithm and energy curve

Amongst all the multilevel thresholding techniques, standard histogram based thresholding approaches are very impressive for bi-level thresholding. But, it is not effective to select spatial contextual information of the image for choosing optimal thresholds. In this paper, a new color image thresholding technique is presented by using an energy function to generate the energy curve of an image by considering spatial contextual information of the image. The property of this energy curve is very much similar to histogram of the image. To estimate the spatial contextual information for thresholding practice, in place of histogram, the energy curve function is used as an input. A new energy curve based color image segmentation approach using three well known objective functions named Kapur’s entropy, between-class-variance, and Tsalli’s entropy is proposed. In this paper, cuckoo search (CS) and egg lying radius-cuckoo search (ELR-CS) optimization algorithms with different parameter analysis have been used for solving the color image multilevel thresholding problem. The experimental results demonstrate that the proposed CS-Kapur’s energy curve based segmentation can powerfully and accurately search the multilevel thresholds.     

基于灰度和非局部空间灰度特征的二维Otsu曲线阈值分割法

为了克服图像噪声对图像分割结果的影响,利用图像中与像素具有相似邻域结构的像素提取当前像素的非局部空间信息,构造了基于像素的灰度信息和非局部空间灰度信息的二维直方图,并将此二维直方图引入到Otsu曲线阈值分割法中,提出了基于灰度和非局部空间灰度特征的二维Otsu曲线阈值分割法。实验结果表明,该方法能进一步提高原始二维Otsu曲线阈值分割法对于图像噪声的鲁棒性,获得了更加理想的分割结果。     

Gradient histogram: Thresholding in a region of interest for edge detection

Selecting a threshold from the gradient histogram, a histogram of gradient magnitudes, of an image plays a crucial role in a gradient based edge detection system. This paper presents a methodology to determine the threshold from a gradient histogram generated using any kind of linear gradient operator on an image. We consider the image as a random process with dependent samples, model the gradient histogram using theories of random process and random input to a system, and determine a region of interest in the gradient histogram using certain properties of a probability density function. Standard histogram thresholding techniques are then used within the region of interest to get the threshold value. To obtain the edges, this threshold value is then used as the upper threshold of the hysteresis thresholding technique that follows the non-maximum suppression operation applied on the gradient magnitude image. The proposed methodology of determining a threshold in a gradient histogram is deduced through rigorous analysis and hence it helps in achieving consistently appreciable edge detection performance. Experimental results using different real-life and benchmark images are shown to demonstrate the effectiveness of the proposed technique.     

基于IGA与GMM的图像多阈值分割方法*

为了实现图像的有效分割,提出了一种自适应多阈值图像分割方法,能够自动获得最佳分割阈值数目和阈值。该方法对灰度直方图进行合适尺度的连续小波变换,将小波变换曲线中幅值为负的波谷点构成阈值候选集;再应用免疫遗传算法从阈值候选集中选取准阈值,准阈值的个数对应为最佳分割类数;根据准阈值构建灰度直方图的高斯混合模型,由最小误差准则求得分割阈值。仿真实验表明,该方法能够实现图像的自动多阈值分割,能够得到很好的分割结果且分割效率高,在多目标图像分割中能够得到很好的应用。     

Edge magnitude based multilevel thresholding using Cuckoo search technique

Multilevel thresholding technique is popular and extensively used in the field of image processing. In this paper, a multilevel threshold selection is proposed based on edge magnitude of an image. The gray level co-occurrence matrix (second order statistics) of the image is used for obtaining multilevel thresholds by optimizing the edge magnitude using Cuckoo search technique. New theoretical formulation for objective functions is introduced. Key to our success is to exploit the correlation among gray levels in an image for improved thresholding performance. Apart from qualitative improvements the method also provides us optimal threshold values. Results are compared with histogram (first order statistics) based between-class variance method for multilevel thresholding. It is observed that the results of our proposed method are encouraging both qualitatively and quantitatively.     

A novel image thresholding method based on Parzen window estimate

Image segmentation is one of the most important and fundamental tasks in image processing and techniques based on image thresholding are typically simple and computationally efficient. However, the image segmentation results depend heavily on the chosen image thresholding methods. In this paper, histogram is integrated with the Parzen window technique to estimate the spatial probability distribution of gray-level image values, and a novel criterion function is designed. By optimizing the criterion function, an optimal global threshold is obtained. The experimental results for synthetic real-world and images demonstrate the success of the proposed image thresholding method, as compared with the OTSU method, the MET method and the entropy-based method.     

Automatic threshold selection based on histogram modes and a discriminant criterion

Due to the unconstrained nature of image segmentation, the existing thresholding methods require considerable human intervention and pre-assumptions to determine appropriate threshold values. In this paper, a fully automatic thresholding method via histogram modal decomposition by data-dependent-systems methodology is presented. In this method, the histogram of an image is parametrically modeled by the power spectrum of an autoregressive model to provide vital information about histogram clusters. Utilizing the modal information, threshold values are then selected to maximize the between-class variance. The proposed method is validated by illustrative examples; comparison with the existing methods helps explain their differences and the superiority of the approach.     

二维Otsu阈值法的快速算法

最大类间方差法(Otsu)是图像分割的经典算法,在其基础之上发展起来的二维Otsu阈值分割法由于计算复杂而制约了其应用。针对这一缺点,提出一种改进的二维Otsu阈值法的快速算法。首先将原始二维直方图划分成M×M个区域,将每个区域视为1个点,构造新的二维直方图,在其上利用二维Otsu以及快速递推算法,得到分割阈值所处的区域编号;既而对所确定的区域再次使用二维Otsu算法得到原始图像的分割阈值。实验结果证明,改进算法有效地提高了计算速度,降低了算法的空间复杂度,且分割效果与原始算法基本一致。     

一种基于遗传算法的最小交叉熵阈值选择方法

最小交叉熵阈值法(MCET) 在二级阈值中是有效的, 但在多极阈值的穷尽搜索中却要付出昂贵的时间代价. 鉴于此, 提出一种基于遗传算法(GA) 的MCET选择方法: 在执行图像分割(IS) 任务之前, 先将IS 转化为在一定约束 条件下待优化的问题; 在寻找待优化问题最优解的计算过程中引入一种回归设计技巧以存储中间结果; 使用这种回 归设计技巧, 在一组标准测试图像上利用GA搜索待优化问题的最优解. 实验结果表明, 利用所提出的方法获得的多 个阈值非常接近于穷尽搜索获得的结果.

     

基于细胞神经网络的图像阈值化方法*

图像阈值化是一种经典、简单而又非常有效的图像分割方法,并已得到了广泛的研究。在分析灰度图像直方图分布的基础上提出了一种基于细胞神经网络（CNN）结合直方图分析的图像阈值化方法,并给出了阈值化CNN所需阈值的自动搜索算法。实验结果表明,相对于其他两种经典的阈值化方法,该方法的阈值化分割结果较好。     

融合非局部空间灰度信息的三维Otsu法

为了提高最大类间方差阈值分割法(Otsu)对于图像噪声的鲁棒性,提出融合非局部空间灰度信息的三维Otsu法。该方法利用图像像素的灰度信息、邻域中值灰度信息和非局部空间灰度信息进行直方图统计,构建新颖的三维直方图,采用最大类间方差作为阈值选取准则。实验结果表明新方法对于噪声的鲁棒性要优于原始三维Otsu法,能够获得更加令人满意的分割结果。     

基于快速小波包直方图技术的图像检索算法

提出了一种基于快速小波包直方图技术的图像检索新算法。此方法主要有图像的小波包分解,最主要能量频带的选择和小波包直方图的抽取及相似性度量三个步骤。首先,用一族正交小波基分解一幅图像并用小波包系数计算各个频带的能量;其次,选择几个最主要能量频带进行阈值化和非线性滤波;最后,抽取小波包直方图作为特征表示并应用直方图相交距离从图像数据库中检索被查询图像。由于该方法在特征抽取中应用较小的特征空间,因此需要较小的计算复杂性。实验结果表明,这些技术在图像检索中可以获得更好的性能。     

自动图像阈值分割算法

该文提出了一种新的图像阈值分割算法。该算法通过求取最大模糊熵准则下,灰度均值直方图的最佳模糊划分参数来确定两个模糊集A和B,图像分割阈值即选取为两个模糊集的交点。该算法用Zadth的模糊熵定义适应度函数,采用改进的遗传算法寻求最佳模糊参数。该文对遗传算法的改进包括,给出了缩短染色体码长的编码方法和性能良好的改进的单点交叉算子和均匀变异算子。实验结果表明,该算法的分割效果与二维模糊熵算法接近,而计算时间还没有用到二维模糊熵算法的一半。     

基于自适应模糊阈值的植物黑腐病叶片病斑的分割

为了更好地研究植物黑腐病,对植物黑腐病病斑图像进行了分割研究,即根据病斑图像的特点,用图像模糊阈值分割法来分割病斑。针对目前图像模糊阈值分割法存在窗口宽度自动选取困难的问题,首先在预先给定隶属函数和图像像素类别数的情况下,提出了图像模糊阈值分割法的自适应窗宽选取方法;然后,针对用图像模糊阈值分割方法难于分割直方图具有单峰或双峰差别很大的图像的问题,提出了一种直方图变换方法,用来对直方图进行变换;最后根据变换后的直方图,再利用自适应模糊阈值分割法对植物黑腐病病斑图像进行分割。用采集到的病斑叶片进行的病斑分割实验结果表明,该算法是有效的与鲁棒的。     

利用混沌布谷鸟优化的二维Renyi灰度熵图像阈值选取

为了进一步降低现有的Renyi熵阈值法的计算复杂度,提出了基于混沌布谷鸟算法和二维Renyi灰度熵的阈值选取。首先,引入一维Renyi灰度熵阈值选取公式,建立基于像素灰度和邻域梯度的二维直方图,推导出基于该直方图的二维Renyi灰度熵阈值选取公式,通过快速递推公式来减少阈值准则函数的计算量;最后,采用混沌布谷鸟算法搜索最优阈值来完成图像分割。结果表明,与二维Arimoto熵法、基于粒子群的二维Renyi熵法、基于混沌粒子群的二维Tsallis灰度熵法、基于布谷鸟算法的二维Renyi灰度熵法相比,所提出的方法能够准确实现图像分割,且运算速度有所提升。     

An improved scheme for minimum cross entropy threshold selection based on genetic algorithm

Image segmentation is one of the most critical tasks in image analysis. Thresholding is definitely one of the most popular segmentation approaches. Among thresholding methods, minimum cross entropy thresholding (MCET) has been widely adopted for its simplicity and the measurement accuracy of the threshold. Although MCET is efficient in the case of bilevel thresholding, it encounters expensive computation when involving multilevel thresholding for exhaustive search on multiple thresholds. In this paper, an improved scheme based on genetic algorithm is presented for fastening threshold selection in multilevel MCET. This scheme uses a recursive programming technique to reduce computational complexity of objective function in multilevel MCET. Then, a genetic algorithm is proposed to search several near-optimal multilevel thresholds. Empirically, the multiple thresholds obtained by our scheme are very close to the optimal ones via exhaustive search. The proposed method was evaluated on various types of images, and the experimental results show the efficiency and the feasibility of the proposed method on the real images.     

矩不变调整的二维Shannon嫡图像分割及其快速实现

为了克服二维Shannon熵阈值法的缺陷,提出了一种使用矩不变法来调整二维直方图斜分Shannon熵的阈值分割方法。首先将二维直方图斜分原理运用到两种Shannon熵阈值法中,然后利用矩不变法从两种熵阈值法获取的阈值中选择最佳阈值,并提出二维直方图斜分Shannon熵阈值法的一般递推算法,最后将二维直方图分布特性与这种算法有机结合得到新型快速的递推算法。实验结果表明,提出的方法不仅分割效果优于当前的二维直方图斜分的最大熵阈值法,而且运行速度更快,约快4倍。     

基于图像边缘信息的2维阈值分割方法

为了改善2维阈值分割性能,提高图像分割的效率,在传统2维Otsu阈值分割算法的基础上,提出了一种基于图像边缘信息的2维阈值分割方法。这种改进的方法保留了2维Otsu阈值分割算法分割结果准确的优点,并在此基础上充分利用图像的边缘信息,通过分析图像的边缘直方图和阈值的关系来得到最优分割阈值。仿真实验结果表明,该方法与传统2维分割算法相比,不仅计算简单,而且实时性好。     

基于正则割（Ncut）的多阈值图像分割方法

在图像处理与目标识别中广为应用的阈值法是图像分割的一种重要方法,因此如何确定阈值是图像分割的关键。提出了一种新的图像阈值分割方法,把图像的一维灰度直方图的灰度级L和对应灰度级L的概率P视为二维平面上的点（L,P）,采用新的相似度函数来定义这些点之间的相似度,从而构建基于灰度级的相似度矩阵,然后使用正则割（Ncut）进行分类,根据分类结果确定图像的分割阈值。算法用基于灰度级的权值矩阵代替基于像素级的权值矩阵来描述图像像素的关系,因而需要的存储空间及实现的复杂性大大减少;与现有的阈值分割方法相比,该算法能够单阈值和多阈值分割图像,因此具有更为优越的性能。     

融合视觉模型和最大类间方差的阈值分割算法

针对传统二维直方图的区域划分方法存在把图像的部分目标点和背景点错误划分为边缘点或噪声点,而把部分边缘点和噪声点划分为目标点和背景点的缺点,以及传统二维最大类间方差阈值分割算法的时间复杂度较高的缺点,提出了采用视觉模型构造二维直方图,并提出了该二维直方图的区域划分方法,同时还把提出的二维直方图应用到最大类间方差阈值分割算法中。根据分割时间、分类误差、均匀性等定量评价标准,做了一系列实验,与几种典型的二维阈值分割算法相比,提出的阈值分割算法在降低计算复杂度的同时还具有很好的分割性能。