检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安邮电学院信息与控制系,陕西西安710061
出 处:《电子学报》2007年第7期1398-1402,共5页Acta Electronica Sinica
基 金:国家自然科学基金(No.60572133)
摘 要:一维和二维Otsu法是常用的阈值分割方法,二维Otsu法对含噪图像的分割效果要优于一维Otsu法,但它存在的问题是"对象区域和背景区域上的概率和近似为1"的假设的普适性不够,鉴于此景晓军等人提出了三维Otsu法及其递归算法,使得对低对比度、低信噪比的图像有较好的分割效果.本文指出了景晓军等人给出的递推公式的错误,并进行了修正.鉴于他们给出的递推公式并不是真正意义的递推公式,本文给出了新的递推公式.实验结果表明,本文提出的递推公式进一步减少了运算时间.另外,本文还指出三维Otsu法对于叠加了混合噪声的图像有较好的分割效果.One-dimensional(1-D) and two-dimensional (2-D)Otsu' s methods are two common thresholding segmentation methods.2-D Otsu' s method is superior to 1-D Otsu' s method for images with noise.A basic assumption for 2-D Otsu' s method is that "the probability sum of the object and background regions is close to 1", this assumption could not be effective in some cases, thus Jing et al.introduced three-dimensional (3-D) Otsu' s method and gave a recursive algorithm.3-D Otsu's method behaves well for images with low SNR and low contrast. In this paper, the mistakes in Jing's recursive formulas are pointed out and a corrected version is given. Because the existed recursive algorithm can not be considered as a real recursive algorithm, we propose a new recursive algorithm. Experimental results show that the computing time of our method is less than that of Jing' s method, in addition we point out that 3-D Otsu's method can obtain better segmentation results for images with mixture noises.
分 类 号:TN911.73[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28