基于改进共生生物搜索算法的林火图像多阈值分割

针对传统多阈值分割方法计算复杂度随着阈值个数的增加而增长,以及对给定图像进行多阈值分割操作时效率很低等问题,提出了一种基于共生生物搜索(SOS)算法结合Kapur熵的多阈值分割方法.首先将精英反策略(EOBL)引入到SOS算法的共栖阶段,从而改善传统SOS算法处理复杂优化问题时易陷入局部最优的问题;然后引入莱维飞行策略...     

基于链式竞争遗传算法的KSW熵的图像分割

针对最佳熵阈值图像分割算法过程中计算复杂度高的问题,提出了一种基于链式竞争遗传算法的最佳熵阈值确定法(KSW熵法)的图像分割算法.通过将3个邻域的链式竞争引入到常规遗传算法框架下,实现特征选择过程;将改进的遗传算法应用到最佳阈值图像分割算法中,完成对阈值的寻优过程.仿真实验结果与分析表明:算法在分割速度和效果上均优于传统的最佳阈值图像分割算法和单纯的遗传优化最佳阈值图像分割算法.     

基于通用学习均衡优化器的多阈值图像分割

传统的元启发式多阈值图像分割算法计算复杂度高且容易陷入局部最优,通用学习均衡优化器在搜索过程中使粒子从不同维度的候选粒子中学习,在求解复杂问题最优解时有很强的能力,克服了容易陷入局部最优的问题。提出将通用学习均衡优化算法优化最大类间方差法来实现多阈值图像分割,实验选择标准灰度图像,以峰值信噪比、结构相似度、运行时间和适应度值为评价标准,将该算法与均衡优化算法、粒子群优化算法进行了比较。结果表明,基于通用学习均衡优化器的多阈值图像分割算法结果的峰值信噪比、结构相似度在绝大多数情况下优于另外两个算法,并且收敛速度快,执行效率高。     

基于图像多目标分割的水墨画风格仿真方法研究

针对传统的多目标分割算法在进行中国水墨画图像分割仿真过程中渲染效果不佳,细节处理粗糙的问题.本文通过数字图像处理方法,根据先验知识将相关物体关联,利用二维多目标图像分割技术寻找分割对象边缘,引入相似度准则获取种子像素生长的起点,采用颜色匹配距离进行相似度区分,有效利用图像空间信息来提升对图像颜色的匹配.通过将本文改进的算法与传统阈值法进行实例验证表明,本文提出的分割算法获得的水墨画仿真图片具备了优异的图画分割渲染,大幅提高了水墨画的细节处理效果的同时,具备了高的运行时效性.     

基于进化规划的最大类间方差的图像分割算法

图像分割是计算机视觉中一个关键的技术.在分析了最大类间方差算法(Ostu算法)求阈值进行图像分割以及进化规划原理的基础上,提出了一种自动阈值选取的图像分割的算法.该算法以灰度图像的灰度最大类间方差作为适应度值,将图像分割问题看作为一个全局数值优化问题,利用进化规划全局寻优和快速计算的特点,搜索一个最佳阈值用于图像分割.最后基于实例对其与传统Ostu算法进行性能比较和效果验证.结果表明,本方法在图像分割过程中具有速度快,效果好的特点.     

面向小目标图像的快速核密度估计图像阈值分割算法

针对当前小目标图像阈值分割研究工作面临的难题,提出了快速核密 度估计图像阈值分割新方法.首先给出了基于加权核密度估计器的概率计算模 型,通过引入二阶Renyi熵作为阈值选取准则,提出了基于核密度估计的图像阈 值分割算法 (Kernel density estimator based image thresholding algorithm, KDET), 然后通过引入快速压缩集密度估计 (Fast reduced set density estimator, FRSDE)技术,得到核密度估计的 稀疏权系数表示形式,提出快速核密度估计图像阈值分割算法fastKDET,并从 理论上对相关性质进行了深入探讨.实验表明,本文算法对小目标图像 阈值分割问题具有更广泛的适应性,并且对参数变化不敏感.     

基于谱聚类的多闭值图像分割方法

