基于改进人工蜂群正余弦优化的红外图像分割方法

针对红外图像背景复杂且分割难度较大等问题,提出了一种改进人工蜂群正余弦优化的红外图像阈值分割方法。首先是将二维Otsu函数作为蜂群算法的适应度函数;其次采用混沌对立的学习方法和差分进化的方法改进了初始化种群和蜜蜂搜索方程;然后利用改进的蜂群算法优化阈值,缩小阈值的搜索区域;最后利用正余弦法计算出全局最优解,该最优解即为分割的最佳阈值。实验结果表明:论文方法与Otsu法、k-means法、区域生长法以及分水岭法相比,图像目标区域分割的平均交并比为84.13,平均准确率为89.18,有效提高了红外图像的分割精度。     

一种基于Levy-人工蜂群的三维Otsu阈值分割算法

针对图像分割过程中三维Otsu算法运算时间长、计算量大的问题,提出了一种基于Levy-人工蜂群算法的三维Otsu阈值分割算法。首先,以像素灰度值-邻域均值-邻域中值的三维类间方差作为人工蜂群算法的适应度函数;其次,采用Levy飞行模式评价像素的适应度,对其种群更新及邻域搜索过程进行优化,以增强其全局搜索能力;最后,利用改进后的算法得到的分割阈值对图像进行分割。仿真实验结果表明,与传统三维Otsu阈值分割算法相比,所提算法能够有效降低图像存储空间,处理时间降低了30.8%,具备更好的抗噪性能,分割效果也更为理想。     

融合改进人工蜂群和K均值聚类的图像分割

针对人工蜂群优化的K均值算法易陷入局部最优、搜索精度不够、分割图像不够细致等问题,本文融合自适应人工蜂群和K均值聚类,提出了一种新的图像分割算法。算法首先利用距离最大最小乘积对种群进行初始化;其次采用自适应搜索参数动态调整邻域搜索范围,使人工蜂群算法快速收敛于全局最优;然后将人工蜂群输出的所有蜜源进行K均值聚类,克服K均值聚类结果对初始聚类中心的依赖,再将聚类划分结果进行Powell局部搜索,加快算法收敛的速度,将得到的新聚类中心更新蜂群中蜜源位置。最后,将本文算法与其他两种同类分割算法进行试验对比。实验结果表明:与其他两种算法相比,本文提出的分割算法在保证运行时间的前提下,分割准确率比其他两种算法分别至少提高了3.5%和4.8%,表现出了较高的分割质量。     

一种新的视网膜血管网络自动分割方法

提出了一种基于脉冲耦合神经网络(PCNN)和分布式遗传算法(DGA)的视网膜血管自动分割方法.首先采用二维高斯匹配滤波器预处理以增强血管,然后采用DGA快速搜索出PCNN的最佳参数设置值并运用PCNN分割出增强图像的血管网络,最后对分割得到的血管网络结合区域连通性特征,采用面积滤波算子滤除噪声,提取出最终的血管网络.通过在国际上公开的Hoover眼底图像库中的实验,结果表明,该方法在血管分支提取和算法有效性方面明显优于Hoover算法,具有较高的临床应用价值.     

A high performance hardware architecture for portable,low-power retinal vessel segmentation

The retina of the human eye and more particularly the retinal blood vasculature can be used in several medical and biometric applications. The use of retinal images in such applications however, is computationally intensive, due to the high complexity of the algorithms used to extract the vessels from the retina. In addition, the emergence of portable biometric authentication applications, as well as onsite biomedical diagnostics raises the need for real-time, power-efficient implementations of such algorithms that can also satisfy the performance and accuracy requirements of portable systems that use retinal images. In an attempt to meet those requirements, this work presents a VLSI implementation of a retina vessel segmentation system while exploring various parameters that affect the power consumption, the accuracy and performance of the system. The proposed design implements an unsupervised vessel segmentation algorithm which utilizes matched filtering with signed integers to enhance the difference between the blood vessels and the rest of the retina. The design accelerates the process of obtaining a binary map of the vessels tree by using parallel processing and efficient resource sharing, achieving real-time performance. The design has been verified on a commercial FPGA platform and exhibits significant performance improvements (up to 90×) when compared to other existing hardware and software implementations, with an overall accuracy of 92.4%. Furthermore, the low power consumption of the proposed VLSI implementation enables the proposed architecture to be used in portable systems, as it achieves an efficient balance between performance, power consumption and accuracy.     

基于改进人工蜂群算法的多阈值红外图像分割

