基于改进雁群算法的Otsu多阈值图像分割

阈值分割是一种被广泛应用的图像分割技术。然而,传统的最大类间方差法(Otsu算法)在多阈值图像分割中面临着计算复杂度高、执行时间长及分割准确性不够等挑战。针对这些现象,提出一种基于改进雁群优化算法(CBLSGSO)的Otsu多阈值图像分割算法,该算法将Cubic混沌映射模型嵌入雁群算法初始化过程中,提高种群的多样性;提出多区域引导式结构,对种群动态切分并设计不同的进化机制,扩大种群寻优范围;引入自适应正余弦策略和蝴蝶算法搜索策略,提高算法的收敛精度,有效地平衡了算法的全局寻优能力和局部寻优能力。为验证改进后Otsu算法性能,选取ACC、Jaccard、Specificity、F1-score、FSIM、SSIM和PSNR等指标作为评价指标,并与近年来不同学者提出的图像分割算法进行实验对比,验证了算法的有效性。实验结果表明,基于改进雁群算法的Otsu图像分割法能更快速精确地解决复杂图像分割问题。

基于改进LOG算子与Otsu算法结合的物体表面图像残损检测方法

针对物体表面残损区域存在明显的亮缺陷和不明显的暗缺陷这一特性,构建一种基于改进LOG算子与Otsu算法相结合的物体表面残损区域缺陷的边缘检测方法。首先,针对传统的LOG算子在检测图像亮缺陷边缘时检测结果不准确的问题,引入可根据图像特性自动调整模糊因子的Wiener滤波代替传统LOG算子中的高斯滤波,以提高图像亮缺陷检测的精度;其次,针对检测图像暗缺陷边缘时结果不准确的问题,使用Otsu算法分析图像暗缺陷的灰度直方图来自动确定阈值,以提升暗缺陷边缘检测准确率;最后,采用像素加权平均融合算法对检测出的物体表面图像亮、暗缺陷边缘进行融合,以实现物体表面残损缺陷检测。实验结果表明:相较于单独使用改进的LOG算子和Otsu算法,采用加权融合的方法检测到的缺陷像素点数量与原始图片中基本一致,能够更准确地对图像中物体表面残损区域的亮、暗缺陷边缘进行检测。

改进沙猫群优化算法的2D-OTSU多阈值图像分割

针对传统多级阈值图像分割方法精度低、收敛速度慢的问题,提出一种改进的沙猫群优化算法(Improved Sand Cat Swarm Optimization, ISCSO)用于全局优化,并应用于2D-OTSU多阈值图像分割任务。通过使用Henon混沌映射和反向折射机制初始化种群,使得种群的分布更加均匀,提高搜索的起始状态,从而增加算法的全局搜索能力;采用非线性灵敏度更新公式来平衡搜索多样性和收敛精度;引入可变螺旋搜索策略改进位置更新算法,以确保算法具有较好的搜索多样性和跳出局部最优解的能力。选取6张测试图像对ISCSO算法进行2DOTSU多阈值图像分割实验,采用峰值信噪比(PSNR)、特征相似性指数(FSIM)和结构相似性指数(SSIM)对实验结果进行评价。实验结果表明,基于ISCSO算法的2D-OSTU多阈值图像分割方法在图像分割任务中85.2%的结果优于对比算法,具有较强的搜索精度和收敛速度,这证明了ISCSO算法在图像分割领域的有效性和潜力。

Dynamic threshold for SPWVD parameter estimation based on Otsu algorithm

Time-frequency-based methods are proven to be effective for parameter estimation of linear frequency modulation （LFM） signals. The smoothed pseudo Winger-Ville distribution （SPWVD） is used for the parameter estimation of multi-LFM signals, and a method of the SPWVD binarization by a dynamic threshold based on the Otsu algorithm is proposed. The proposed method is effective in the demand for the estimation of different parameters and the unknown signal-to-noise ratio （SNR） circumstance. The performance of this method is confirmed by numerical simulation.

