A Hybrid Preaching Optimization Algorithm Based on Kapur Entropy for Multilevel Thresholding Color Image Segmentation

Multilevel thresholding segmentation of color images plays an important role in many fields. The pivotal procedure of this technique is determining the specific threshold of the images. In this paper, a hybrid preaching optimization algorithm (HPOA) for color image segmentation is proposed. Firstly, the evolutionary state strategy is adopted to evaluate the evolutionary factors in each iteration. With the introduction of the evolutionary state, the proposed algorithm has more balanced exploration-exploitation compared with the original POA. Secondly, in order to prevent premature convergence, a randomly occurring time-delay is introduced into HPOA in a distributed manner. The expression of the time-delay is inspired by particle swarm optimization and reflects the history of previous personal optimum and global optimum. To better verify the effectiveness of the proposed method, eight well-known benchmark functions are employed to evaluate HPOA. In the interim, seven state-of-the-art algorithms are utilized to compare with HPOA in the terms of accuracy, convergence, and statistical analysis. On this basis, an excellent multilevel thresholding image segmentation method is proposed in this paper. Finally, to further illustrate the potential, experiments are respectively conducted on three different groups of Berkeley images. The quality of a segmented image is evaluated by an array of metrics including feature similarity index (FSIM), peak signal-to-noise ratio (PSNR), structural similarity index (SSIM), and Kapur entropy values. The experimental results reveal that the proposed method significantly outperforms other algorithms and has remarkable and promising performance for multilevel thresholding color image segmentation.     

A Grouping Differential Evolution Algorithm Boosted by Attraction and Repulsion Strategies for Masi Entropy-Based Multi-Level Image Segmentation

Masi entropy is a popular criterion employed for identifying appropriate threshold values in image thresholding. However, with an increasing number of thresholds, the efficiency of Masi entropy-based multi-level thresholding algorithms becomes problematic. To overcome this, we propose a novel differential evolution (DE) algorithm as an effective population-based metaheuristic for Masi entropy-based multi-level image thresholding. Our ME-GDEAR algorithm benefits from a grouping strategy to enhance the efficacy of the algorithm for which a clustering algorithm is used to partition the current population. Then, an updating strategy is introduced to include the obtained clusters in the current population. We further improve the algorithm using attraction (towards the best individual) and repulsion (from random individuals) strategies. Extensive experiments on a set of benchmark images convincingly show ME-GDEAR to give excellent image thresholding performance, outperforming other metaheuristics in 37 out of 48 cases based on cost function evaluation, 26 of 48 cases based on feature similarity index, and 20 of 32 cases based on Dice similarity. The obtained results demonstrate that population-based metaheuristics can be successfully applied to entropy-based image thresholding and that strengthening both exploitation and exploration strategies, as performed in ME-GDEAR, is crucial for designing such an algorithm.     

Edge linking and image segmentation by combining optical and digital methods

We present a hybrid method for segmentation of intensity images, which combines an optical contouring technique and digital algorithms for linking edge points or image segmentation. In a first stage, the digital image to be processed is displayed in a twisted-nematic liquid-crystal display (LCD), which is placed between a polarizer–analyzer pair at 45 deg (instead of 90 deg as occurs in standard LCDs). It is not difficult to demonstrate that the proposed setup produces a resultant image with very pronounced dark contours at middle intensity. After the optical preprocessing, two different digital algorithms are applied: an edge linking algorithm (modified chain code) and a simple thresholding technique for image segmentation. The proposed procedure works well with monochromatic and color images. The method could be useful as a robust technique for segmentation of large images in real-time, which presents potential applications in medical and biological imaging.     

基于遗传算法参数优化的PCNN红外图像分割

