#include<iostream>
#include <opencv2/opencv.hpp>
using namespace std;
using namespace cv;
int main()
{
Mat src = imread("F:\\PIN_LENGTH\\3.bmp");
Mat dst = Mat::zeros(src.size(), src.type());
//点
Mat ROI_src_point = src(Range(1650,1750), Range(650,1650)); //ROI端点
Mat ROI_src_point_gray;
cvtColor(ROI_src_point, ROI_src_point_gray, COLOR_BGR2GRAY, 1); //ROI端点的灰度图
ROI_src_point_gray = ROI_src_point_gray > 150; //阀值二值化
//线
Mat ROI_src_line = src(Range(1400, 1450), Range(650, 1650)); //ROI直线
Mat ROI_src_line_gray;
cvtColor(ROI_src_line, ROI_src_line_gray, COLOR_BGR2GRAY, 1); //ROI直线的灰度图
ROI_src_line_gray = ROI_src_line_gray > 150; //阀值二值化
//**********************************【找出点所在轮廓】**********************************************
vector<vector<Point>> contours;
vector<Vec4i> hierarchy;
findContours(ROI_src_point_gray, contours, hierarchy, CV_RETR_CCOMP, CV_CHAIN_APPROX_SIMPLE);
//用最小矩形包围轮廓
vector<Rect> boundRect( contours.size() );
for( int i = 0; i < contours.size(); i++ )
{
boundRect[i] = boundingRect( Mat(contours[i]) );
}
vector<Point> pin_point;
//筛选出符合要求的矩形, 并计算出尖点
for( int i = 0; i< boundRect.size(); i++ )
{
if(boundRect[i].br().y - boundRect[i].tl().y > 20)
{
rectangle( ROI_src_point, boundRect[i].tl(), boundRect[i].br(), Scalar(0,0,255), 2, 8, 0 );
float aa = boundRect[i].br().x - (boundRect[i].br().x - boundRect[i].tl().x) / 2.0;
float bb = boundRect[i].br().y;
Point p = Point(aa,bb);
pin_point.push_back(p);
}
}
//对尖点进行排序(轮廓选举出的为逆排序,我不知道其他情况轮廓的产生顺序, 最好进行一下排序)
vector<Point> xx;
vector<Point>::reverse_iterator it;
for(it = pin_point.rbegin(); it != pin_point.rend(); it++)
{
xx.push_back(*it);
}
//冒泡排序
for (int i = 0; i < xx.size() - 1; i++)
{
for(int j = i + 1; j < xx.size(); j++)
{
if(xx[i].x > xx[j].x)
{
Point p;
p = xx[i];
xx[i] = xx[j];
xx[j] = p;
cout << endl<< p << endl;
}
}
}
for(int i = 0; i < xx.size(); i ++) //最终xx为需要的点集
{
xx[i].x += 650;
xx[i].y += 1650;
}
for(int i = 0; i < xx.size(); i++)
{
circle(src, xx[i], 30,Scalar(0,0,255),0);
circle(src, xx[i],2,Scalar(0,255,0),-1);
}
//************************************【找出线的点集】********************************************************
vector<vector<Point>> contours_line;
vector<Vec4i> hierarchy_line;
findContours(ROI_src_line_gray, contours_line, hierarchy_line, CV_RETR_CCOMP, CV_CHAIN_APPROX_SIMPLE);
//用最小矩形包围轮廓
vector<Rect> boundRect_line( contours_line.size() );
for( int i = 0; i < contours_line.size(); i++ )
{
boundRect_line[i] = boundingRect( Mat(contours_line[i]) );
}
vector<Point> line_point;
//筛选出符合要求的矩形, 并计算出尖点
for( int i = 0; i< boundRect_line.size(); i++ )
{
if(boundRect_line[i].br().y == 49 && boundRect_line[i].br().x - boundRect_line[i].tl().x > 10) //筛选条件(49为1450-1400 从0开始的)
{
rectangle( ROI_src_line, boundRect_line[i].tl(), boundRect_line[i].br(), Scalar(0,0,255), 2, 8, 0 );
cout << boundRect_line[i].tl() << " " << boundRect_line[i].br() << endl;
float aa = boundRect_line[i].br().x;
float bb = boundRect_line[i].tl().y;
Point p = Point(aa,bb);
line_point.push_back(boundRect_line[i].tl());
line_point.push_back(p);
cout << p << endl;
}
}
for(int i = 0; i < line_point.size(); i ++) //最终line_point为需要的点集
{
line_point[i].x += 650;
line_point[i].y += 1400;
}
for(int i = 0; i < line_point.size(); i++)
{
circle(src, line_point[i], 1
opencv检查pin脚长度
最新推荐文章于 2024-03-27 19:02:59 发布
该博客探讨如何利用OpenCV的Canny算法以像素精度检测PIN脚长度,并指出为了提高精度,需要将算法转换为亚像素精度。这涉及到深入研究OpenCV的源代码,特别是boundingrect()函数以及其他边缘检测方法的亚像素坐标输出。作者提供了两个参考资料以助于理解亚像素精度的实现。
摘要由CSDN通过智能技术生成