阈值法是图像分割的一种重要方法,在图像处理与目标识别中广为应用。因此,如何确定阈值是图像分割的关键。提出了一种新的图像阈值分割方法,即通过采用新的相似度函数的谱聚类算法(Dcut)确定图像阈值。采用基于灰度级的权值矩阵代替常用的基于图像像素级的权值矩阵描述图像像素的关系,因而算法需要的存储空间及实现的复杂性与其它基于图的图像分割方法相比大大减少。实验表明,该方法分割图像的时间少,且能够单阈值和多阈值分割图像,与现有的阈值分割方法相比,其具有更为优越的分割性能。     

基于相关向量机的图像阈值技术

图像阈值化是一种直观有效的图像分割技术,在图像分析、模式识别及计算机视觉中具有重要应用.传统的阈值化方法通常基于某个特定的优化问题,需要在整个灰度范围内搜索最佳阈值(或阈值组合).最近,基于支持向量回归(SVR)的多阈值分割算法,直接从支持向量(SV)中获得阈值信息,无需对图像施加任何先验假设,并避免了繁琐的优化过程.然而:1.如何从众多SV中获得可靠的阈值尚待解决(SVR阈值方法的公开问题);2.虽然SVR阈值技术避免了传统多阈值算法可能出现的组合优化问题,但是其中超参数的选择往往需要耗时的交叉验证;3.算法在单峰直方图情形下失效.针对这些问题,并受相关向量机(RVM)方法的启发,提出了一种新的基于RVM的多阈值自动选择技术.由于RVM可以极大地约减“SV”数目,并且无需交叉验证进行参数调整,使得最终阈值的确定更加高效、可靠且异常容易;另外所提算法能有效地处理单峰直方图情形,使阈值分割具有更强的适应性.实验表明基于RVM的阈值技术不仅保留了SVR阈值技术的优点,而且解决了其中的公开问题,并显著地提高了算法的效率和适应能力.     

基于混合蛙跳算法改进的OTSU遥感图像分割方法

阈值的快速选取和噪声处理对图像分割起着至关重要的作用。针对遥感图像分割过程中阈值快速选取和噪声处理的问题,首次提出一种基于混合蛙跳算法优化改进的OTSU遥感图像快速分割算法。该算法首先对图像进行处理,引入一个邻域的空间和灰度相似测量因子来进行抗噪并且保护图像细节。再以最大类间方差作为混合蛙跳算法适应度函数,通过混合蛙跳算法的局部搜索和全局信息交换来快速确定图像分割的全局最佳阈值。实验结果表明,与传统OTSU图像分割算法及基本遗传算法改进的二维OTSU图像分割算法相比,该算法能更有效地去除噪声的干扰,算法运算效率更高。     

广义模糊熵阈值法中基于粒子群优化的参数选取

针对广义模糊熵图像阈值分割法中参数m的选取问题,提出一种利用优化算法自适应选取参数的广义模糊熵阔值分割方法.该方法通过粒子群优化算法,依据图像分割质量评价准则对参数m在(0,1)区间进行全局寻优,并依据广义模糊熵最大准则对S型隶属度函数中的3个参数(a,b,d)进行全局组合寻优,从而实现了广义模糊熵图像阈值分割方法的自动阈值选取.实验结果表明,该方法对光照不均匀图像具有更好的分割效果.     

Oppositional symbiotic organisms search optimization for multilevel thresholding of color image

Selection of optimal threshold is the most crucial issue in threshold-based segmentation. In case of color image, this task is become challenging, because conventional color image segmentation has computational complexity and also it suffers from lack of accuracy. Various techniques such as threshold based, region growing, edge detection, graph cut, pixel classification, neural network, active contour, gray level co-occurrence matrix are proposed so far for image segmentation in the literature. Out of them, threshold-based segmentation is popular for its simplicity. To address the problem of color image segmentation, we propose an enhanced version of metaheuristic optimization algorithm called Opposition based Symbiotic Organisms Search (OSOS) to solve multilevel image thresholding technique for color image segmentation by introducing opposition based learning concepts to accelerate the convergence rate and enhance the performance of standard symbiotic organisms search (SOS). The performance of the proposed OSOS based algorithm is investigated thoroughly and compared with some existing techniques like Cuckoo Search (CS), BAT algorithm (BAT), artificial bee colony (ABC) and particle swarm optimization (PSO). The comparison is made by applying the algorithm to a set of color images taken from a well-known benchmark dataset (Berkeley Segmentation Dataset (BSDS)) and some of the color images collected for the COCO dataset. It is observed from the results that the performance of the OSOS based algorithm is promising with respect to standards SOS and others in terms of the values of objective functions as well as the values of some well-defined quality metrics such as peak signal-to-noise ratio (PSNR), structure similarity index (SSIM) and feature similarity index (FSIM). The results of the proposed algorithm may encourage the scientists and engineers to apply it into pattern recognition problems.     