构造一种基于遗传算法参数优化的脉冲耦合神经网络(PCNN)红外图像分割算法。该算法首先利用PCNN的全局耦合性和脉冲同步性对输入图像进行点火处理,根据PCNN的输出结果计算熵作为遗传算法的适应度函数,并利用熵的变化量作为遗传算法的收敛依据,对PCNN模型中影响图像分割的参数进行组合优化,结合PCNN生物视觉特性和遗传算法解空间随机搜索能力来寻找关键参数的最优值。将遗传算法和PCNN进行结合可充分发挥二者优势,将本文方法与最大类间方差法(OTSU)、最大熵直方图分割算法和PCNN分割方法进行对比,通过交叉熵、区域对比度等客观指标对分割后的图像进行定量分析,结果表明无论从主观视觉还是客观指标,本文方法分割效果优于其他对比方法。     

An Interval Iteration Based Multilevel Thresholding Algorithm for Brain MR Image Segmentation

In this paper, we propose an interval iteration multilevel thresholding method (IIMT). This approach is based on the Otsu method but iteratively searches for sub-regions of the image to achieve segmentation, rather than processing the full image as a whole region. Then, a novel multilevel thresholding framework based on IIMT for brain MR image segmentation is proposed. In this framework, the original image is first decomposed using a hybrid L₁ − L₀ layer decomposition method to obtain the base layer. Second, we use IIMT to segment both the original image and its base layer. Finally, the two segmentation results are integrated by a fusion scheme to obtain a more refined and accurate segmentation result. Experimental results showed that our proposed algorithm is effective, and outperforms the standard Otsu-based and other optimization-based segmentation methods.     

Two-dimensional Otsu's thresholding segmentation method based on grid box filter

Otsu algorithm, an automatic thresholding method, is widely used in classic image segmentation applications. In this paper, a novel two-dimensional (2D) Otsu thresholding algorithm based on local grid box filter is proposed. In our method, firstly by utilizing the coarse-to-fine idea, the 2D histogram is divided into regions by grid technique, and each region is used as a point to form a new 2D histogram, to which 2D Otsu thresholding algorithm and an improved particle swarm optimization (PSO) algorithm are applied to get the region number of the new 2D histogram threshold. Then on the result region, the mean of the 2D histogram is computed base on box filter, and the two algorithms are applied again to obtain the final threshold for the original image. Experimental results on real data show that the proposed algorithm gets better segmentation results than the traditional recursion Otsu algorithm. It significantly reduces the time of segmentation process and simultaneously has the higher segmentation accuracy.     

Self-Adaptive Image Thresholding within Nonextensive Entropy and the Variance of the Gray-Level Distribution

In order to automatically recognize different kinds of objects from their backgrounds, a self-adaptive segmentation algorithm that can effectively extract the targets from various surroundings is of great importance. Image thresholding is widely adopted in this field because of its simplicity and high efficiency. The entropy-based and variance-based algorithms are two main kinds of image thresholding methods, and have been independently developed for different kinds of images over the years. In this paper, their advantages are combined and a new algorithm is proposed to deal with a more general scope of images, including the long-range correlations among the pixels that can be determined by a nonextensive parameter. In comparison with the other famous entropy-based and variance-based image thresholding algorithms, the new algorithm performs better in terms of correctness and robustness, as quantitatively demonstrated by four quality indices, ME, RAE, MHD, and PSNR. Furthermore, the whole process of the new algorithm has potential application in self-adaptive object recognition.     

基于混合交叉进化算法的混沌系统参数估计

提出一种混合交叉进化算法 来估计混沌系统的未知参数. 首先通过构造一个适当的适应度函数, 将混沌系统的参数估计问题转化为一个多维的优化问题. 在混合交叉进化算法中, 利用佳点集方法初始化种群, 增加了算法的稳定性和全局搜索能力. 在进化过程中, 混合交叉操作既能指导种群个体向最优解子空间靠近, 又能提高算法跳出局部最优的能力, 从而协调了算法的勘探和开采能力. 以几个标准测试函数和典型的Lorenz混沌系统为例进行仿真实验, 结果表明了该方法的有效性.     

