首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到18条相似文献,搜索用时 62 毫秒
1.
一种基于亮度均衡化的图像阈值分割算法被提出.该算法将冰凌图像亮度数据均衡化,以类间方差最大为标准,求得最佳阈值,并将冰凌图像转化为二值图像,通过冰凌像素统计,最终确定冰凌密度.该算法被应用于黄河河道冰凌图像密度的计算中,取得较好的效果.  相似文献   

2.
故障树计算的一种新方法   总被引:1,自引:0,他引:1  
本文提出的顶事件发生概率的算法不借助割集,直接采用自顶向下的技术对故障树进行分割求解。该算法的时间和内存耗用与故障树的节点数目没有必然联系,而仅仅取决于故障树中不同的重复事件的个数。  相似文献   

3.
图像分割技术在图像分析和图像识别上具有重要意义.传统自适应遗传算法有可能使问题求解陷入局部最优解,而求得错误的图像分割阈值.为了得到最优的图像分割阈值,对交叉率和变异率公式进行了重构,使得交叉率和变异率在任何情况下都不为零.同时,以最大二维熵函数作为适应度函数,采用选择、交叉变异等遗传操作作搜索最优分割阈值.仿真实验表明,该方法可以有效地提高图像分割精度和计算速度.  相似文献   

4.
赵在新  成礼智 《计算数学》2011,33(1):103-112
从具有全局最优解的几何活动轮廓方法出发,分别提出了两种基于齐次Besov窄间与小波变换的图像分割算法,并给出了解的存在性证明.数值求解利用小波软阈值以及分裂Bregman方法,能够有效提高计算效率.由于小波变换具有多分辨特性,对于包含较多细节信息的图像,采用新算法能够得到更好的分割效果.数值实验表明采用新算法能够获得较...  相似文献   

5.
鉴于图像增强技术在生活应用中的重要性,模糊技术在图像应用中的实用性和广泛性,提出了一种基于三角隶属函数和模糊熵的新的图像增强算法(T-FE增强算法),使用三角函数作为隶属函数,重构参数型对比增强算子,运用模糊熵最大原则选取阈值,计算快速,简单.并且将T-FE算法运用于图像分割,边缘检测.通过实验仿真表明,T-FE算法在进行图像处理时有较好效果.  相似文献   

6.
首先对手部软组织的红外热像图进行图像处理,包括灰度化、降噪、增强、分割,其中图像分割采用Otsu算法选择适当的阈值,从而将目标图像与背景分割.然后将处理后图像的像素值代入K-L变换,得到样本的特征空间,将所有样本都投影到该特征空间得到投影系数.最后利用欧式距离公式,最终判断手部软组织的病变情况.  相似文献   

7.
针对模糊C均值算法用于图像分割时对初始值敏感、容易陷入局部极值的问题,提出基于混合单纯形算法的模糊均值图像分割算法.算法利用Nelder-Mead单纯形算法计算量小、搜索速度快和粒子群算法自适应能力强、具有较好的全局搜索能力的特点,将混合单纯形算法的结果作为模糊C均值算法的输入,并将其用于图像分割.实验结果表明:基于混合单纯形算法的模糊均值图像分割算法在改善图像分割质量的同时,提高了算法的运行速度.  相似文献   

8.
图像分割就是把感兴趣的区域从背景中分割、提取出来,为了使分割出来的图像特征信息完整,根据图像的灰度值和空间距离构造了一种相似度函数,得到基于图的灰度值的相似度矩阵,将图像分割转化为图论最小割问题,然后运用谱聚类算法进行分割.针对谱聚类算法运行所需的内存空间和运算量大的特点,提出一种考虑概率因素的随机抽样谱聚类算法.在具体实施时,为了减少背景噪声对分割结果的影响,对图像进行了滤波预处理.结果表明,算法稳定性好,相对现有算法,分割效果得到改善.  相似文献   

9.
本文研究了基于分水岭方法的图像分割问题.利用最大熵算法,对梯度图像进行校正.数值实验结果表明,本文提出的分割算法获得了良好的图像分割效果.  相似文献   

10.
本文研究了基于水平集的图像分割的问题.利用小波变换的方法,构造出图像边缘刻画函数,引入到LBF水平集分割变分模型中,获得了基于小波变换的WLBF模型,同时给出了WLBF模型的数值求解算法.针对不同情景下的典型灰度图像,给出了图像分割实例,推广了LBF模型及算法,实验结果证明WLBF模型及算法对图像分割的有效性.  相似文献   

