图像练习-答题卡opencv(02)

原图
结果
代码
cpp 复制代码
	// Load source image
	cv::Mat src = cv::imread("answer_card.jpg", cv::IMREAD_COLOR);
	if (src.empty())
	{
		return;
	}

	cv::Mat gray;
	cv::cvtColor(src, gray, cv::COLOR_BGR2GRAY);

	cv::Mat binary;
	double value = cv::threshold(gray, binary, 0, 255, cv::THRESH_BINARY_INV + cv::THRESH_OTSU);

	std::vector<cv::Point2f> imgCorners{ cv::Point2f(0, 0), cv::Point2f(src.cols, 0),
									  cv::Point2f(src.cols, src.rows), cv::Point2f(0, src.rows) };

	cv::Mat dilate;
	cv::Mat kernel = cv::getStructuringElement(cv::MORPH_RECT, cv::Size(1, 7));
	cv::dilate(binary, dilate, kernel);

	std::vector<std::vector<cv::Point>> contours;
	cv::findContours(dilate, contours, cv::RETR_EXTERNAL, cv::CHAIN_APPROX_SIMPLE);

	std::vector<cv::Point2f> corners;
	for (size_t i = 0; i < contours.size(); i++)
	{
		cv::RotatedRect minRect = cv::minAreaRect(contours[i]);
		// rotated rectangle
		cv::Point2f sz[4];
		minRect.points(sz);
		if (cv::Rect(minRect.boundingRect()).width > src.cols / 2) // should be improved
		{
			for (int j = 0; j < 4; ++j) //找到与图像四点最近的对应四点
			{
				cv::Point2f pt = imgCorners[j];
				cv::Point2f nearest_pt = sz[0];
				float dist = cv::norm(pt - nearest_pt); //求两点的距离
				for (int k = 1; k < 4; ++k)
				{
					if (cv::norm(pt - sz[k]) < dist)
					{
						dist = cv::norm(pt - sz[k]); //更新两点距离
						nearest_pt = sz[k];
					}
				}
				corners.push_back(nearest_pt);
			}
		}
	}

	//提取涂抹的黑色小圆
	cv::Mat erode0;
	cv::erode(binary, erode0, cv::Mat(), cv::Point(-1, -1), 10); //should be improved

	cv::Mat dilat;
	cv::dilate(erode0, dilat, cv::Mat(), cv::Point(-1, -1), 5); //should be improved

	cv::Mat results(src.size(), CV_8UC3);
	cv::Mat transform = cv::getPerspectiveTransform(corners, imgCorners);
	cv::warpPerspective(src, results, transform, src.size()); // Create a Mat To Show results

	cv::Mat warp(src.size(), CV_8UC1); // should be improved
	cv::warpPerspective(dilat, warp, transform, src.size());

	//试卷答题卡选项数目
	cv::Size size(20, 5); // this variable should be changed according input
	cv::Mat resize;
	cv::resize(warp, resize, size);
	for (int i = 0; i < resize.cols; ++i)
	{
		std::string answer = "";
		answer += resize.at<uchar>(1, i) == 0 ? "" : "A";
		answer += resize.at<uchar>(2, i) == 0 ? "" : "B";
		answer += resize.at<uchar>(3, i) == 0 ? "" : "C";
		answer += resize.at<uchar>(4, i) == 0 ? "" : "D";

		if (answer.length() > 1) answer = "X"; // Double mark
		int y = 0;
		if (answer == "A") y = results.rows / size.height;
		if (answer == "B") y = results.rows / size.height * 2;
		if (answer == "C") y = results.rows / size.height * 3;
		if (answer == "D") y = results.rows / size.height * 4;
		if (answer == "") answer = "[-]";
		cv::putText(results, answer, cv::Point(50 * i + 15, 30 + y), cv::FONT_HERSHEY_PLAIN, 2, CV_RGB(0, 0, 255), 2);
	}

	imshow("results", results);
	cv::waitKey();
相关推荐
GuWenyue6 小时前
写Agent还要重复封装工具?一套MCP多服务方案,3个能力让AI自动查地图、读写文件、操控浏览器
人工智能·机器学习·开源
GuWenyue6 小时前
90%AI新手不会调参!LangChain双模型流水线实战,一套代码兼顾严谨+创意
人工智能
光锥智能7 小时前
WAIC亮点|兼具泛化能力与作业效率的极智嘉机器人天团
人工智能·机器人
阳光是sunny7 小时前
LangGraph中的Reducer是什么
前端·人工智能·后端
甲维斯7 小时前
Kimi K3 重构10000行单文件屎山代码!
人工智能
阳光是sunny8 小时前
从链到图:LangGraph 入门基础全解析
前端·人工智能·后端
新知图书8 小时前
11.3 详细实现与核心配置(作业批改智能体开发)
人工智能·agent·ai agent·智能体·扣子
深度研习笔记9 小时前
OpenCV工业视觉实战11|多线程解耦+视频流稳流+推理加速,彻底解决卡顿阻塞,实现毫秒级工业实时检测
人工智能·opencv·计算机视觉
delishcomcn9 小时前
AI视觉识别+分切算法:电化铝缺陷检测与裁切一体化解锁
人工智能·算法
触底反弹9 小时前
深入理解大模型采样:Temperature、Top-K、Top-P 的原理与实战
人工智能·算法·面试