摘要
最小误差阈值分割法在图像分割中有广泛的应用。本文对二维最小误差阈值法及其快速算法(在这里称为原算法)进行了改进,对原最小误差阈值法的阈值求取公式进行了变形,并采用查表的方法,将二维阈值的求取转化为两个一维阈值的求取,简化了计算,将算法的时间复杂性由O(L2)降到O(L)。本文的实验结果表明该分解算法可以在保证原算法良好抗噪性的前提下,计算阈值所需要的时间更短,利用的空间更小,且该方法可以得到与原算法相同的分割阈值。
As a generalization of one-dimensional minimum-error threshold segmentation method was widely used in image segmentation.In this paper,two-dimensional minimum-error threshold algorithm and its fast algorithm（here referring to the original method） are improved,and threshold acquirement formula of the original minimum-error threshold segmentation method was deformed.By using look-up table method,acquirement of two-dimensional threshold is transformed into that of two one-dimensional threshold,so the calculation is simplified and time complexity is reduced from O（L2） to O（L）.Experimental results show this decomposition algorithm outperforms original algorithm.Without losing the robustness to noise and needing more time and space,it can get the same segmentation threshold as the original method.
出处
《光电工程》
CAS
CSCD
北大核心
2010年第7期107-113,共7页
Opto-Electronic Engineering
基金
自然科学基金资助项目(60875025)
哈尔滨工程大学校基金(002040260746)
关键词
阈值分割
最小误差阈值法
阈值选取
图像分割
threshold segmentation
minimum-error thresholding method
thresholding
image segmentation
