C#写的图像细化算法
来源：互联网 发布：手机助手网络共享 编辑：程序博客网 时间：2024/06/16 07:30
自己用C#写的图像细化算法，输入图像为Bitmap类型，输出也是同样的类型，注意<pre name="code" class="csharp">ToThinner(Bitmap srcImg)
中的输入图像srcImg必须为像素0和255的二值化的图像。
public unsafe Bitmap ToThinner(Bitmap srcImg) { int iw = srcImg.Width; int ih = srcImg.Height; bool bModified; //二值图像修改标志 bool bCondition1; //细化条件1标志 bool bCondition2; //细化条件2标志 bool bCondition3; //细化条件3标志 bool bCondition4; //细化条件4标志 int nCount; //5X5像素块 byte[,] neighbour = new byte[5, 5]; //新建临时存储图像 Bitmap NImg = new Bitmap(iw, ih, srcImg.PixelFormat); bModified = true; //细化修改标志, 用作循环条件 BitmapData dstData = srcImg.LockBits(new Rectangle(0, 0, iw, ih), ImageLockMode.ReadWrite, srcImg.PixelFormat); byte* data = (byte*)(dstData.Scan0); //将图像转换为0,1二值得图像; int step = dstData.Stride; for (int i = 0; i < dstData.Height; i++) { for (int j = 0; j < dstData.Width; j++) { if (data[i * step + j] > 128) data[i * step + j] = 0; else data[i * step + j] = 1; } } BitmapData dstData1 = NImg.LockBits(new Rectangle(0, 0, iw, ih), ImageLockMode.ReadWrite, NImg.PixelFormat); byte* data1 = (byte*)(dstData1.Scan0); int step1 = dstData1.Stride; //细化循环开始 while (bModified) { bModified = false; //初始化临时二值图像NImg for (int i = 0; i < dstData1.Height; i++) { for (int j = 0; j < dstData1.Width; j++) { data1[i * step1 + j] = 0; } } for (int i = 2; i < ih - 2; i++) { for (int j = 2; j < iw - 2; j++) { bCondition1 = false; bCondition2 = false; bCondition3 = false; bCondition4 = false; if (data[i * step + j] == 0) //若图像的当前点为白色，则跳过 continue; for (int k = 0; k < 5; k++) { //取以当前点为中心的5X5块 for (int l = 0; l < 5; l++) { //1代表黑色, 0代表白色 //neighbour[k, l] = bw[i + k - 2, j + l - 2]; neighbour[k, l] = data[(i + k - 2) * step + (j + l - 2)]; } } //(1)判断条件2<=n(p)<=6 nCount = neighbour[1, 1] + neighbour[1, 2] + neighbour[1, 3] + neighbour[2, 1] + neighbour[2, 3] + neighbour[3, 1] + neighbour[3, 2] + neighbour[3, 3]; if (nCount >= 2 && nCount <= 6) bCondition1 = true; else { data1[i * step1 + j] = 1; continue; //跳过, 加快速度 } //(2)判断s(p)=1 nCount = 0; if (neighbour[2, 3] == 0 && neighbour[1, 3] == 1) nCount++; if (neighbour[1, 3] == 0 && neighbour[1, 2] == 1) nCount++; if (neighbour[1, 2] == 0 && neighbour[1, 1] == 1) nCount++; if (neighbour[1, 1] == 0 && neighbour[2, 1] == 1) nCount++; if (neighbour[2, 1] == 0 && neighbour[3, 1] == 1) nCount++; if (neighbour[3, 1] == 0 && neighbour[3, 2] == 1) nCount++; if (neighbour[3, 2] == 0 && neighbour[3, 3] == 1) nCount++; if (neighbour[3, 3] == 0 && neighbour[2, 3] == 1) nCount++; if (nCount == 1) bCondition2 = true; else { data1[i * step1 + j] = 1; continue; } //(3)判断p0*p2*p4=0 or s(p2)!=1 if (neighbour[2, 3] * neighbour[1, 2] * neighbour[2, 1] == 0) bCondition3 = true; else { nCount = 0; if (neighbour[0, 2] == 0 && neighbour[0, 1] == 1) nCount++; if (neighbour[0, 1] == 0 && neighbour[1, 1] == 1) nCount++; if (neighbour[1, 1] == 0 && neighbour[2, 1] == 1) nCount++; if (neighbour[2, 1] == 0 && neighbour[2, 2] == 1) nCount++; if (neighbour[2, 2] == 0 && neighbour[2, 3] == 1) nCount++; if (neighbour[2, 3] == 0 && neighbour[1, 3] == 1) nCount++; if (neighbour[1, 3] == 0 && neighbour[0, 3] == 1) nCount++; if (neighbour[0, 3] == 0 && neighbour[0, 2] == 1) nCount++; if (nCount != 1) //s(p2)!=1 bCondition3 = true; else { data1[i * step1 + j] = 1; continue; } } //(4)判断p2*p4*p6=0 or s(p4)!=1 if (neighbour[1, 2] * neighbour[2, 1] * neighbour[3, 2] == 0) bCondition4 = true; else { nCount = 0; if (neighbour[1, 1] == 0 && neighbour[1, 0] == 1) nCount++; if (neighbour[1, 0] == 0 && neighbour[2, 0] == 1) nCount++; if (neighbour[2, 0] == 0 && neighbour[3, 0] == 1) nCount++; if (neighbour[3, 0] == 0 && neighbour[3, 1] == 1) nCount++; if (neighbour[3, 1] == 0 && neighbour[3, 2] == 1) nCount++; if (neighbour[3, 2] == 0 && neighbour[2, 2] == 1) nCount++; if (neighbour[2, 2] == 0 && neighbour[1, 2] == 1) nCount++; if (neighbour[1, 2] == 0 && neighbour[1, 1] == 1) nCount++; if (nCount != 1)//s(p4)!=1 bCondition4 = true; } if (bCondition1 && bCondition2 && bCondition3 && bCondition4) { data1[i * step1 + j] = 0; bModified = true; } else { data1[i * step1 + j] = 1; } } } //将细化了的临时图像bw_tem[w,h]copy到bw[w,h],完成一次细化 for (int i = 2; i < ih - 2; i++) for (int j = 2; j < iw - 2; j++) data[i * step + j] = data1[i * step1 + j]; } for (int i = 2; i < ih - 2; i++) { for (int j = 2; j < iw - 2; j++) { if (data[i * step + j] == 1) data[i * step + j] = 0; else data[i * step + j] = 255; } } srcImg.UnlockBits(dstData); NImg.UnlockBits(dstData1); return (srcImg); }<img src="http://img.blog.csdn.net/20140813102748875?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvbW9vbmxpZ2h0cmFu/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/SouthEast" alt="" />
如上图就是用细化算法细化的图像。
</pre>
0 0
- C#写的图像细化算法
- C#图像细化：Hilditch细化算法
- Matlab的图像细化算法(详细实现)
- [转]灰度图像的腐蚀算法和细化算法（C#代码）
- 灰度图像的腐蚀算法和细化算法（C#代码）
- 图像细化算法
- 图像细化算法大全
- 快速图像细化算法
- JAVA图像细化：Hilditch细化算法
- opencv实现二值图像细化的算法
- opencv实现二值图像细化的算法
- 基于索引表的二值化图像细化算法
- OpenCV实现二值图像细化的算法
- 细化处理（二值图像）Hilditch细化算法
- 图像的细化（源程序）
- 二值图像的细化
- 图像处理之Zhang Suen细化算法
- 图像处理之Zhang Suen细化算法
- Python 最好用的第三方 http 库-Requests介绍
- CSS2.1 特殊性、继承、层叠规则
- Tomcat 数据源配置
- 关于MyEclipse8.5 错误 background indexer crash recovery java.lang.stackoverflowerror
- iOS 各种控件默认高度（图示）
- C#写的图像细化算法
- 设计一个算法将两个字符串合并按字母排序
- realarm Android系统编译后内核无法启动的解决方法
- cppcms以及必要的第三方库 下载
- 图片点击放大,再次点击返回原视图.完美封装,一个类一句代码即可调用.IOS完美实现
- php在apache中运行模式
- Linux shell初步学习笔记
- 关于.net的一些免费课程
- 学习OpenGL（二）应用OpenGL和GLUT制作简单动画