11.
A multilevel image thresholding using the honey bee mating optimization   总被引:1,自引:0,他引:1  
Image thresholding is an important technique for image processing and pattern recognition. Many thresholding techniques have been proposed in the literature. Among them, the maximum entropy thresholding (MET) has been widely applied. In this paper, a new multilevel MET algorithm based on the technology of the honey bee mating optimization (HBMO) is proposed. This proposed method is called the maximum entropy based honey bee mating optimization thresholding (MEHBMOT) method. Three different methods such as the particle swarm optimization (PSO), the hybrid cooperative-comprehensive learning based PSO algorithm (HCOCLPSO) and the Fast Otsu’s method are also implemented for comparison with the results of the proposed method. The experimental results manifest that the proposed MEHBMOT algorithm can search for multiple thresholds which are very close to the optimal ones examined by the exhaustive search method. In comparison with the other three thresholding methods, the segmentation results using the MEHBMOT algorithm is the best and its computation time is relatively low. Furthermore, the convergence of the MEHBMOT algorithm can rapidly achieve and the results validate that the proposed MEHBMOT algorithm is efficient.  相似文献   

12.
Image segmentation is required as a very important and fundamental operation for significant analysis and interpretation of images. One of the most important applications of segmentation is for facial surgical planning. Thresholding method is so common in image segmentation, because it is simple, noise robustness and accurate. In this paper, we recognize and segment the area of lips using optimal thresholding based on bacterial foraging optimization. New color space (IHLS) is introduced in this paper, that it has good performance in facial image segmentation. In order to evaluate the performance of the proposed algorithm, we use three methods to measure accuracy. The proposed algorithm has less computational complexity and error and it is also efficient.  相似文献   

13.
Thresholding plays an important role in image segmentation and image analysis. In this paper, the normalized histogram of an image is fitted by a linear combined normal distribution functions and each normal distribution function represents a class of pixels, whereas the parameters like the mean, the variance and the weights in the fitting function are undetermined. By transforming the fitting problem into a nonlinear and non-convex optimization problem, the state transition algorithm (STA) which is a new global optimization method is used to choose the optimal parameters of the fitting function. The effectiveness of proposed approach in multilevel thresholding problems is tested by several experimental results. By comparing with OTSU, particle swarm optimization (PSO), genetic algorithm (GA) and differential evolution (DE) algorithm, it has shown that STA has competitive performance in terms of both optimization results and thresholding segmentation.  相似文献   

14.
Over the past decade, various matrix completion algorithms have been developed. Thresholded singular value decomposition (SVD) is a popular technique in implementing many of them. A sizable number of studies have shown its theoretical and empirical excellence, but choosing the right threshold level still remains as a key empirical difficulty. This article proposes a novel matrix completion algorithm which iterates thresholded SVD with theoretically justified and data-dependent values of thresholding parameters. The estimate of the proposed algorithm enjoys the minimax error rate and shows outstanding empirical performances. The thresholding scheme that we use can be viewed as a solution to a nonconvex optimization problem, understanding of whose theoretical convergence guarantee is known to be limited. We investigate this problem by introducing a simpler algorithm, generalized- softImpute, analyzing its convergence behavior, and connecting it to the proposed algorithm.  相似文献   

15.
Journal of Fourier Analysis and Applications - This paper provides analysis for convergence of the singular value thresholding algorithm for solving matrix completion and affine rank minimization...  相似文献   

16.
针对灰狼算法易陷入局部最优、收敛精度不高、收敛速度慢等缺点,提出一种改进的灰狼算法.引入莱维飞行,扩大搜索范围,增强全局搜索能力,避免陷入局部最优;引入贪婪原理,提升种群优良性以提高算法收敛精度;引入自适应收敛因子,加快收敛速度;引入动态权重策略,制约全局搜索与局部搜索的相互影响.将改进算法与其他四种算法作对比,实验表明,改进算法在收敛速度与收敛精度上都有更好的性能.最后,应用于图像多阈值分割中,采用GWO-Otsu法可以克服传统Otsu法在多阈值分割时计算量大,实时性差的特点,不但能够取得最优解,且明显缩减计算时间.  相似文献   

17.
In this paper, we propose a new mean value algorithm for the Toeplitz matrix completion based on the singular value thresholding (SVT) algorithm. The completion matrices generated by the new algorithm keep a feasible Toeplitz structure. Meanwhile, we prove the convergence of the new algorithm under some reasonal conditions. Finally, we show the new algorithm is much more effective than the ALM (augmented Lagrange multiplier) algorithm through numerical experiments and image inpainting.  相似文献   

18.
快速均值漂移图像分割算法研究   总被引:3,自引:0,他引:3  
Mean shift算法是一种搜索与样本点分布最接近模式的非参数统计方法.但它是一种迭代统计方法,要保证较高的数值计算精度需要较多的迭代次数,耗费较长的计算时间.为克服这一缺点,提出快速均值漂移图像分割算法.该算法在每次迭代时以前一次的聚类中心集合T动态地更新样本集S,并通过使用直方图缩小样本点的搜索范围进一步加快算法的收敛速度.实验结果表明该方法在保证图像分割质量的同时具有较快的收敛速度.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号