Context dependent graph-based method for laser cladding image thresholding

For segmentation method to be useful it must be fast, easy to use, and produce high quality segmentations, but few algorithms can offer this in various conditions and applications. In this paper, we propose a context dependent graph-based method for transition region extraction and thresholding. The graph-based approach is introduced into image thresholding, and context dependent graph is constructed from a given image, which can adaptively extract the pixel context and shape information because of the scalable neighborhood. Then an edge weight function is defined as the measure of possible transition pixels, and a robust fully automatic scheme for the optimal threshold is also presented. The proposed approach is validated both quantitatively and qualitatively. Compared with the traditional state-of-art algorithms on synthetic and real images, as well as laser cladding images, the experimental results suggest that the new proposal is efficient and effective.     

An Improved Moth-Flame Optimization Algorithm with Adaptation Mechanism to Solve Numerical and Mechanical Engineering Problems

Moth-flame optimization (MFO) algorithm inspired by the transverse orientation of moths toward the light source is an effective approach to solve global optimization problems. However, the MFO algorithm suffers from issues such as premature convergence, low population diversity, local optima entrapment, and imbalance between exploration and exploitation. In this study, therefore, an improved moth-flame optimization (I-MFO) algorithm is proposed to cope with canonical MFO’s issues by locating trapped moths in local optimum via defining memory for each moth. The trapped moths tend to escape from the local optima by taking advantage of the adapted wandering around search (AWAS) strategy. The efficiency of the proposed I-MFO is evaluated by CEC 2018 benchmark functions and compared against other well-known metaheuristic algorithms. Moreover, the obtained results are statistically analyzed by the Friedman test on 30, 50, and 100 dimensions. Finally, the ability of the I-MFO algorithm to find the best optimal solutions for mechanical engineering problems is evaluated with three problems from the latest test-suite CEC 2020. The experimental and statistical results demonstrate that the proposed I-MFO is significantly superior to the contender algorithms and it successfully upgrades the shortcomings of the canonical MFO.     

Automatic leukocyte nucleus segmentation by intuitionistic fuzzy divergence based thresholding

The paper proposes a robust approach to automatic segmentation of leukocyte's nucleus from microscopic blood smear images under normal as well as noisy environment by employing a new exponential intuitionistic fuzzy divergence based thresholding technique. The algorithm minimizes the divergence between the actual image and the ideally thresholded image to search for the final threshold. A new divergence formula based on exponential intuitionistic fuzzy entropy has been proposed. Further, to increase its noise handling capacity, a neighborhood-based membership function for the image pixels has been designed. The proposed scheme has been applied on 110 normal and 54 leukemia (chronic myelogenous leukemia) affected blood samples. The nucleus segmentation results have been validated by three expert hematologists. The algorithm achieves an average segmentation accuracy of 98.52% in noise-free environment. It beats the competitor algorithms in terms of several other metrics. The proposed scheme with neighborhood based membership function outperforms the competitor algorithms in terms of segmentation accuracy under noisy environment. It achieves 93.90% and 94.93% accuracies for Speckle and Gaussian noises, respectively. The average area under the ROC curves comes out to be 0.9514 in noisy conditions, which proves the robustness of the proposed algorithm.     

大豆冠层多光谱图像提取方法