Image Segmentation of Brain MR Images Using Otsu’s Based Hybrid WCMFO Algorithm

In this study,a novel hybrid Water Cycle Moth-Flame Optimization(WCMFO)algorithm is proposed for multilevel thresholding brain image segmentation in Magnetic Resonance(MR)image slices.WCMFO constitutes a hybrid between the two techniques,comprising the water cycle and moth-flame optimization algorithms.The optimal thresholds are obtained by maximizing the between class variance(Otsu’s function)of the image.To test the performance of threshold searching process,the proposed algorithm has been evaluated on standard benchmark of ten axial T2-weighted brain MR images for image segmentation.The experimental outcomes infer that it produces better optimal threshold values at a greater and quicker convergence rate.In contrast to other state-of-the-art methods,namely Adaptive Wind Driven Optimization(AWDO),Adaptive Bacterial Foraging(ABF)and Particle Swarm Optimization(PSO),the proposed algorithm has been found to be better at producing the best objective function,Peak Signal-to-Noise Ratio(PSNR),Standard Deviation(STD)and lower computational time values.Further,it was observed thatthe segmented image gives greater detail when the threshold level increases.Moreover,the statistical test result confirms that the best and mean values are almost zero and the average difference between best and mean value 1.86 is obtained through the 30 executions of the proposed algorithm.Thus,these images will lead to better segments of gray,white and cerebrospinal fluid that enable better clinical choices and diagnoses using a proposed algorithm.

Optimizing Connections:Applied Shortest Path Algorithms for MANETs

This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.

Representation of an Integer by a Quadratic Form through the Cornacchia Algorithm

Cornachia’s algorithm can be adapted to the case of the equation x2+dy2=nand even to the case of ax2+bxy+cy2=n. For the sake of completeness, we have given modalities without proofs (the proof in the case of the equation x2+y2=n). Starting from a quadratic form with two variables f(x,y)=ax2+bxy+cy2and n an integer. We have shown that a primitive positive solution (u,v)of the equation f(x,y)=nis admissible if it is obtained in the following way: we take α modulo n such that f(α,1)≡0modn, u is the first of the remainders of Euclid’s algorithm associated with n and α that is less than 4cn/| D |) (possibly α itself) and the equation f(x,y)=n. has an integer solution u in y. At the end of our work, it also appears that the Cornacchia algorithm is good for the form n=ax2+bxy+cy2if all the primitive positive integer solutions of the equation f(x,y)=nare admissible, i.e. computable by the algorithmic process.

Time Complexity of the Oracle Phase in Grover’s Algorithm

Since Grover’s algorithm was first introduced, it has become a category of quantum algorithms that can be applied to many problems through the exploitation of quantum parallelism. The original application was the unstructured search problems with the time complexity of O(). In Grover’s algorithm, the key is Oracle and Amplitude Amplification. In this paper, our purpose is to show through examples that, in general, the time complexity of the Oracle Phase is O(N), not O(1). As a result, the time complexity of Grover’s algorithm is O(N), not O(). As a secondary purpose, we also attempt to restore the time complexity of Grover’s algorithm to its original form, O(), by introducing an O(1) parallel algorithm for unstructured search without repeated items, which will work for most cases. In the worst-case scenarios where the number of repeated items is O(N), the time complexity of the Oracle Phase is still O(N) even after additional preprocessing.

O(logN) Algorithm for Amplitude Amplification and O(logN) Algorithms for Amplitude Transfer in Grover’s Algorithm