Segmentation of malignant tumours in mammogram images: A hybrid approach using convolutional neural networks and connected component analysis

The segmentation of breast lesions is an important step in the computer-aided analysis of the mammogram. The presence of noise in mammograms makes lesion detection challenging particularly for complex malignant lesions. Pre-processing techniques can deal with the noise issue but distorts the important shape features. This motivates us to propose a novel hybrid approach by combining a convolution neural network (CNN) with connected component analysis (CCA) to segment malignant breast lesions without any pre-processing to avoid any distortion in image sharpness at the initial stages. Two well-known segmentation techniques namely, K-means (KM) and Fuzzy c-means (FCM) are also used to compare the results. From a pool of 1045 mammographic cancer images acquired from the Digital Database for Screening Mammography (DDSM), 1016 are used for training and validation, and 29 are used for testing. All three results (Hybrid, KM and FCM) are compared against the results by the expert Radiologist. The results indicate that, among various segmentation techniques, the proposed hybrid approach achieves the highest accuracy (90%), Matthew's correlation coefficient (0.79), Jaccard index (0.73) and the Dice similarity coefficient (0.84). Other performance evaluation techniques such as; precision, sensitivity, specificity, false-positive rate, false discovery rate, negative predictive value and false-negative rate also show the superior performance of the proposed hybrid approach. Statistical analysis (Mann–Whitney U test, T-test, Chi-square test, Kolmogorov–Smirnov test and Wilcoxon test), graphical analysis (Regression and Bland–Altman plots) and receiver operating characteristic curve further demonstrate the stability and consistency of the results.     

空间约束层次加权Gamma混合模型的SAR图像分割

目的 合成孔径雷达（SAR）图像中像素强度统计分布呈现出复杂的特性,而传统混合模型难以建模非对称、重尾或多峰等特性的分布。为了准确建模SAR图像统计分布并得到高精度分割结果,本文提出一种利用空间约束层次加权Gamma混合模型（HWGaMM）的SAR图像分割算法。方法 采用Gamma分布的加权和定义混合组份;考虑到同质区域内像素强度的差异性和异质区域间像素强度的相似性,采用混合组份加权和定义HWGaMM结构。采用马尔可夫随机场（MRF）建模像素空间位置关系,利用中心像素及其邻域像素的后验概率定义混合权重以将像素邻域关系引入HWGaMM,构建空间约束HWGaMM,以降低SAR图像内固有斑点噪声的影响。提出算法结合M-H（Metropolis-Hastings）和期望最大化算法（EM）求解模型参数,以实现快速SAR图像分割。该求解方法避免了M-H算法效率低的缺陷,同时克服了EM算法难以求解Gamma分布中形状参数的问题。结果 采用3种传统混合模型分割算法作为对比算法进行分割实验。拟合直方图结果表明本文算法具有准确建模复杂统计分布的能力。在分割精度上,本文算法比基于高斯混合模型（GMM）、Gamma分布和Gamma混合模型（GaMM）分割算法分别提高33%,29%和9%。在分割时间上,本文算法虽然比GMM算法多64 s,但与基于Gamma分布和GaMM算法相比较分别快600 s和420 s。因此,本文算法比传统M-H算法的分割效率有很大的提高。结论 提出一种空间约束HWGaMM的SAR图像分割算法,实验结果表明提出的HWGaMM算法具有准确建模复杂统计分布的能力,且具有较高的精度和效率。     

改进的元启发式优化算法及其在图像分割中的应用