针对传统的多阈值红外图像分割中多阈值选取存在的效率低、计算重复等问题,提出了一种基于改进人工蜂群算法的多阈值红外图像快速分割算法.首先,在阈值选取时引入人工蜂群算法,实现多阈值的选取.然后,针对原始人工蜂群算法存在的收敛速度慢、容易陷入局部最优的缺点,分别从引领蜂搜索、跟随蜂搜索和侦察蜂搜索3个方面进行了改进,使其更快、更准地收敛于最优解.实验表明,相比于原始人工蜂群算法,改进后的算法在精度相同时速度更快,迭代次数相同时结果更接近最优解.该算法能够在保证精度的前提下高效地对红外图像进行多阈值分割,是一种可行的红外图像分割方法.     

基于过渡区提取的视网膜血管分割方法

 针对现有视网膜血管分割方法对于小血管和低对比度血管分割效果差的问题,提出了一种基于过渡区提取的视网膜血管分割方法.该方法首先采用二维高斯匹配滤波预处理以增强血管,然后采用基于最佳熵的方法提取主血管、采用基于分布式遗传算法和Otsu相结合的方法提取过渡区,最后利用区域连通性分析所提取的主血管和过渡区,分割出最终的血管.通过在Hoover眼底图像库中的实验,结果表明该方法在小血管的提取、连通性和有效性方面均优于Hoover算法,另外由于迁移策略的分布式遗传算法的引入,使得算法效率也明显提高.     

线算子引导Gabor小波的视网膜血管分割

视网膜血管自动分割能辅助诊断某些眼底疾病和系统性血管疾病。为了提高血管自动分割的效率,因此提出了一种线算子引导Gabor小波的视网膜血管分割方法。利用线算子检测血管方向的最优匹配角,将其作为Gabor小波变换的旋转角构建4个不同尺度的Gabor小波,并提取4维Gabor小波特征,加上两个线强度和预处理后的图像灰度,构建7维特征向量,采用SVM进行分类。与其他基于Gabor小波的方法相比,本方法只需计算最优匹配角所对应方向的Gabor小波特征,大大降低了多尺度Gabor小波特征提取的计算量,此外线算子特征与Gabor小波特征的良好互补性,有利于提高血管与背景的辨别度。在DRIVE眼底数据库上进行实验,其平均准确率、灵敏度及特异性分别为0. 936 1、0. 823 8及0. 955 4,获得了不错的分割性能。     

病变视网膜图像血管网络的自动分割

现有的视网膜血管分割方法大多只针对正常的视网膜图像进行分割,不能实现对发生病变的视网膜图像的分割.为此,提出了一种新的病变视网膜图像血管网络分割方法.该方法首先采用向量场散度方法获得病变视网膜图像中大部分血管的中心线,然后计算出中心线上各像素点的方向信息并采用改进的定向局部对比度方法检测出中心线两侧的血管像素,最后对获得的血管段末端进行反向外推追踪,分割出最终的血管网络.通过对通用的STARE眼底图像库中所有病变视网膜图像的实验仿真,结果表明本文算法获得了0.9426的ROC曲线面积和0.9502的准确率,算法性能明显优于Hoover算法和Benson等提出的算法.此外,本文算法还克服了Benson算法的局限性,对不同类型的病变视网膜图像都具有较好的鲁棒性.     

Retinal fundus vasculature multilevel segmentation using whale optimization algorithm

The aim was to present a novel automated approach for extracting the vasculature of retinal fundus images. The proposed vasculature extraction method on retinal fundus images consists of two phases: preprocessing phase and segmentation phase. In the first phase, brightness enhancement is applied for the retinal fundus images. For the vessel segmentation phase, a hybrid model of multilevel thresholding along with whale optimization algorithm (WOA) is performed. WOA is used to improve the segmentation accuracy through finding the \(n{-}1\) optimal n-level threshold on the fundus image. To evaluate the accuracy, sensitivity, specificity, accuracy, receiver operating characteristic (ROC) curve analysis measurements are used. The proposed approach achieved an overall accuracy of 97.8%, sensitivity of 88.9%, and specificity of 98.7% for the identification of retinal blood vessels by using a dataset that was collected from Bostan diagnostic center in Fayoum city. The area under the ROC curve reached a value of 0.967. Automated identification of retinal blood vessels based on whale algorithm seems highly successful through a comprehensive optimization process of operational parameters.     

基于改进蜂群优化的图像分割算法