Grovers algorithm is a category of quantum algorithms that can be applied to many problems through the exploitation of quantum parallelism. The Amplitude Amplification in Grovers algorithm is T = O(N). This paper introduces two new algorithms for Amplitude Amplification in Grovers algorithm with a time complexity of T = O(logN), aiming to improve efficiency in quantum computing. The difference between Grovers algorithm and our first algorithm is that the Amplitude Amplification ratio in Grovers algorithm is an arithmetic series and ours, a geometric one. Because our Amplitude Amplification ratios converge much faster, the time complexity is improved significantly. In our second algorithm, we introduced a new concept, Amplitude Transfer where the marked state is transferred to a new set of qubits such that the new qubit state is an eigenstate of measurable variables. When the new qubit quantum state is measured, with high probability, the correct solution will be obtained.

The Study of Otsu Algorithm Applied in the Measuring of Ash Proportion

To further improve the boiler ash ratio detection methods and resource utilization, through image processing technology for boiler ash ratio analysis, the article first studied the one-dimensional Otsu algorithm, and then for the one-dimensional Otsu algorithm, in order to improve the accuracy of the algorithm, then it puts forward a two-dimensional Otsu algorithm. Finally the two-dimensional Otsu algorithm combined with the one-dimensional Otsu algorithm and the improved Otsu algorithm. By analyzing the improved Otsu algorithm, this paper considers the pixel gray value, neighborhood information, excluding light, noise and the relative efficiency of one-dimensional Otsu algorithm higher accuracy. The relative dimensional Otsu algorithm operating efficiency has been greatly improved. Improved Otsu algorithm in dealing with boiler ash ratio detection has played a very good part in the ecological environment, economic development and some other important aspects.

三维直方图重建和降维的Otsu阈值分割算法

针对三维Otsu阈值分割算法中因区域误分而产生的抗噪性差这一问题,提出了一种三维直方图重建和降维的Otsu阈值分割算法.该方法首先在详细分析三维直方图中噪声点分布的基础上,通过重建三维直方图,减弱了噪声干扰;然后将三维直方图区域划分由八分法改为二分法,使得阈值搜索的空间维度从三维降低到一维,减少了处理时间和存储空间.本文最后给出了算法的分割结果和运行时间,并与三维Otsu方法、二维分解法和二维斜分法进行对比.实验结果表明,本文算法的抗噪性更强,且分割效果更为理想,同时时间复杂度也远低于三维Otsu法.

Otsu算法在Canny算子中的应用

Canny算子应用于细胞图像分割,只要选择适当的参数就可以取得好的分割效果。在分析细胞图像直方图后,利用类间方差最大化阈值分割算法(Otsu)可以实现Canny算子中门限值的自适应选择。试验结果表明,Otsu算法应用于Canny算子中的门限选择,改善了算法在细胞图像中的分割效果,提高了算法的自适应性能。

Defect image segmentation using multilevel thresholding based on firefly algorithm with opposition-learning

To segment defects from the quad flat non-lead QFN package surface a multilevel Otsu thresholding method based on the firefly algorithm with opposition-learning is proposed. First the Otsu thresholding algorithm is expanded to a multilevel Otsu thresholding algorithm. Secondly a firefly algorithm with opposition-learning OFA is proposed.In the OFA opposite fireflies are generated to increase the diversity of the fireflies and improve the global search ability. Thirdly the OFA is applied to searching multilevel thresholds for image segmentation. Finally the proposed method is implemented to segment the QFN images with defects and the results are compared with three methods i.e. the exhaustive search method the multilevel Otsu thresholding method based on particle swarm optimization and the multilevel Otsu thresholding method based on the firefly algorithm. Experimental results show that the proposed method can segment QFN surface defects images more efficiently and at a greater speed than that of the other three methods.

基于边缘检测与Otsu的图像分割算法研究

Otsu算法作为图像分割领域的经典算法得到了广泛的应用,在其基础上发展起来的2维Otsu算法由于运算时间长、抗噪能力差,应用受到限制。为此,提出一种改进的Otsu算法。通过更改2维直方图的区域划分方式,分别运用Sobel,Log和Canny边缘检测算法与直线拟合法相结合,将图像的目标和背景区域限制在一对平行于对角线的界线内,使用噪声点的邻域均值代替其灰度值,利用2维Otsu斜分法将目标从背景中分割出来。实验结果表明,与传统2维Otsu算法及其改进算法相比,该算法不仅运算时间较短,而且具有较好的分割质量、抗噪性能和自适应能力。