元启发式算法自20世纪60年代提出以后,由于其具有可以有效地减少计算量、提高优化效率等优点而得到了广泛应用.该类算法以模仿自然界中各类运行机制为特点,具有自我调节的特征,解决了诸如梯度法、牛顿法和共轭下降法等这些传统优化算法计算效率低、收敛性差等缺点,在组合优化、生产调度、图像处理等方面均有很好的效果.提出了一种改进的元启发式优化算法——NBAS算法.该算法通过将传统天牛须算法（BAS）离散化得到二进制离散天牛须算法（BBAS）,并与原始天牛须算法进行混合得出.算法平衡了局部与全局搜索,有效地弥补了算法容易陷入局部最优的不足.为了验证NBAS算法的有效性,将NBAS算法与二维K熵算法结合,提出了一种快速、准确的NBAS-K熵图像分割算法.该方法解决了优化图像阈值分割函数的优化算法易陷入局部最优、算法寻优个体数多、设计复杂度高所导致的计算量大、耗时长等问题.NBAS-K熵算法与BAS-K熵算法、BBAS-K熵算法、遗传K熵算法（GA-K熵）、粒子群K熵算法（PSO-K熵）和蚱蜢K熵算法（GOA-K熵）在Berkeley数据集、人工加噪图像以及遥感图像上的实验结果表明,该分割方法不仅具有较好的抗噪性能,而且具有较高的精度和鲁棒性,能够较为有效地实现复杂图像分割.     

A Self-Adapting and Efficient Dandelion Algorithm and Its Application to Feature Selection for Credit Card Fraud Detection

A dandelion algorithm (DA) is a recently developed intelligent optimization algorithm for function optimization problems. Many of its parameters need to be set by experience in DA, which might not be appropriate for all optimization problems. A self-adapting and efficient dandelion algorithm is proposed in this work to lower the number of DA’s parameters and simplify DA’s structure. Only the normal sowing operator is retained; while the other operators are discarded. An adaptive seeding radius strategy is designed for the core dandelion. The results show that the proposed algorithm achieves better performance on the standard test functions with less time consumption than its competitive peers. In addition, the proposed algorithm is applied to feature selection for credit card fraud detection (CCFD), and the results indicate that it can obtain higher classification and detection performance than the-state-of-the-art methods.

     

基于边缘约束局部区域MRF的图像分割方法

针对常规马尔科夫随机场（MRF）模型对复杂自然图像分割时,存在对噪声敏感且边缘模糊的问题,构建一种基于边缘约束局部区域MRF（ECLRMRF）的图像分割模型。利用欧氏距离度量局部区域内邻接像素的相似度,依据其相似度构建局部空间来约束高斯混合模型,有效描述丰富的局部区域统计特征,并建立MRF模型的局部区域一致性约束项。利用Canny边缘检测算子提取图像的边缘特征,并在分割过程中建立图像分割区域的边缘约束,通过在MRF模型框架下将局部区域统计特征和图像边缘特征相融合,解决局部区域MRF模型对图像分割边缘模糊的问题,再采用Gibbs采样算法实现对复杂自然图像的准确分割。实验结果表明,该模型能够更好地保留图像边缘信息,并且具有更好的分割效果。     

基于人工蜂群与模糊C均值的自适应小波变换的噪声图像分割

针对传统模糊C均值（FCM）聚类算法在处理噪声图像时易受到噪声影响的问题,提出了基于FCM的小波域特征增强的噪声图像分割方法。首先,将噪声图像进行二维小波分解;其次,对近似系数进行边缘增强,同时利用人工蜂群（ABC）优化算法对细节系数进行阈值处理,并将处理后的系数进行小波重构;最后,对重构后的图片使用FCM算法来进行图像分割。选取5幅典型的灰度图像,分别添加高斯噪声和椒盐噪声,使用多种方法进行分割,以分割后图像的峰值信噪比（PSNR）和误分率（ME）作为性能指标,实验结果表明,所提方法分割后的图片相较于传统FCM聚类算法分割方法和粒子群优化（PSO）分割方法分割后的图片在PSNR上最多分别有281%和54%的提升,在ME上最多分别有55%和41%的降低。可见所提出的分割方法较好地保留了图像边缘纹理信息,其抗噪性能与分割性能得到了提升。     

