检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]全军后勤信息中心,北京100842 [2]航天员科研训练中心,北京100094
出 处:《微型机与应用》2015年第14期45-47,共3页Microcomputer & Its Applications
摘 要:针对常规二维最佳熵法计算复杂,运行时间长,收敛性差等不足,提出基于改进遗传算法的二维最佳熵阈值分割方法。通过对选择、交叉、变异等因子的优化设计,使阈值搜索的鲁棒性与收敛性有了很大改善,并对图像的分割效果进行评价。分析与仿真结果表明,改进算法在大大减少阈值搜索时间的同时,保持了良好的分割性能。Aiming at the problems of the classical algorithms for solving two-dimensional maximum entropy , such as heavy computational complexity, long running time and poor convergence reliability, a novel method based on improved genetic algorithm is proposed to solve the maximum entropy. The improved selection operator, crossover operator and mutation operator are used to search threshold, which have improved dramatically on the robustness and convergence reliability. Then the image segmentation effect is evaluated. The results show that the improved method greatly saves the search time of threshold, as well as maintains good image segment effect.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222