【计算机视觉】【矿泉水瓶水位测量】--Matlab与C++实现

29 篇文章 29 订阅
13 篇文章 1 订阅



对水瓶水位的标定,主要运用二值化与检查对比度的方法:

Matlab程序:

clc;
clear all
I=imread('D:\14.jpg');
G=rgb2gray(I); 
[a,b]=size(G);
G1=histeq(G);
imwrite((G),'14.1.bmp');
%%%%%%%%%%%读取直方图向量
H=imhist(G);
%自编写直方图均衡化
H=H./(a*b);
HH(1)=H(1);
for i=2:1:256
   HH(i)=HH(i-1)+H(i);
end
HH=HH'*255;
HH=round(HH);
for i=1:1:a
    for j=1:1:b
        for k=0:1:255
            if G(i,j)==k
                G(i,j)=HH(k);
            end
        end
    end  
end
imwrite((G),'14.2.bmp');
G=filter2(fspecial('average',2),G);%3×3均值滤波
imwrite((G),'14.3.bmp');
%%%%%%%%%%%%%%%%%%图像2值化
for i=1:1:a
    for j=1:1:b
       if G(i,j)<=25
           G(i,j)=255;
       else
              G(i,j)=0;    
       end
    end
end
imwrite((G),'14.4.bmp');
%%%%%%%%%%%%%%%%%%%判断对比度
i=1;
a1=500;
b1=b-500;
for a=a1:2:b1
    aa(i)=sum(G(a,:))+sum(G(a+1,:));
    i=i+1;
end
%%%%%%%%%%%%%%%%%%%相减
i=1;
x=size(aa,2);
for s=1:1:x-1
   aaa(i)=aa(s+1)-aa(s);
   i=i+1; 
end
%%%%%%%%%%%%%%%%%%%找寻对比度最大处
aaa=abs(aaa);
x=find(aaa==max(aaa));
xx=2*x+500;
%%%%%%%%%%%%%%%%%%%找寻精确水位处(暂时隐藏)
I(xx-15:xx+15,:,2:3)=0;
imshow(I)
imwrite((I),'14.5.bmp');

C++程序

//计算灰度直方图///
int grayCount[256];
for (int a = 0; a < 256; a++)
	grayCount[a] = 0;
for (int i = 0; i < height; i++)
{
	for (int j = 0; j < width; j++)
	{
		for (int grayValue = 0; grayValue<256; grayValue++)
			grayCount[grayValue]++;
	}
}
//直方图均衡化
double grayCountper[256] = {};
for (int b = 0; b < 256; b++)
{
	grayCountper[b] = grayCount[b] / (height*width);///平均
}
for (int i1 = 2; i1 < 256; i1++)
{
	grayCountper[i1] = grayCountper[i1 - 1] + grayCountper[i1];
}
//计算灰度概率
int (* buff )[2448]=(int (*) [2448]) calloc (3264 * 2448, sizeof(int));
int grayCountper1[256] = {};
for (int l = 0; l<256; l++)
{
	grayCountper1[l] = round(grayCountper[l] * 255);

}
for (int i2 = 0; i2<height; i2++)
{
	for (int j1 = 0; j1<width; j1++)
	{
		for (int k = 0; k<256; k++)
		{
			if ( *(buf + i2*width + j1) == k)
			{
				buff[i2][j1] = grayCountper1[k];
			}
		}
	}
}//均方化赋值/
for (int i6 = 1; i6<height-1; i6++)
{
	for (int j5 = 1; j5<width-1; j5++)
	{	
buff[i6][j5]= round((buff[i6][j5]+ buff[i6-1][j5]+ buff[i6+1][j5]+ buff[i6][j5-1]+ buff[i6][j5+1] + buff[i6+1][j5-1]+ buff[i6+1][j5+1]+ buff[i6-1][j5-1]+ buff[i6-1][j5+1])/9);
	}
}
//3×3均值滤波//
for (int i3 = 0; i3<height; i3++)
{
	for (int j2 = 0; j2<width; j2++)
	{
		if ( *(buf + i3*width + j2) <=65)
			buff[i3][j2] = 0;
			else
			buff[i3][j2] =255;
	}
}/图像二值化///
int i4 = 0;
int aa[1101] = {};
int G[1101] = {};
int G1[1101] = {};
G[0] = 0;
G1[0] = 0;
for (int a = 450; a <2650; a = a + 2)
{
	for (int j3 = 0; j3 < width; j3++)
	{
		G[i4] = G[i4] + buff[a][j3];
		G1[i4] = G1[i4] + buff[a+1][j3];
	}
	aa[i4] = G[i4] + G1[i4];
	i4 = i4 + 1;
}
计算每两行像素值相加之和///
int i5 = 0;
int aaa[1100] = {};
for (int s = 0; s <1099; s++)
{
	aaa[i5] = aa[s + 1] - aa[s];
	i5 = i5 + 1;
}
///每两行像素和相减//
for (int s1 = 0; s1 < 1100; s1++)
{
	aaa[s1] = abs(aaa[s1]);
}
int kk =20;
int max = aaa[0];
int idx = 0;
for (int i7 = 0; i7 <1099; i7++)
{
	if (max<aaa[i7])
	{
		max = aaa[i7];
		idx = i7;
		}
}
kk = idx *2+440;
///找寻对比度(差)最大区域//
for (int kk2 = kk-30; kk2 <= kk ; kk2++)
{
	for (int kk1 = 0; kk1 < width; kk1++)
	{
		*(buf + kk2*width + kk1) = 0;
	}
}

  • 2
    点赞
  • 27
    收藏
    觉得还不错? 一键收藏
  • 5
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 5
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值