为解决大豆冠层在近地端的多光谱图像边缘灰度不均,目标与背景之间灰度差别小,难以准确高效地获取大豆冠层目标区域的难题,将多光谱成像处理技术与经典图像分割方法有机融合,提出基于多光谱图像处理技术的大豆冠层提取方法。以东北大豆为对象,通过Sequoia多光谱相机采集绿光、近红外、红光、红边和可见光五类大豆多光谱图像,采用高斯平滑滤波法对原始大豆多光谱图像进行预处理,分析多光谱图像中大豆冠层和背景的灰度直方图分布特性,在此基础上利用迭代法、Otsu法和局部阈值法提取原大豆多光谱图像中冠层区域,并以图像形态学开运算处理细化和扩张背景,避免图像区域内干扰噪声对大豆冠层识别效果的影响,同时以有效分割率、过分割率、欠分割率、信息熵以及运行时间等为监督指标,对大豆冠层多光谱图像识别模型进行效果评价。大豆冠层识别模型中迭代法可以有效分割近红外和可见光大豆冠层图像,有效分割率分别为97.81%和87.99%,对绿光、红光和红边大豆冠层图像分割效果较差,有效分割率低于70%;Otsu法和局部阈值法可以有效分割除红光波段的其余四种多光谱大豆冠层图像,且有效分割率均在82%以上;三种算法对红光大豆冠层图像的有效分割率均低于20%,未达到较好效果。在原始多光谱图像中应用迭代法、Otsu法和局部阈值法提取大豆冠层图像与标准图像的信息熵平均值波动幅度分别为：0.120 1,0.054 7和0.059 8,其中Otsu法和局部阈值法较小,表明了对于大豆冠层多光谱图像识别中两种算法的有效性。该算法中Otsu法和局部阈值法均可以有效提取绿光、近红外、红边和可见光等多光谱的大豆冠层图像,二者较为完整地保留了大豆冠层信息,其中Otsu法实时性能较局部阈值法更好。该成果为提取农作物冠层多光谱图像提供理论依据和技术借鉴。     

Improvement in image resolution based on dispersive representation of data

A method for reconstructing the resolution of images, based on selection and optimization of significant local features and sparse representation of processed-image blocks (using optimized low- and high-resolution dictionaries), has been substantiated for the first time. This method, making it possible to improve significantly the resolution of images of various nature, is interpreted physically. A block diagram of the processing system corresponding to the new approach to image reconstruction has been developed. A simulation of the new method for reconstructing images of different physical natures and known algorithms showed an advantage of the new scheme for reconstructing resolution in terms of universally recognized criteria (peak signal-to-noise ratio, mean absolute error, and structural similarity index measure) and in visual comparison of the processed images.     

一维Renyi熵阈值法中参数的自适应选取

提出了一种自适应选取一维Renyi熵阈值分割法中参数α的方法.该方法以一种图像分割质量评价指标 均匀性测度为适应度函数,利用粒子群算法在参数空间进行优化搜索,从而可以根据具体的图像获得合适的参数,得到最佳的图像分割阈值.结果表明：一般情况下,可以（0,1）范围内搜索最优的α值|当需要更好的分割效果时,可在（0,10）范围内搜索最优的α值.     

Minimum variance centroid thresholding

Image-processing thresholding algorithms are extended segmentation tools that are suitable for tracking applications. The centroid of the tracked image distribution is a good point of reference for the location of the image. We describe a new thresholding technique that is based on the estimation of the optimum threshold for achieving minimal variance in the centroid of the processed image. Experimental proofs for evaluating the technique's performance are given. The direct extension of these results to Shack-Hartmann wave-front sensors is also shown.     

Multicontext wavelet-based thresholding segmentation of brain tissues in magnetic resonance images

A novel segmentation method based on wavelet transform is presented for gray matter, white matter and cerebrospinal fluid in thin-sliced single-channel brain magnetic resonance (MR) scans. On the basis of the local image model, multicontext wavelet-based thresholding segmentation (MCWT) is proposed to classify 2D MR data into tissues automatically. In MCWT, the wavelet multiscale transform of local image gray histogram is done, and the gray threshold is gradually revealed from large-scale to small-scale coefficients. Image segmentation is independently performed in each local image to calculate the degree of membership of a pixel to each tissue class. Finally, a strategy is adopted to integrate the intersected outcomes from different local images. The result of the experiment indicates that MCWT outperforms other traditional segmentation methods in classifying brain MR images.     

二维Arimoto熵直线型阈值分割法

