二维Otsu法的降维递推综合改进算法  

Improved Dimensionality Reduction Recursive Algorithm for 2D Otsu Algorithm

作　　者：张智丰[1] 关坤[1] 金文标[1] 刘庆民[2] 

机构地区：[1]杭州电子科技大学理学院,浙江杭州310018 [2]杭州电子科技大学机械工程学院,浙江杭州310018

出　　处：《杭州电子科技大学学报（自然科学版）》2014年第6期18-22,共5页Journal of Hangzhou Dianzi University：Natural Sciences

基　　金：国家自然科学基金资助项目(61370166);浙江省自然科学基金资助项目(LY13E050026)

摘　　要：二维Otsu法是一种经典的图像分割算法,在其基础上发展的降维算法由于存在大量冗余计算限制了其实际应用,针对这一问题,提出二维Otsu法的降维递推综合改进算法。先把二维阈值形式降低到一维,计算区域改为对角线两侧的带形区域;然后采用递推思想给出递推公式,应用递推公式得到图像分割阈值,去除了原有的冗余计算。结合降维与递推,时间复杂度由降维算法的O(L3)降低为O(L2)。实验结果表明,该种算法在保证分割效果的同时大大提高了降维算法的计算效率。Two-dimensional Otsu algorithm is widely used in classic image segmentation. The dimensionality reduction algorithm derived from the Otsu algorithm limits its application due to a large number of redundant computations. In order to solve this problem, there comes into being an improved dimensionality reduction recursive synthesis algorithm based on the 2D Otsu method. This algorithm reduces the 2D threshold form to 1D and improves calculation regions on both sides of the diagonal band-shaped area, after that, the recursion formula can be deduced according to the reeursive thought, which gets rid of the original redundant computation. Through the ingenious combination of dimensionality reduction and recursive thoughts, the algorithm time complexity is reduced from O （L3） of dimensionality reduction algorithm to O （L2）, Experimental results show that this improved algorithm can save a great deal of running time as well as enhance the computational efficiency of the dimensionality reduction algorithm.

关 键 词：二维大津法 递推 降维 图像分割 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]