OPENCV二值化图像内孔洞填充/小区域去除

本文介绍了一种基于区域生长法的二值图像处理方法,能够有效去除图像中的小区域及孔洞,通过设置不同的邻域模式适应不同应用场景。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

对于二值化图像,去除孔洞时采用的方法实际上与去除小区域相同,因此完全可以用同一个函数进行。

这两个功能可以采取区域生长法来实现。须注意,去除小区域时为保存有用信息,可采用8邻域探测,去除孔洞时则4邻域即可,否则容易泄露,出现靠边缘的孔洞未去除的情况。


代码:

#include<vector>
#include"stdio.h"






#include"cmath"
#include"ctime"
#include"iostream"
#include<opencv2\opencv.hpp>




#include"cv.h"
#include"highgui.h"


#include"cstring"
using namespace std;


using namespace cv;
void RemoveSmallRegion(Mat& Src, Mat& Dst, int AreaLimit = 50, int CheckMode = 1, int NeihborMode = 0);


int main()
{
double t = (double)getTickCount();


IplImage *sr_2;
sr_2 = cvLoadImage("E:\\tupian\\lene.bmp",0);//lene.bmp
//Mat  mask;
cv::Mat Src(sr_2, true);


//char* imagePath = "E:\\SVM\\局部.jpg";
char* OutPath = "E:\\tupian\\lennee3.bmp";


//Mat Src = imread(imagePath, CV_LOAD_IMAGE_GRAYSCALE);
Mat Dst = Mat::zeros(Src.size(), CV_8UC1);




//二值化处理  
for (int i = 0; i < Src.rows; ++i)
{
uchar* iData = Src.ptr<uchar>(i);
for (int j = 0; j < Src.cols; ++j)
{
if (iData[j] == 0 || iData[j] == 255) continue;
else if (iData[j] < 10)
{
iData[j] = 0;
//cout<<'#';  
}
else if (iData[j] > 10)
{
iData[j] = 255;
//cout<<'!';  
}
}
}
cout << "Image Binary processed." << endl;


RemoveSmallRegion(Src, Dst, 20, 1, 1);//去除小区域 8邻域
//RemoveSmallRegion(Dst, Dst, 20, 0, 0);//去除空洞 4 邻域
cout << "Done!" << endl;
imwrite(OutPath, Dst);


t = ((double)getTickCount() - t) / getTickFrequency();
cout << "Time cost: " << t << " sec." << endl;


return 0;
}


//CheckMode: 0代表去除黑区域,1代表去除白区域; NeihborMode:0代表4邻域,1代表8邻域;  
void RemoveSmallRegion(Mat& Src, Mat& Dst, int AreaLimit, int CheckMode, int NeihborMode)
{
int RemoveCount = 0;       //记录除去的个数  
   //记录每个像素点检验状态的标签,0代表未检查,1代表正在检查,2代表检查不合格(需要反转颜色),3代表检查合格或不需检查  
Mat Pointlabel = Mat::zeros(Src.size(), CV_8UC1);


if (CheckMode == 1)
{
cout << "Mode: 去除小区域. ";
for (int i = 0; i < Src.rows; ++i)
{
uchar* iData = Src.ptr<uchar>(i);
uchar* iLabel = Pointlabel.ptr<uchar>(i);
for (int j = 0; j < Src.cols; ++j)
{
if (iData[j] < 10)
{
iLabel[j] = 3;
}
}
}
}
else
{
cout << "Mode: 去除孔洞. ";
for (int i = 0; i < Src.rows; ++i)
{
uchar* iData = Src.ptr<uchar>(i);
uchar* iLabel = Pointlabel.ptr<uchar>(i);
for (int j = 0; j < Src.cols; ++j)
{
if (iData[j] > 10)
{
iLabel[j] = 3;
}
}
}
}


vector<Point2i> NeihborPos;  //记录邻域点位置  
NeihborPos.push_back(Point2i(-1, 0));
NeihborPos.push_back(Point2i(1, 0));
NeihborPos.push_back(Point2i(0, -1));
NeihborPos.push_back(Point2i(0, 1));
if (NeihborMode == 1)
{
cout << "Neighbor mode: 8邻域." << endl;
NeihborPos.push_back(Point2i(-1, -1));
NeihborPos.push_back(Point2i(-1, 1));
NeihborPos.push_back(Point2i(1, -1));
NeihborPos.push_back(Point2i(1, 1));
}
else cout << "Neighbor mode: 4邻域." << endl;
int NeihborCount = 4 + 4 * NeihborMode;
int CurrX = 0, CurrY = 0;
//开始检测  
for (int i = 0; i < Src.rows; ++i)
{
uchar* iLabel = Pointlabel.ptr<uchar>(i);
for (int j = 0; j < Src.cols; ++j)
{
if (iLabel[j] == 0)
{
//********开始该点处的检查**********  
vector<Point2i> GrowBuffer;                                      //堆栈,用于存储生长点  
GrowBuffer.push_back(Point2i(j, i));
Pointlabel.at<uchar>(i, j) = 1;
int CheckResult = 0;                                               //用于判断结果(是否超出大小),0为未超出,1为超出  


for (int z = 0; z<GrowBuffer.size(); z++)
{


for (int q = 0; q<NeihborCount; q++)                                      //检查四个邻域点  
{
CurrX = GrowBuffer.at(z).x + NeihborPos.at(q).x;
CurrY = GrowBuffer.at(z).y + NeihborPos.at(q).y;
if (CurrX >= 0 && CurrX<Src.cols&&CurrY >= 0 && CurrY<Src.rows)  //防止越界  
{
if (Pointlabel.at<uchar>(CurrY, CurrX) == 0)
{
GrowBuffer.push_back(Point2i(CurrX, CurrY));  //邻域点加入buffer  
Pointlabel.at<uchar>(CurrY, CurrX) = 1;           //更新邻域点的检查标签,避免重复检查  
}
}
}


}
if (GrowBuffer.size()>AreaLimit) CheckResult = 2;                 //判断结果(是否超出限定的大小),1为未超出,2为超出  
else { CheckResult = 1;   RemoveCount++; }
for (int z = 0; z<GrowBuffer.size(); z++)                         //更新Label记录  
{
CurrX = GrowBuffer.at(z).x;
CurrY = GrowBuffer.at(z).y;
Pointlabel.at<uchar>(CurrY, CurrX) += CheckResult;
}
//********结束该点处的检查**********  




}
}
}


CheckMode = 255 * (1 - CheckMode);
//开始反转面积过小的区域  
for (int i = 0; i < Src.rows; ++i)
{
uchar* iData = Src.ptr<uchar>(i);
uchar* iDstData = Dst.ptr<uchar>(i);
uchar* iLabel = Pointlabel.ptr<uchar>(i);
for (int j = 0; j < Src.cols; ++j)
{
if (iLabel[j] == 2)
{
iDstData[j] = CheckMode;
}
else if (iLabel[j] == 3)
{
iDstData[j] = iData[j];
}
}
}


cout << RemoveCount << " objects removed." << endl;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值