针对图像分割算法各个性能不均衡的问题,提出一种基于蜂群优化与多颜色空间特征提取的图像分割算法.首先,对CIE颜色空间的L分量使用Gabor滤波器提取图像的纹理特征,并且在图像的HSV颜色空间计算图像的局部一致性,共提取图像的7个特征,组成特征向量;然后,本文对蜂群搜索算法进行优化,设计了一个有效的局部搜索算法,使得蜂群可高效地收敛至较优的帕累托最优解;最终,使用改进的蜂群算法对种子区域生长法进行改进与优化,指定种子的最优位置,决定每个种子点一致性准则的最优阈值,并将多准则作为多目标优化的问题,使用蜂群优化搜索帕累托最优解,最终获得分割结果.对比实验结果表明,该分割算法的时间效率、一致性误差以及类内散布度等性能较为均衡,具有较好的实用价值.     

Contextual information enhanced convolutional neural networks for retinal vessel segmentation in color fundus images

Accurate retinal vessel segmentation is a challenging problem in color fundus image analysis. An automatic retinal vessel segmentation system can effectively facilitate clinical diagnosis and ophthalmological research. In general, this problem suffers from various degrees of vessel thickness, perception of details, and contextual feature fusion in technique. For addressing these challenges, a deep learning based method has been proposed and several customized modules have been integrated into the well-known U-net with encoder–decoder architecture, which is widely employed in medical image segmentation. In the network structure, cascaded dilated convolutional modules have been integrated into the intermediate layers, for obtaining larger receptive field and generating denser encoded feature maps. Also, the advantages of the pyramid module with spatial continuity have been taken for multi-thickness perception, detail refinement, and contextual feature fusion. Additionally, the effectiveness of different normalization approaches has been discussed on different datasets with specific properties. Finally, sufficient comparative experiments have been enforced on three retinal vessel segmentation datasets, DRIVE, CHASE_DB1, and the STARE dataset with unhealthy samples. As a result, the proposed method outperforms the work of predecessors and achieves state-of-the-art performance.     

基于多模型融合和区域迭代生长的视网膜血管自动分割

糖尿病视网膜病变是成年人致盲首因,视网膜血管分割是诊断糖尿病视网膜病变的基础.为提高视网膜血管分割准确性,提出一种基于多模型融合和区域迭代生长的视网膜血管自动分割算法.首先,预处理后分别构建数学形态学、匹配滤波器、尺度空间分析、多尺度线检测和神经网络模型初步分割视网膜血管,为减少噪声取五个分割结果的均值作为初步输出.其次,设计掩膜分离渗出物和视盘,将数学形态学模型分割结果替换掩膜白色区域,并融合初步输出生成组合结果.最后,考虑视网膜血管先验知识,对组合结果阈值分割和区域迭代生长后获取最终结果.实验结果表明,该算法分割DRIVE和STARE眼底图像库视网膜血管的检测精度、敏感度和特异性分别为0.9457、0.7843、0.9815以及0.9472、0.7826、0.9803,优于多数经典算法.     

基于RAU-net的视网膜血管图像分割

在眼科疾病的诊断中,对视网膜血管进行分割是非常有效的一种方法。在方法使用中,经常会遇到由于视网膜血管背景对比度低及血管末梢细节复杂导致的血管分割难度较大的问题,通过在设计网络的过程中在基础U-net网络中引入残差学习,注意力机制等模块,并将两者巧妙地结合在一起,提出一种新型的基于U-net的RAU-net视网膜血管图像分割算法。首先,在网络的编码器阶段加入残差模块,解决了模型网络加深导致梯度爆炸以及梯度消失的问题。其次,在网络的解码器阶段引入注意力门（attention gate, AU）模块,用来抑制不必要的特征,从而使模型产生更高的精度。通过在DRIVE数据集上进行验证,该算法的准确率、灵敏度、特异性和F₁-score分别达到了0.7832,0.9815,0.9568和0.8192。分割效果相对于普通监督学习算法较为良好。     

改进人工蜂群算法在数字图像相关中的应用

针对人工蜂群算法存在的收敛速度较慢,易陷入局部最优解的问题,提出一种改进的人工蜂群优化算法,并应用于数字图像相关的整像素位移搜索中。该算法借助相关度值的变化来动态调整跟随蜂的搜索步长,平衡其全局和局部的搜索能力;侦察蜂利用遗传算法的交叉运算产生新解,改善全局搜索能力。实验结果表明,改进的算法能有效地提高收敛速度,改善整像素位移搜索的性能。     