基于积分图像的快速二维Otsu算法

Otsu自适应阈值算法是图像分割的经典方法之一,在其基础上发展起来的二维Otsu阈值算法却因为计算复杂而制约了其应用。本文针对二维Otsu的耗时瓶颈问题,引入积分图像简化了二维直方图最佳阈值搜索过程的计算复杂度,从而大大缩短了算法处理时间。实验结果表明,本文提出的算法在分割效果上与原始算法完全相同,但计算时间远远小于后者,具有很好的实时性。

基于属性直方图的快速Otsu红外目标检测算法

为了提高红外小目标检测的有效性和实时性,提出了一种改进的二维Otsu算法。该算法运用了属性直方图的概念,通过构造适合红外小目标图像特性的属性集,来确定Otsu算法的最佳分割阈值。为了减小计算复杂度,从推导递推关系式和缩小搜索范围两方面,给出了快速算法。在数学形态学Top-Hat变换对原始红外图像进行背景抑制的基础上,利用本文提出的改进算法在含有噪声的背景抑制图中分割出候选的目标点,并和其他目标分割方法进行比较,实验结果证明了这种方法的抗干扰性更好、时效性更高。

基于改进Otsu算法的生猪热红外图像耳根特征区域检测

为研究规模化生猪养殖场中非接触式体温检测方法,以自行设计的热红外图像采集器采集生猪图像,选取HSV颜色空间对图像进行变换,生成S层图像,应用形态学特征闭运算对二值化图像去噪。用改进后的Otsu算法,分别对仔猪、育肥猪和妊娠猪图像耳根特征区域进行检测。结果表明,该方法可以100%正确检测具有完整耳根部特征的仔猪、育肥猪、妊娠猪图像;对于耳根部特征不完整的仔猪图像23%可正确进行检测,育肥猪图像25%可正确进行检测,妊娠猪图像33%可正确进行检测;无法检测不具有耳根部特征的图像。

改进的Otsu算法在图像分割中的应用

针对二维Otsu自适应阈值算法计算复杂度高的问题,提出一种新的快速有效的Otsu图像分割改进算法。该算法通过求两个一维Otsu法的阈值来代替传统的二维Otsu法的分割阈值,使得分割的计算复杂度从O(L4)降到O(L)。为保证分割对象的完整性,算法引入类内最小离散度的概念,并通过遗传算法实现对参数的自动优化。理论分析和实验结果表明本算法计算速度不仅优于原二维Otsu算法,而且分割效果较好。

扩展的Otsu最优阈值图像分割的实现方法

基于付忠良等人提出的扩展的Otsu最优阈值图像分割方法,提出了遗传算法的解决方案,并给出了遗传算法中基本参数的设定.基于图像的像素方差信息,利用遗传算法全局搜索图像的单阈值和双阈值,这样不但缩短了计算时间,而且具有遗传算法鲁棒性和自适应的特点,比传统的Otsu方法有明显的优点.

基于并行遗传算法的Otsu双阈值医学图像分割

传统遗传算法用于搜索某些函数极值时精确度较低且稳定性较差。针对该问题,提出了一种基于并行遗传算法的Otsu双阈值医学图像分割算法。在该算法中,进化在多个不同的子群中并行进行,避免单种群进化过程中出现的过早收敛现象,提高整个算法的收敛速度。100次阈值计算实验结果表明,提出的分割算法与传统遗传算法相比,不仅能够对图像进行准确的分割,而且具有更强的精确性和稳定性。其收敛速度明显优于基于单种群的遗传算法的Otsu双阈值医学图像分割。