Arimoto熵是一种广义熵形式.本文首先指出了已提出的二维Arimoto熵阈值分割法的表述错误,给出了正确的二维Arimoto熵阈值分割法;然后提出了二维Arimoto熵直线型阈值分割法,并给出了快速递推公式;对Arimoto熵公式中参量的选择进行了探讨,并基于标准图像进行了分割性能评估.大量分割实验表明,二维Arimoto熵直线型阈值法至少与二维Arimoto熵和二维Renyi熵直线型阈值法分割效果相当;在图像边缘和噪音信息丰富的情况下,二维Arimoto熵直线型阈值法的分割效果优于二维Arimoto熵和二维Renyi熵直线型阈值法,是一种有效的图像阈值方法.     

Cellular neural networks for welding arc thermograms segmentation

Machine vision systems are used in many areas for monitoring of technological processes. Among this processes welding takes important place, where often infrared cameras are used. Besides reliable hardware, successful application of vision systems requires suitable software based on proper algorithms. One of most important group of image processing algorithms is connected to image segmentation. Obtainment of exact boundary of an object that changes shape in time, such as the welding arc, represented on a thermogram is not a trivial task. In the paper a segmentation method using supervised approach based on a cellular neural networks is presented. Simulated annealing and genetic algorithm were used for training of the network (template optimization). Comparison of proposed method to a well elaborated segmentation method based on region growing approach was made. Obtained results prove that the cellular neural network can be a valuable tool for infrared welding pool images segmentation.     

群体智能优化中的虚拟碰撞：雨林算法

启发式优化算法中寻优代理过早收敛易陷入局部最优. 本文对此进行机理分析并发现, 虚拟碰撞作为一种隐性过早收敛现象将直接影响群体智能优化算法的准确性与快速性, 而采样过程的无约束性和样本分布信息的缺失是导致虚拟碰撞的根本原因. 为解决上述问题, 本文提出雨林优化算法. 该算法仿照植物生长模式, 利用规模可变种群代替规模限定种群进行分区分级寻优采样, 并结合均匀与非均匀采样原则来权衡优化算法的探索与挖掘, 可以有效减少虚拟碰撞的发生, 在提高寻优效率的同时, 获取精准性和稳定性较高的全局最优解. 与遗传算法、粒子群算法对标称函数的寻优对比实验表明, 雨林算法在快速性、准确性以及泛化能力等方面均具有优势. 关键词： 优化算法 群体智能 进化计算 计算智能     

基于邻域分割的空谱联合稀疏表示高光谱图像分类技术研究

传统的高光谱遥感影像分类算法侧重于光谱信息的应用。随着高光谱遥感影像的空间分辨率的增加,高光谱影像中相同类别的地物在空间分布上呈现聚类特性,将空间特性有效地应用于高光谱遥感影像分类算法对分类精度的提升非常关键。但是,高光谱影像的高分辨率提供空间聚类特性的同时,在不同地物边缘处表现出的差异性更加明显,若不对空间邻域像素进行甄选,直接将邻域光谱信息引入,设计空谱联合稀疏表示进行图像分割,则分类误差较大,收敛速度大大降低。将光谱角引入空谱联合稀疏表示图像分类理论中,提出了一种基于邻域分割的空谱联合稀疏表示分类算法。该算法利用光谱角计算相邻像素的空间相似度,剥离相似度较低的邻域像素,将相似度高的邻域像素定义为同类地物,引入空谱联合稀疏表示模型中,采用子联合空间追踪算子和联合正交匹配追踪算子对其优化求解,以最小重构误差为准则进行分类。选取AVIRIS及ROSIS典型光谱影像数据进行实验仿真,从中可以看出,随着光谱角分割阈值的提高,复杂的高光谱影像分类精度和平滑区域的高光谱影像分类精度均逐步提高,表明邻域分割在空谱联合稀疏表示分类中的必要性。