文件名称:diedaifa
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:648byte
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
迭代法求阈值的原理:
基于逼近的思想,步骤如下:
1. 求出图象的最大灰度值和最小灰度值,分别记为ZMAX和ZMIN,令初始阈值T0=(ZMAX+ZMIN)/2;
2. 根据阈值TK将图象分割为前景和背景,分别求出两者的平均灰度值ZO和ZB
3. 求出新阈值TK+1=(ZO+ZB)/2;
4. 若TK=TK+1,则所得即为阈值;否则转2,迭代计算。
- Iteration method threshold principle: based on the ideological approach, the steps are as follows: 1. Images obtained the maximum and minimum gray value of gray value, denoted ZMAX and ZMIN, so that initial threshold value T0 = (ZMAX+ ZMIN)/2 2. TK under the threshold will be divided into foreground and background images were obtained between the average gray value ZO and ZB 3. Calculate the new threshold TK+1 = (ZO+ ZB)/2 4. If TK = TK+1, then the proceeds shall threshold otherwise turn 2 iteration.
基于逼近的思想,步骤如下:
1. 求出图象的最大灰度值和最小灰度值,分别记为ZMAX和ZMIN,令初始阈值T0=(ZMAX+ZMIN)/2;
2. 根据阈值TK将图象分割为前景和背景,分别求出两者的平均灰度值ZO和ZB
3. 求出新阈值TK+1=(ZO+ZB)/2;
4. 若TK=TK+1,则所得即为阈值;否则转2,迭代计算。
- Iteration method threshold principle: based on the ideological approach, the steps are as follows: 1. Images obtained the maximum and minimum gray value of gray value, denoted ZMAX and ZMIN, so that initial threshold value T0 = (ZMAX+ ZMIN)/2 2. TK under the threshold will be divided into foreground and background images were obtained between the average gray value ZO and ZB 3. Calculate the new threshold TK+1 = (ZO+ ZB)/2 4. If TK = TK+1, then the proceeds shall threshold otherwise turn 2 iteration.
相关搜索: foreground
diedaifa
(系统自动生成,下载前可以参看下载内容)
下载文件列表
迭代法.txt
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.