检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:郭瑞峰[1] 杨柳[1] 彭光宇[1] 袁超峰[1] GUO Ruifeng;YANG Liu;PENG Guangyu;YUAN Chaofeng(School of Mechanical and Electrical Engineering,Xi’an University of Architecture and Technology,Xi’an 710055,China)
机构地区:[1]西安建筑科技大学机电工程学院,陕西西安710055
出 处:《现代电子技术》2017年第20期42-45,48,共5页Modern Electronics Technique
基 金:陕西省工业科技攻关项目(2015GY068)
摘 要:阈值分割是众多图像分割方法中使用最普遍的一种方法,阈值的求解也是图像处理的重心。传统Otsu算法属于穷举式的阈值求解方法,需遍历每个灰度值并计算以其为阈值的类间方差,在此进行了大量不必要的计算,可能无法应用于某些实时性要求较高的环境中。对此提出一种快速的Otsu改进算法,在引入图像复杂度及其相关性质缩小了灰度的搜索范围,同时在搜索范围内使用了一种快速计算方法,较传统Otsu算法进行了二次加速。实验结果证明,该算法较传统Otsu算法提高了计算速度,且两种算法的图像分割结果相同。Threshold segmentation is one of the most commonly used image segmentation methods,and the solution ofthreshold is also the focus of image processing.The traditional Otsu algorithm is an exhaustive threshold solution method,whichneeds to traverse each gray value,calculate the interclass variance taking the gray value as the threshold value,and make alarge number of unnecessary calculations.As a result,the traditional Otsu algorithm may not be appropriate to be applied insome environments with high real?time performance requirements.Therefore,an improved fast Otsu algorithm is proposed.Thehunting scope of the traversed gray was reduced after importing the image complexity and its related properties.A fast calcula?tion method is used in the scope of the traversed gray,which executes secondary acceleration in comparison with the traditionalOtsu algorithm.The experimental results show that this algorithm improves the calculation speed in comparison with the traditionalOtsu algorithm,and the image segmentation results of the two algorithms are the same.
分 类 号:TN911.73-34[电子电信—通信与信息系统] TP391.41[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15