基于膨胀和腐蚀的迭代优化算法  

An Optimization Algorithm for Delation and Eroison Based on Iterative Calculation

作　　者：蒲石[1] 龙文光[1,2] 

机构地区：[1]内江师范学院现代教育技术中心,四川内江641100 [2]内江师范学院计算机科学学院,四川内江641100

出　　处：《四川师范大学学报（自然科学版）》2014年第3期408-412,共5页Journal of Sichuan Normal University（Natural Science）

基　　金：四川省学术和技术带头人培养基金(12XSJS002);四川省科技厅软科学基金(2013ZR0089)资助项目

摘　　要：有效地优化膨胀和腐蚀操作是目前数学形态学领域中广泛研究但尚未彻底解决的问题之一.提出一种优化的膨胀和腐蚀算法,对于任意简单连接的结构元素,通过引入4个概念定义其边界,并且提出一个辅助算法检测这4种边界.在此基础上,得到3个迭代公式,将膨胀和腐蚀重定义为迭代计算,改进后的优化算法时间复杂度为O(n3).此外,因为不用进行结构元素的分解,优化算法适合在线应用.仿真结果表明,在相同参数情况下,新算法的性能优于Yang等提出的算法.Effectively optimizing dilation and erosion are extensively studied but not completely resolved problem.In this paper,a new optimization algorithm was proposed to improve the efficiency of dilation and erosion.Four notions were given to define the edges for any simply connected structuring element （SE）.An assistant algorithm was proposed to detect these edges.Based on these notions,three iteration equations could be derived,which redefined dilation and erosion as iteration calculation.Time complexity of the new algorithm was reduced to O（n^3）.In addition,the new algorithm was suitable for online applications without the decomposition of SE.Simulation showed that with the same parameters,the performance of the new algorithm was better than that of Yang＇ s algorithm.

关 键 词：膨胀 腐蚀 优化 迭代算法 时间复杂度分析 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]