Optimal Node Clustering and Scheduling in Wireless Sensor Networks

Selection and rotation of cluster head (CH) is a well known optimization problem in hierarchical Wireless sensor networks (WSNs), which affects its overall network performance. Population-based metaheuristic particularly Artificial bee colony (ABC) has shown to be competitive over other metaheuristics for solving optimization problems in WSNs. However, its search equation contributes to its insufficiency due to poor exploitation phase and low convergence rate. This paper, presents an improved artificial bee colony (iABC) metaheuristic with an improved search equation, which will be able to search an optimal solution to improve its exploitation capabilities moreover, in order to increase the global convergence of the proposed metaheuristic, an improved approach for population sampling is introduced through Student’s-t distribution. The proposed metaheuristic maintain a balance between exploration and exploitation search abilities with least memory requirements, with the use of first of its kind compact Student’s-t distribution, which is particularly suitable for WSNs limited hardware environment. Further utilising the capabilities of the proposed metaheuristic, an improved artificial bee colony based clustering and scheduling (iABC-CS) scheme is introduced, to obtain optimal cluster heads (CHs) along with optimal CH scheduling in WSNs. Simulation results manifest that iABC-CS outperform over other well known clustering algorithms on the basis of packet delivery ratio, energy consumption, network lifetime and end to end delay.     

基于血管分割的视网膜图像无参考质量评价方法

为了研究不同失真类型和不同失真程度对血管分割 的影 响,本文将图像的失真类型和失真程度量化为图像血管分割精确度,由于现有公开库中包含 血管分割标签 的图像中均为低失真甚至无失真图像,因此本文构建了一个视网膜失真图像数据库,共包含 2种失真类型, 每种失真类型的图像均有8个等级的失真程度,共552幅视网膜失真图像,并将每幅失真图 像对应的血管 分割精确度作为该图像的标签。此外,本文提出了一种基于血管分割方法的视网膜图像无参 考质量评价方 法,通过提取视网膜图像的像素值统计特征、图像纹理特征以及血管形状特征得到最终视网 膜图像的质量。 在提出的数据库上测试结果显示,皮尔逊线性相关系数值高于0.96, 斯皮尔曼等级相关系数值高于0.95。 与现有评价方法相比,该方法优于传统的无参考评价方法,更能够客观的反映不同失真图像 对血管分割这一应用的影响。     

基于差分变异算子的改进人工蜂群算法

文章针对传统人工蜂群算法收敛速度慢、精度不高的问题,基于差分进化算法中的变异算子,对人工蜂群算法搜索方程进行改进,在种群更新过程中引入当前种群最优个体信息,以提升算法的收敛速度和局部优化能力。     

Cluster based wireless sensor network routing using artificial bee colony algorithm

Due to recent advances in wireless communication technologies, there has been a rapid growth in wireless sensor networks research during the past few decades. Many novel architectures, protocols, algorithms, and applications have been proposed and implemented. The efficiency of these networks is highly dependent on routing protocols directly affecting the network life-time. Clustering is one of the most popular techniques preferred in routing operations. In this paper, a novel energy efficient clustering mechanism, based on artificial bee colony algorithm, is presented to prolong the network life-time. Artificial bee colony algorithm, simulating the intelligent foraging behavior of honey bee swarms, has been successfully used in clustering techniques. The performance of the proposed approach is compared with protocols based on LEACH and particle swarm optimization, which are studied in several routing applications. The results of the experiments show that the artificial bee colony algorithm based clustering can successfully be applied to WSN routing protocols.     

Multi-objective fractional artificial bee colony algorithm to energy aware routing protocol in wireless sensor network

Due to the promising application of collecting information from remote or inaccessible location, wireless sensor networks pose big challenge for data routing to maximize the communication with more energy efficient. Literature presents different cluster-based energy aware routing protocol for maximizing the life time of sensor nodes. Accordingly, an energy efficient clustering mechanism, based on artificial bee colony algorithm and factional calculus is proposed in this paper to maximize the network energy and life time of nodes by optimally selecting cluster-head. The hybrid optimization algorithm called, multi-objective fractional artificial bee colony is developed to control the convergence rate of ABC with the newly designed fitness function which considered three objectives like, energy consumption, distance travelled and delays to minimize the overall objective. The performance of the proposed FABC-based cluster head selection is compared with LEACH, PSO and ABC-based routing using life time, and energy. The results proved that the proposed FABC maximizes the energy as well as life time of nodes as compared with existing protocols.