A wavelet-based Markov random field segmentation model in segmenting microarray experiments

In the present study, an adaptation of the Markov Random Field (MRF) segmentation model, by means of the stationary wavelet transform (SWT), applied to complementary DNA (cDNA) microarray images is proposed (WMRF). A 3-level decomposition scheme of the initial microarray image was performed, followed by a soft thresholding filtering technique. With the inverse process, a Denoised image was created. In addition, by using the Amplitudes of the filtered wavelet Horizontal and Vertical images at each level, three different Magnitudes were formed. These images were combined with the Denoised one to create the proposed SMRF segmentation model. For numerical evaluation of the segmentation accuracy, the segmentation matching factor (SMF), the Coefficient of Determination (r²), and the concordance correlation (p_c) were calculated on the simulated images. In addition, the SMRF performance was contrasted to the Fuzzy C Means (FCM), Gaussian Mixture Models (GMM), Fuzzy GMM (FGMM), and the conventional MRF techniques. Indirect accuracy performances were also tested on the experimental images by means of the Mean Absolute Error (MAE) and the Coefficient of Variation (CV). In the latter case, SPOT and SCANALYZE software results were also tested. In the former case, SMRF attained the best SMF, r², and p_c (92.66%, 0.923, and 0.88, respectively) scores, whereas, in the latter case scored MAE and CV, 497 and 0.88, respectively. The results and support the performance superiority of the SMRF algorithm in segmenting cDNA images.     

A fast technique for image segmentation based on two Meta-heuristic algorithms

Image segmentation is a primary task in image processing which is widely used in object detection and recognition. Multilevel thresholding is one of the prominent technique in the field of image segmentation. However, the computational cost of multilevel thresholding increases exponentially as the number of threshold value increases, which leads to use of meta-heuristic optimization to find the optimal number of threshold. To overcome this problem, this paper investigates the ability of two nature-inspired algorithms namely: antlion optimisation (ALO) and multiverse optimization (MVO). ALO is a population-based method and mimics the hunting behaviour of antlions in nature. Whereas, MVO is based on the multiverse theory which depicts that there is over one universe exist. These two metaheuristic algorithms are used to find the optimal threshold values using Kapur’s entropy and Otsu’s between class variance function. They examine the outcomes of the proposed algorithm with other evolutionary algorithms based on cost value, stability analysis, feature similarity index (FSIM), structural similarity index (SSIM), peak signal to noise ratio (PSNR), computational time. We also provide Wilcoxon test which justify the response of these parameters. The experimental results showed that the proposed algorithm gives better results than other existing methods. It is noticed that MVO is faster than other algorithms. The proposed method is also tested on medical images to detect the tumor from MRI T1-weighted contrast-enhanced brain images.

     

结合MRF能量和模糊速度的乳腺癌图像分割方法

乳腺癌灶的精确分割是乳腺癌计算机辅助诊断的重要前提. 在动态对比增强核磁共振成像(Dynamic contrast-enhanced magnetic resonance imaging, DCE-MRI)的图像中, 乳腺癌灶具有对比度低、边界模糊及亮度不均匀等特点, 传统的活动轮廓模型方法很难取得准确的分割结果. 本文提出一种结合马尔科夫随机场(Markov random field, MRF)能量和模糊速度函数的活动轮廓模型的半自动分割方法来完成乳腺癌灶的分割, 相对于专业医生的手动分割, 本文方法具有速度快、可重复性高和分割结果相对客观等优点. 首先, 计算乳腺DCE-MRI图像的MRF能量, 以增强目标区域与周围背景的差异. 其次, 在能量图中计算每个像素点的后验概率, 建立基于后验概率驱动的活动轮廓模型区域项. 最后, 结合Gabor纹理特征、DCE-MRI时域特征和灰度特征构建模糊速度函数, 将其引入到活动轮廓模型中作为边缘检测项. 在乳腺癌灶边界处, 该速度函数趋向于零, 活动轮廓曲线停止演变, 完成对乳腺癌灶的分割. 实验结果表明, 所提出的方法有助于乳腺癌灶在DCE-MRI图像中的准确分割.