clear;
I=imread('3.tif');
subplot(1,2,1);
imshow(I);
title('原始图像');
Hist=zeros(1,256);
[m,n]=size(I);
for i=1:m
for j=1:n
Hist(I(i,j)+1)=Hist(I(i,j)+1)+1;
end
end
J=zeros(1,9);
x=0;
for k=30:255
x=x+k*Hist(k+1);
end
y=0;
for k=30:255
y=y+Hist(k+1);
end
u=round(x/y);
for i=1:m
for j=1:n
if (u-30)<I(i,j)&&I(i,j)<(u+30)
I(i,j)=255;
else
I(i,j)=0;
end
end
end
subplot(1,2,2);
imshow(I);
title('二值化后的图像');
I=double(I);
for i=2:(m-1)
for j=2:(n-1)
if (I(i-1,j-1)+I(i-1,j)+I(i-1,j+1)+I(i,j-1)+I(i+1,j-1)+I(i+1,j)+I(i+1,j+1)+I(i,j+1))==0
J(1)=J(1)+1;
else
end
end
end
for i=2:(m-1)
for j=2:(n-1)
if (I(i-1,j-1)+I(i-1,j)+I(i-1,j+1)+I(i,j-1)+I(i+1,j-1)+I(i+1,j)+I(i+1,j+1)+I(i,j+1))==255
J(2)=J(2)+1;
else
end
end
end
for i=2:(m-1)
for j=2:(n-1)
if (I(i-1,j-1)+I(i-1,j)+I(i-1,j+1)+I(i,j-1)+I(i+1,j-1)+I(i+1,j)+I(i+1,j+1)+I(i,j+1))==510
J(3)=J(3)+1;
else
end
end
end
for i=2:(m-1)
for j=2:(n-1)
if (I(i-1,j-1)+I(i-1,j)+I(i-1,j+1)+I(i,j-1)+I(i+1,j-1)+I(i+1,j)+I(i+1,j+1)+I(i,j+1))==255*3
J(4)=J(4)+1;
else
end
end
end
for i=2:(m-1)
for j=2:(n-1)
if (I(i-1,j-1)+I(i-1,j)+I(i-1,j+1)+I(i,j-1)+I(i+1,j-1)+I(i+1,j)+I(i+1,j+1)+I(i,j+1))==255*4
J(5)=J(5)+1;
else
end
end
end
for i=2:(m-1)
for j=2:(n-1)
if (I(i-1,j-1)+I(i-1,j)+I(i-1,j+1)+I(i,j-1)+I(i+1,j-1)+I(i+1,j)+I(i+1,j+1)+I(i,j+1))==255*5
J(6)=J(6)+1;
else
end
end
end
for i=2:(m-1)
for j=2:(n-1)
if (I(i-1,j-1)+I(i-1,j)+I(i-1,j+1)+I(i,j-1)+I(i+1,j-1)+I(i+1,j)+I(i+1,j+1)+I(i,j+1))==255*6
J(7)=J(7)+1;
else
end
end
end
for i=2:(m-1)
for j=2:(n-1)
if (I(i-1,j-1)+I(i-1,j)+I(i-1,j+1)+I(i,j-1)+I(i+1,j-1)+I(i+1,j)+I(i+1,j+1)+I(i,j+1))==255*7
J(8)=J(8)+1;
else
end
end
end
for i=2:(m-1)
for j=2:(n-1)
if (I(i-1,j-1)+I(i-1,j)+I(i-1,j+1)+I(i,j-1)+I(i+1,j-1)+I(i+1,j)+I(i+1,j+1)+I(i,j+1))==255*8
J(9)=J(9)+1;
else
end
end
end
feature-selection.rar_feature selection_图像孤立点_提取图像曲线_曲线特征提取_特征 m
版权申诉
65 浏览量
2022-07-14
21:55:31
上传
评论
收藏 24KB RAR 举报
我虽横行却不霸道
- 粉丝: 75
- 资源: 1万+
最新资源
- python-leetcode面试题解之第162题寻找峰值-题解.zip
- python-leetcode面试题解之第161题相隔为1的编辑距离-题解.zip
- python-leetcode面试题解之第160题相交链表-题解.zip
- python-leetcode面试题解之第159题至少包含两个不同字符的最长子串-题解.zip
- python-leetcode面试题解之第158题用Read4读取N个字符II-多次调用-题解.zip
- Python 程序语言设计模式思路-行为型模式:策略模式:将算法封装成独立的类,并使它们可以互相替换及支付模式数据压缩
- main.py
- Last Loaded Test.DBK
- Screenshot_20240520_163011.jpg
- ubuntu-python3-whisper-tornado docker镜像 Dockerfile
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